Tip 1 : Be consistent in competitive programming. You can practice on any online platform.
Tip 2 : Do revise the theories like OOPs, OS, etc
Tip 3 : Discuss the approach with your friends. It will help you in mastering the art of explaining your learnings to others.
Tip 1 : Be honest to your resume.
Tip 2 : Highlight your major projects that you have done.
This problem is an alteration to shortest path problem. For solving this I followed the approach of constfucting the adjacency matrix.
Then any shortest path algorithm can be applied. I used Floyd Warshal algorithm to solve it.
We can solve this problem with the help of backtracking. The idea is to start from the first row and place Queen in each square of the first row and recursively explore the remaining rows to check if they lead to the solution or not. If the current configuration doesn’t result in a solution, backtrack. Before exploring any square, ignore the square if two queens threaten each other.
What is an Operating System?
Why we use semaphore?
What is paging and how is it useful.?
Tip 1 : Explain your latest project with all the challenges and pros and cons of the way you handled it.
Tip 2 : Explains why you chose this project and how it helped you in leveling up your knowledge.