Tip 1 : Practice at least 200 questions from Leetcode and Hackerrank
Tip 2 : Practice variety of questions from different topics and wo medium and hard difficulty level.
Tip 3 : Do at least 2 projects to be mentioned in your resume.
Tip 1: Have some projects on your resume
Tip 2: Craft your resume according to the role for which you are applying
The first round was an online take-from-home test with MCQs on Quants, Logical Reasoning, Verbal Ability and two advanced coding questions section at the end. We were given a few window slots during which we could take the test for 180 minutes. The test was of medium difficulty level and I was able to clear the test.



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
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.
The second round was a video call interview round which consisted of two sub-rounds, that is, the technical round and the HR round. The technical round consisted of coding questions and questions from my projects. The HR round consisted of cultural fit and behavioural questions. I was able to satisfy both the technical interviewer and HR with my responses.



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.

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: