Tip 1 : Prepare DSA well and I personally recommend Coding Ninjas and GeeksForGeeks for interview preparation.
Tip 2 : Be confident & relaxed during the interview.
Tip 3 : Do revise your projects i.e how it works and what are its functionalities.
Tip 1: Make your resume short and try to make it one page only and mention all your skills that you are confident in.
Tip 2: Do not put false things on your resume.
This round, mainly focused on the aptitude-level question, which is based on English Comprehension, Ratio, Math.
after that 2 coding questions.



The attendees holding numbers from 1, 4, 3 are shown:

For the above example 1 -> 4 -> 3, 1 -> 3 -> 4 is the only correct answer, i.e nodes should be grouped sequentially. Hence, 3 -> 1 -> 4 is the wrong answer as we have to preserve the same order.
By using Two Pointers like even, odd.


You are given, ‘str’ = ‘AbcdEfgh’, in this string if you convert all the characters into lowercase, the string will be ‘abcdefgg’. Hence it is the answer.
By using Python STL.
I had been rejected for the Interview. Technical Interviewer asked me for C++, Oops, Project-related Questions, and DBMS Questions.


For the input string 'abcab', the first non-repeating character is ‘c’. As depicted the character ‘a’ repeats at index 3 and character ‘b’ repeats at index 4. Hence we return the character ‘c’ present at index 2.
By traversing one by one.


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).
By using the Sieve of Eranthosis.

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