Tip 1: Practice coding problems regularly, starting from easy to hard levels.
Tip 2: Focus on thoroughly understanding core concepts in DBMS and OOPs.
Tip 3: Take timed mock tests to improve speed and accuracy in aptitude.
Tip 1: Use a two-column resume.
Tip 2: Don’t mention everything, and avoid including anything you don’t know.
Two coding questions were asked.




Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Use Kadane’s Algorithm.
The round had three parts: a graph-based DSA question, a DBMS query, and an in-depth OOPs question. It was technical and focused on core concepts.



If it is impossible to finish all courses, return an empty array. If there are multiple answers, return any one.
Input:
3 2
1 2
2 3
There are three courses to take. To start with, First course 3 is taken. Then course 2 is taken for which course 3 must be completed.
At last course 1 is taken for which course 2 must be completed. So the correct course order is [3,2,1].
Coding Problem — Graph (Topological Sort).
Given 3 bulbs, and their switches are placed in another room.
One of the bulbs is not working.
How will you identify which bulb is connected to which switch, considering both the switches and the bulbs are in different rooms?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?