4 Rounds\n**1. Coding and Problem Solving** - \n\t\t1.1 Check if there exists a contiguous subarray with sum = 0 in the array.\n\t\t1.2 Find the longest contiguous subarray within the array with sum=0 in the array --> [Link](https://leetcode.com/discuss/general-discussion/1042029/find-length-of-the-largest-subarray-with-sum-0)\n\n2. **Low Level Design** - Design a single entry-exit, single floor parking lot catering to the Object oriented principles. As part-2 of the same question, the interviewer had introduced Multi-threading in the problem on how would assigning the parking slot to multiple vehicles work at once. Wanted to check the knowledge on Concurrent Data Structures and Synchronised Keywords/Locks.\n\n3. **Managerial Round** - Project Deep Dive. 2 Programming Questions.\n\t3.1 Minimum number of jumps to reach end of the array - Solve using Greedy in O(n). - [Link](https://leetcode.com/problems/jump-game-ii/)\n\t3.2 Find the largest mountain subarray in the array - [Link](https://leetcode.com/problems/longest-mountain-in-array/)\nMantain extreme calm and composure during this round, even if it seems frustrating at one point.\n\n4. **Directoral Round** - Awaiting feedback. Would update the post later\n\nYOE - 4 years

4 Rounds\n1. Coding and Problem Solving - \n\t\t1.1 Check if there exists a contiguous subarray with sum = 0 in the array.\n\t\t1.2 Find the longest contiguous 