Tip 1 : Be well versed with what you mentioned in your resume.
Tip 2 : Practice atleast 10 to 20, Easy to medium level questions for each data structure and algorithmic approach
Tip 3 : Make atleast one full stack project end to end ( ui, api, database and deployment)
Tip 1 : Add atleast one project which you know wholly.
Tip 2 : Do not add many programming languages on your resume.



Consider If N = 2 , M = 4, Time = [[0, 2], [3, 0]] and Toll = [[0, 10], [ 5, 0]]]
The optimal path to reach node 1 from node 0 is 0 -> 1. The time required in the path is 2, and the minimum toll needed within the given time constraints is 10. Hence the answer is 10.
This round was about basic data structures, OOps concepts, and SQL queries related to the Group by clause.
Find the second highest salary from employee tables.
Initially, there was some discussion around one of the projects mentioned in the resume and then a coding problem.



If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.

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