Tip 1 : Solve RS Aggarwal Aptitude and Problem Solving Books.
Tip 2 : Practice Coding questions from prepInsta.
Tip 3 : Worked on communication skills
Tip 1 : Mark skills with Bold letters.
Tip 2 : Mention projects on resume



Down: (row+1,col)
Right: (row, col+1)
Down right diagonal: (row+1, col+1)
Step 1 : I used a queue for Level Order Traversal.
Step 2 : I used a flag variable which keeps track of alternate levels to reverse the order of the corresponding level traversal.
Step 3 : flag==true implies we have to insert from left to right and flag==false means we have to insert an element from right to left our answer ArrayList.



If the given string is: STR = "abcde". You have to print the string "edcba".
Try to solve the problem in O(1) space complexity.
Step 1 : Create a temporary byte[] of length equal to the length of the input string.
Step 2 : Store the bytes (which we get by using the getBytes() method) in reverse order into the temporary byte[].
Step 3 : Create a new String object using byte[] to store result.



If a number has trailing zeros, then its reverse will not include them. For e.g., the reverse of 10400 will be 401 instead of 00401.
My Approach
Step 1 : Given a number: 12345
Step 2 : Algorithm to reverse the number.
- There are 25 horses among which you need to find out the fastest 3 horses. You can conduct race among at most 5 to find out their relative speed. At no point you can find out the actual speed of the horse in a race. Find out how many races are required to get the top 3 horses.
Explanation:
s1- The minimum no of races to be held is 7.
Make group of 5 horses and run 5 races. Suppose five groups are a,b,c,d,e and next alphabet is its individual rank in this group(of 5 horses).for eg. d3 means horse in group d and has rank 3rd in his group. [ 5 RACES DONE ]
a1 b1 c1 d1 e1
a2 b2 c2 d2 e2
a3 b3 c3 d3 e3
a4 b4 c4 d4 e4
a5 b5 c5 d5 e5
s2- Now make a race of (a1,b1,c1,d1,e1).[RACE 6 DONE] suppose result is a1>b1>c1>d1>e1



4 4 4 4 4 4 4
4 3 3 3 3 3 4
4 3 2 2 2 3 4
4 3 2 1 2 3 4
4 3 2 2 2 3 4
4 3 3 3 3 3 4
4 4 4 4 4 4 4
Step 1 : Print the pattern in such a way that the outer rectangle is of the number ‘N’ and the number goes on decreasing
Step 2 : N=4
Step 3 : Using 2-D array, put 2 loops from i,j.
Morning time
Describe a time when you experienced conflict with a coworker. How did you handle it?
How does this job compare to others you might be interviewing for?
What interests you about this role?
What critical feedback do you most often receive?
Tip 1 : Practice well
Tip 2 : Speak in front of mirror

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