Round 1 : Hackerrank Test (1.30 hours)
-10 Java/Angular MCQ
-2 Coding Questions
1] arr = [18, 2,5,7,3,4]
create new array same size, store sum of all left elements smaller that it
2] 01011 o/p- 3 (010, 101, 101)
count all the cobination size 3 with adjacent element not matching

Round 2 : Code Pair Algorithm and DS problems
1] Reverse string without changing position of special characters
2] arr = [8,2,2,5,7,8,9,1,12,7] return unique elements from array with O(n), don't use inbuilt collections.
3] Create Confirmation dialogue box, what are position in html, queries in css
4] Difference between Component & Directive, Diff Constructor & OnInit, lifecycle
5] How to create html page compatible with all screens

Round 3 : Algorithm and DS problems and Java Technical
1] Explain generics, difference between super and extend in generics
2] Explain Finalized. Types of GC in java. Explain any GC Algorithm.
3] What is volatile. Explain in detail.
4] how to delete duplicate inserts in sql
5] Write code for Binary search recursive.
6] Implement OwnHashMap without using any inbuilt map or set.
7] LLD for Tea Machine.

Round 4 : Algorithm and DS problems and Java Technical
1] Implement Queue using stack
2] Find list of all element in array equals to target sum
3] Find all siblings of given node in N-ary tree.

Round 5 :
1] Introduction & previous project
2] Other leadership principle questions.

Round 6 : HR Discussion

Result : Selected