Tip 1 : cover matrix and trees. Matrix is frequently asked
Tip 2 : cover dbms. Properly run queries on paper
Tip 1 : bullet points and dont clutter
Tip 2 : write relevant stuff which highlights ur skill
2 coding questions
1 tree 1 matrix



For the given binary tree

The level order traversal will be {1,2,3,4,5,6,7}.
Just take a queue and insert child till end of that level. Put some dummy values to ensure you know when you reached end of level in queue.



For a (6 x 6) board, the numbers are written as follows:

You start from square 1 of the board (which is always in the last row and first column). On each square say 'X', you can throw a dice which can have six outcomes and you have total control over the outcome of dice throw and you want to find out the minimum number of throws required to reach the last cell.
Some of the squares contain Snakes and Ladders, and these are possibilities of a throw at square 'X':
You choose a destination square 'S' with number 'X+1', 'X+2', 'X+3', 'X+4', 'X+5', or 'X+6', provided this number is <= N*N.
If 'S' has a snake or ladder, you move to the destination of that snake or ladder. Otherwise, you move to S.
A board square on row 'i' and column 'j' has a "Snake or Ladder" if board[i][j] != -1. The destination of that snake or ladder is board[i][j].
You can only take a snake or ladder at most once per move: if the destination to a snake or ladder is the start of another snake or ladder, you do not continue moving - you have to ignore the snake or ladder present on that square.
For example, if the board is:
-1 1 -1
-1 -1 9
-1 4 -1
Let's say on the first move your destination square is 2 [at row 2, column 1], then you finish your first move at 4 [at row 1, column 2] because you do not continue moving to 9 [at row 0, column 0] by taking the ladder from 4.
A square can also have a Snake or Ladder which will end at the same cell.
For example, if the board is:
-1 3 -1
-1 5 -1
-1 -1 9
Here we can see Snake/Ladder on square 5 [at row 1, column 1] will end on the same square 5.
Simple bfs, store in global array the path.
General questions , apti questions. Whatever the interviewer had in mind.
Run a join query
Tip 1: practice queries on paper before hand.
Probability of a coin if no heads 3 times.
Just stipend discussion, and skimmed through my resume to ensure nothing was fake. Verified the timelines of my projects and what i did when.
1. Your strengths and weakness
2. Expected Salary?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: