Round 1:Coding Round
The platform was geeekd.com, and it really has a very bad interface and an even worse text editor.
There were 5 questions, with choice between either C++ or Java. Time given was 50 min.
Question 1: Print the values in the boundary nodes of a tree in an anti-clockwise direction. https://www.geeksforgeeks.org/boundary-traversal-of-binary-tree/
Question 2: Merge two sorted Linked lists.
Question 3: Print the minimum number of swaps required to rearrange a string of Cs and Ds, such that no two C or D are consecutive. For example, if input string is CCCDDD, output will be 3. (CCCDDD -> CCDCDD -> CDCCDD -> CDCDCD)
Question 4: Given a number of nodes, such that they form connected clusters. Two different clusters will not have any inter-connection. Find the number of pairs of nodes (a, b) that can exist such that a and b belong to two different clusters. Eg, 1->2 and 3->4 be two clusters, output will be 4. ((1, 3), (1, 4), (2, 3), (2, 4))
Question 5: Don’t Remember.
Result not yet declared for Round 1.
Result not yet declared for Round 2.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.