Tip 1 : Try to code daily(consistency)
Tip 2 : Do not copy and paste solutions if you are not able to solve some problem, take hint or understand the approach and try to write your own code.
Tip 3 : Push your limits
Tip 1 : It should be short and clean
Tip 2 : Make sure you know everything that you are putting in your Resume, try to build your Resume based on company.
Coding Round of 3 hours having only one questions
In the below map of Ninjaland let say you want to go from S=1 to T=8, the shortest path is (1, 3, 8). You can also go from S=1 to T=8 via (1, 2, 5, 8) or (1, 4, 6, 7, 8) but these paths are not shortest.
I solved using DFS
At Afternoon, Environment was good.
1. What is ACID properties?
Tip 1:Prepare query related questions
DBMS related questions
1. What is a deadlock?
Basics of life related questions
1. Where do you see yourself after 5 years?
2. What are your strengths and weaknesses?
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What does the SQL function NOW() return?