Year Of Experience: 2 Year
Round 1: Technical round (1 hour)
- There are n friends. Either a friend can remain single or can pair with other friends. Find a number of ways n friends can pair or remain single.
- Given a Binary Tree, find the maximum sum from a leaf to a root.
- Questions based on OOPS concepts in Java.
- Simple SQL query using INNER JOIN.
Round 2: Technical round (1 hour)
- Discussed the current project in detail for around 30 minutes.
- Questions based on Java HashMap, OOPS concepts, and output of Java code snippets.
- LLD for Beverage Vending Machine
- SQL query question.
Round 3: Technical round (1 hour)
- 2 SQL queries based on medium-level questions.
- Given a list of integers, find the largest sum subarray.
Round 4: Managerial round (1 hour)
- Strengths and weaknesses
- Behavioral questions from previous experience.
- Find the maximum element in the stack.