Round 1: There were three questions in first round:-
- How to find all boundary node of a tree. GeeksforGeeks Link
- How to reverse a string using without any other variable. GeeksforGeeks Link
- From an array, Need to find an index in which sum of left elements & sum of right elements are same. GeeksforGeeks Link
Round 2:
- Sort an array arr = {1, 0, 0, 0, 1, 0, 1, 1, 1, 1} with o(n) complexity. It is also called segregation of an array. GeeksforGeeks Link