Tip 1 : do leetcode medium problems as much as possible
Tip 2 : refer Grokking System Design Interview course
Tip 3 : ask for your friends to conduct mock interviews so that you are interview ready
Tip 1 : Your resume should always be of single page
Tip 2 : Only write key projects in your resume not all projects since we do a lot of projects during software development
It was during evening around 4-5 pm, it was purely DSA and problem solving round, the environment was very encouraging, the interviewer was very friendly and was giving me slight hints which I caught



If the input string is ‘str’ = ”aazbbby”, then your output will be “azby”.
Note that we are just removing adjacent duplicates.
The interview happened in evening only around 5 pm and went till 3 hours including coding + code review. There were many interviewers during the call, one was the main and rest of them were shadow interviewers. The environment was good, interviewer asked me to go through the problem statement and ask any doubt I may have or any assumptions that I can consider while solving the problem.



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.
The interview was in evening itself, It was a Hiring Manager round, the hiring mananger was super chill and made me very comfortable, it didn't feel like an interview, it was more of a general discussion kind of round, he just asked me what all projects I have done recently and what all tech stack I have worked on, he did not grind me at all, it was a very easy round
He just asked me about my projects and then just asked me how could I had optimised it further, anything that I did which could be improved in the projects.
Tip 1 : Just give your 100%
Tip 2 : Try to show your meaningful contribution in your organization
Tip 3 : Be ready for any if and buts in your projects

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?