Tip 1: Prepare well for DSA. I personally recommend Coding Ninjas for interview preparation.
Tip 2: Be confident and stay relaxed during the interview.
Tip 3: Revise your projects thoroughly—understand how they work and their functionalities.
Tip 1: Keep your resume concise—aim for a single page—and include only the skills you are confident in.
Tip 2: Never include false information on your resume.
The assessment consists of 30 MCQs and 3 coding questions.



For the given binary tree

The level order traversal will be {1,2,3,4,5,6,7}.
By Using BFS, Queue Data Structure.



As this value might be large, print it modulo 10^9 + 7
By using recursion to generate all subsequences.
In the technical round of interviews, they asked questions about Python, projects, and DBMS. The interviewer mainly focused on project-related discussions.




By using five pointers (Top, Bottom, Right, Left, and Direction), I was able to solve it.

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