Tip 1: Practice at least 400 DSA problems, and aim to solve intermediate-level problems efficiently using recursion, memoization, and dynamic programming.
Tip 2: Complete 2-3 projects, including at least one full-stack project.
Tip 3: Explore and practice JavaScript concepts thoroughly.
Tip 1: Use a good template with projects highlighted.
Tip 2: Keep your resume to one page.
The interview started around noon via Google Meet. The interviewer was good and asked very logical questions.



I initially tried to use sorting algorithms, but the interviewer asked me not to use them and to hard-code a solution with a time complexity of less than O(n2). I found a solution by maintaining two pointers, first and last, as the non-zero element indexes, and placed all the non-zero elements between them while moving zeros before the first index element. This approach resulted in a time complexity of O(n), which is less than O(n2). The test cases passed, and the solution was accepted.
It was the final round, mostly a personal interview with the Project Manager and Engineering Head. They discussed my interests, and I mentioned that I would work on whatever was provided by the team. I also expressed that I am more interested in a backend role.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the best case time complexity of Bubble Sort?