Tip 1: Always review problems you've already solved.
Tip 2: Focus on quality, not quantity.
Tip 1: Include all the keywords from the job description in your resume to increase your chances of getting shortlisted.
Tip 2: Thoroughly explain your projects, ensuring it is clear that you've made valuable contributions to them.



//Warm-up question:
Given a grid of size (N x N), cells S and T, impassable cells with water,
find if an S->T path exists, assuming we can only move horizontally/vertically.
No coding is required, only explain how you would solve this problem.
// Main Question:
A mouse is trying to get from its starting position S to a target T.
The problem is that there is a sleeping cat C on the grid.
The closer the mouse approaches the cat, the higher the chance of
the cat to wake up. So, the mouse wants to get to T, staying as far
away as possible from the cat C.
Formally, assume again a square grid of size (N x N), allowing only
horizontal and vertical moves, impassable cells with water,
and cells S, T, and C. We want to find a path from S to T
for which the minimal distance to C along the path is maximal.
Step 1: For the first part, I explained the standard DFS solution to him.
Step 2: The interviewer gave the main question, and I immediately jumped into the optimized solution.
Step 3: The solution was a modified Dijkstra algorithm—store the visited nodes in a priority queue (PQ) according to their distance from the cat, then pick the nearest node from the PQ for the next iteration.



For the query of type 1, you can assume that the array has at least k values. And at any time, the product of any contiguous sequence of numbers will fit into a single 32-bit integer without overflowing.
Step 1: Asked for all clarifications for the initial question.
Step 2: Explained the approach and coded the solution using a queue.
Step 3: The interviewer asked a follow-up question.
Step 4: Changed the solution to use an array instead of a queue, explained the changes, and coded the solution. The interviewer was satisfied.



N = 5
JUMP = [1,2,3,4,5]
ANSWER:- The answer should be YES as you can jump from 1st index to 2nd index, from 2nd index to 4th index, and from 4th index to 5th index.
Step 1: Initially stuck in the solution but later came up with the right solution.
Step 2: Started from the end of the array, travelled left till a bigger element was found, added it to the answer and repeated the same thing.
Step 3: The interviewer was extremely happy and satisfied.
It was a standard Googlyness and leadership round and standard questions were asked which are listed down.
In the end, I asked a few questions about company and culture.
Tip 1: The first three questions will be asked for sure, prepare beforehand.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL clause is used to specify the conditions in a query?