Tip 1 : For DS and Algo, keep practicing every day on Leetcode, HackerEarth, and make a habit of participating in contests.
Tip 2 : Projects are vital in interviews, have at least 3 projects on Resume, in the field/profile which you're applying for.
Tip 3 : Give Mock Interviews.
Tip 1 : Resume should be short and keep it under 1 page.
Tip 2 : Include skills that you're 100% confident in.
Tip 3 : Highlight your internships and projects section appropriately
This was an Aptitude/Technical test of 1 hour where there were 2 sections
1. Aptitude (Quantitative and Logical)
2. Technical (DS/Algo, and Programming Output Questions)
Timing: Morning
Environment: Online
Timing: Morning (10 AM)
Environment: Online (Proctored)
Coding Round (3 Questions)


If you are asked to find the 7th prime number, it’ll be 17 because the first 7 prime numbers are 2, 3, 5, 7, 11, 13, 17.
Try to solve the problem in O(N log log N) + O(N).
Step 1 I opted for the Sieve of Eratosthenes approach.
Step 2 Store all prime numbers in a vector and return (n-1)th for Nth Prime Number.


If STR1 = “codingninjas” and STR2 = “sing”. We can form the second string using the characters of the first string. This is because “s”, “i”, “n”, “g” are present in the string STR1.
Step 1 The idea was to count frequencies of string 1 and deduct from frequencies of string 2 simultaneously.
Step 2 If frequency at any stage becomes negative, false should be returned.



The answer could be very large, output answer %(10 ^ 9 + 7).
Step 1 I followed the recursive approach initially, even though it passed all the cases.
Step 2 I still had time so changed it to DP, which reduced my time.
Timing: 10:00 AM
Environment: Online (Webcam + Mic on)
The interviewer was friendly and to the point.



Step 1: I went for the Hashing technique, which was more of a brute force approach.
Step 2: So, I went for a more optimized approach of Floyd’s Cycle-Finding Algorithm, which is 0(n) in Time and 0(1) in space. The interviewer was satisfied.


For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
1
/ \
2 3
/ \
4 5
Output: 1 3 2 4 5


The width of each bar is the same and is equal to 1.
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:

You don't need to print anything. It has already been taken care of. Just implement the given function.
Step 1 I preferred initially to traverse each array element and find the highest bars.
Step 2 To improve on the previous solution, instead of array traversal, I pre-computed the heights of the highest bars on left and right.
Timing (In Evening)
Environment (Same as Technical Interview)
Tip 1: Be confident
Tip 2: Look at them with a straight back
Tip 3: Be honest and highlight your strengths.
Tip 1 : Don't say things like the CEO of the company or where you're sitting.
Tip 2 : Try to read different answers and be confident.
Tip 1 : Before any interview have knowledge of what the company does.
Tip 2 : How it has performed over the years, what are its focus in business?

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