Tip 1 : Practice practice practice
Tip 2 : consistent work
Tip 1 : use action words in ur resume
Tip 2 : never leave out too much of blank space
Let’s say N = 2. The strings of length 2, which satisfy the given constraints are: “aa”, “ab”, “ac”, “ba”, “bc”, “ca”, “cb”, “cc”. Hence, the output is 8.
For Amount = 70, the minimum number of coins required is 2 i.e an Rs. 50 coin and a Rs. 20 coin.
It is always possible to find the minimum number of coins for the given amount. So, the answer will always exist.
You are given, ‘ARR’ =[4, 3, 5, 1, 4, 5], and ‘K’ = 5. In the given array the pair sums divisible by ‘K’ are [4,1], [5, 5], [4, 1]. Since there are a total of 3 pairs, the answer is 3.
Round had 2 DSA questions, followed by roughly 30-40 questions on OS,DBMS,oops altogether.
‘ARR1’ = [3 6 9 0 0]
‘ARR2’ = [4 10]
After merging the ‘ARR1’ and ‘ARR2’ in ‘ARR1’.
‘ARR1’ = [3 4 6 9 10]
Consider the input strings “ABCDGH” and “AEDFHR. Last characters do not match for the strings. So length of LCS can be written as:
L(“ABCDGH”, “AEDFHR”) = MAX ( L(“ABCDG”, “AEDFHR”), L(“ABCDGH”, “AEDFH”) )
So the LCS problem has optimal substructure property as the main problem can be solved using solutions to subproblems.If we draw the complete recursion tree, then we can see that there are many subproblems which are solved again and again. So this problem has Overlapping Substructure property and recomputation of same subproblems can be avoided by either using Memoization or Tabulation.
One hard question and SQL questions.
If ‘A’ is 13(1101) and ‘B’ is 7(0111), The number of bits that should be flipped is 2(0111).
HR Discussion on call regarding my Projects,internships and 5-6 HR round questions
Whats the most challenging work you ever took? How you solved that problem? What if you have a urgent Problem ,for ex, some imp bug fix which is really urgent, what are the steps which you take? What do you know about DE Shaw?
Tip 1 : Be honest
Tip 2 : Communicate well with the interviewer while speaking about the experiences you had in past.