Tip 1 : Practice aptitude
Tip 2 : Practice coding
Tip 3 : Practice system design
Tip 1 : Have at least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
It was a Coding + MCQ round.
Aptitude(20 questions ) : Topics like Ratio and proportion, Speed and Distance, Percentage, Profit and Loss, etc.
Difficulty Level - Easy-medium.
Verbal(20 questions) : Topics like error correction, synonyms, antonyms, Comprehension passages, etc.
Difficulty Level - Easy-Medium.
Technical Subjects(30 questions) : Topics like DBMS, Operating System, Computer Network, Output based Questions, OOPs, etc.
Difficulty Level-Easy-Medium.
After the Aptitude test. Students who qualified(Qualifying marks were not disclosed), were redirected to the Coding assessment.
Coding Assessment: (30 min): This round consisted of two coding questions. Try to do both questions, as it would increase the chances of getting shortlisted.



If the given string is: STR = "abcde". You have to print the string "edcba".
Try to solve the problem in O(1) space complexity.



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.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?