Year of Experience: 3.9 Years. There are four rounds in total.
Round 1(Screening Round): Duration: 60 minutes.
- find pair in an array whose sum is equal to K
- Design Multi-level Parking lot (classes)
- Questions related to Java: Generic classes, Locks in java. Design pattern
Round 2(DS Round): Duration: 60 minutes.
- https://www.geeksforgeeks.org/largest-subarray-with-equal-number-of-0s-and-1s/amp/
- https://www.geeksforgeeks.org/longest-sub-array-sum-k/amp/
- Duplicate values are allowed in BST or not
- https://www.geeksforgeeks.org/a-program-to-check-if-a-binary-tree-is-bst-or-not/amp/
- https://www.geeksforgeeks.org/burn-the-binary-tree-starting-from-the-target-node/amp/
Round 3: Duration 60 minutes
- https://www.geeksforgeeks.org/find-element-array-sum-left-array-equal-sum-right-array/amp/
- Design Database for seller, product, price
- Difference between POST and PUT APIs
- Caching mechanism
- Monitoring System in application
Round 4: Duration 60 minutes
- Questions related to the project and managerial questions