Tip 1: Interviewers primarily focus on how confidently you explain the fundamentals. A clear understanding of core concepts often makes a stronger impression than memorizing advanced topics.
Tip 2: When given a coding problem, aim to solve it within the time limit. If you have doubts, don’t hesitate to clarify them. Most importantly, explain your approach—interviewers value your thought process as much as the final answer.
Tip 3: A solid grasp of core subjects (OOPs, DBMS, OS, CN, etc.), along with consistent practice of DSA problems, will boost both your speed and confidence during technical rounds.
Tip 1: You need to have full knowledge of everything you mention on your resume.
Tip 2: Do not include false information on your resume.
The round was an online test and we had to keep our camera on all the time it was a proctored test and couldn't switch the tabs and there was no chance of doing any malpractices.

This is essentially a shortest path problem in a graph:
Each position i in the array is a node.
Moving to i+1 is like an edge of weight 1.
Jumping from i → j is like an edge of weight (j - i) but modifies A[j].
Approach:
Use Dijkstra’s algorithm (priority queue / min-heap) to always explore the minimum-cost path first.
Each state is defined by (index, array configuration).
Keep a visited set to avoid re-computation.
Options at each step:
Option 1: Move to i+1 with cost 1.
Option 2: For all j > i, if A[j] % A[i] == 0, jump to j with cost (j - i) and increment A[j]



1. ‘N’ contains only digits ‘0’ to ‘9’ and English letters ‘A’ to ‘F’.
2. Decimal equivalent of 0 is 0, 1 is 1, . . .9 is 9, A is 10, B is 11, . . . F is 15.
This was a 45-minute test with two medium-to-hard questions, and we had to solve at least one. I picked a Dynamic Programming (DP) question—challenging but doable. After some intense thinking, I managed to solve it.



Explain the four pillars of OOPS: Abstraction, Encapsulation, Inheritance, and Polymorphism. (Learn)
Write a query to find the second-highest salary. (Practice)

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL clause is used to specify the conditions in a query?