Tip 1 - Practice At least 250 Questions of DS algo
Tip 2 - Do at least 2 application based projects
Tip 3 - Practice questions with optimized approaches
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Project should clear and crisp
MCQs- Aptitude + Quantitative
2 questions came in coding round



Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]
Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]
Explanation: The array is sorted in increasing order.
Keep three indices low = 1, mid = 1 and high = N and there are four ranges, 1 to low (the range containing 0), low to mid (the range containing 1), mid to high (the range containing unknown elements) and high to N (the range containing 2).
Traverse the array from start to end and mid is less than high. (Loop counter is i)
If the element is 0 then swap the element with the element at index low and update low = low + 1 and mid = mid + 1
If the element is 1 then update mid = mid + 1
If the element is 2 then swap the element with the element at index high and update high = high – 1 and update i = i – 1. As the swapped element is not processed
Print the array.



If two or more such subarrays exist, return any subarray.
Traverse the array from start to end.
From every index start another loop from i to the end of array to get all subarray starting from i, keep a variable sum to calculate the sum.
For every index in inner loop update sum = sum + array[j]
If the sum is equal to the given sum then print the subarray.
Basic Hr Questions were asked. I was also asked about some questions from DS algo + from my projects. I was also asked questions from DBMS. I was also asked to solve some puzzle Questions




Let the array have R rows and C columns. seen[r] denotes that the cell on the r-th row and c-th column was previously visited. Our current position is (r, c), facing direction di, and we want to visit R x C total cells.
As we move through the matrix, our candidate’s next position is (cr, cc). If the candidate is in the bounds of the matrix and unseen, then it becomes our next position; otherwise, our next position is the one after performing a clockwise turn.
Two students appeared at an examination. One of them secured 9 marks more than the other and his marks was 56% of the sum of their marks. The marks obtained by them are:
Let their marks be (x + 9) and x.
Then, x + 9 = 56/100 (x + 9 + x)
25(x + 9) = 14(2x + 9)
3x = 99
x = 33
So, their marks are 42 and 33.
Six bells commence tolling together and toll at intervals of 2, 4, 6, 8 10 and 12 seconds respectively. In 30 minutes, how many times do they toll together ?
L.C.M. of 2, 4, 6, 8, 10, 12 is 120.
So, the bells will toll together after every 120 seconds(2 minutes).
In 30 minutes, they will toll together 30 + 1 = 16 times.
2
Traveling at 3/4th of the original Speed a train is 10 minutes late. Find the usual Time taken by the train to complete the journey?
Let the usual Speed be S1 and usual Time be T1. As the Distance to be covered in both the cases is same, the ratio of usual Time to the Time taken when he is late will be the inverse of the usual Speed and the Speed when he is late
If the Speed is S2 = ¾S1 then the Time taken T2 = 4/3 T1 Given T2 – T1 = 10 =>4/3 T1 – T1 = 10 => T1 = 30 minutes.

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: