Tip 1 : Just be confident during interview and if you are stuck in between any question, then ask for a hint from the interviewer.
Tip 2 : The practice is key for success, so practice hard for Data Structures and Algorithms coding problems on Coding ninjas as it is the best platform for coding.
Tip 3 : Also you may practice on Geeks For Geeks or any other interview portal.
Tip 1 : Mention all internships which you have done, as it increases your chances of shortlisting your resume.
Tip 2 : Also just write that skills which you are pretty confident about.
The coding test was conducted on Hackerrank platform. The test was in the evening. There were two coding questions of medium difficulty. The test was proctored, our webcam was on but not the mic. Also we were not allowed to switch tabs.
500+ students sat in this round out which 20 were shortlisted for the next interview round.



The given graph may have connected components.



A pair ('ARR[i]', 'ARR[j]') is said to be an inversion when:
1. 'ARR[i] > 'ARR[j]'
2. 'i' < 'j'
Where 'i' and 'j' denote the indices ranging from [0, 'N').
In this round, 2 interviewers were present. They shared Docs in which we had to write code. Our camera was on.



The input for the tree depicted in the below image would be :

1
2 3
4 -1 5 6
-1 7 -1 -1 -1 -1
-1 -1
Level 1 :
The root node of the tree is 1
Level 2 :
Left child of 1 = 2
Right child of 1 = 3
Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6
Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)
Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)
The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null (-1).
The above format was just to provide clarity on how the input is formed for a given tree.
In the input, each value of the sequence will be present on a separate line.



This was HR round but consisted problems related to core subjects too.
What is a virtual function? Give an example.
What is encapsulation? What is polymorphism?
Introduce yourself and why are you intrested in Computer science?
Why Oracle.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?