Round 1 : Technical Round

1. Two lists are given: the first list contains version numbers [1, 2, 3, 4, 5, 6, 7, 8], and the second list contains the compile time of each version [5, 6, 4, 6, 9, 7, 8, 9].

• Print all the version numbers whose compile time is greater than the previous version.
• Print all the version numbers whose compile time is greater than the previous versions.
• Provided two additional situations (unable to recall specifics) and asked me about my approach and code.

2. How does Binary Search work and write code of Binary Search.

3. Move all zeroes to the end of the array. Initially, provide a brute-force approach, then ask me to do it in an optimized way.

4. About current projects that I worked upon and how deployment will be done.

Round 2 : Technical Round + Design

1. An input list is given, containing elements for which the element and its reverse are not the same. Return the element's reverse number. Told me to use list comprehension for reversing the number, but I used a loop instead. When asked to explain the code, I provided an explanation, and the interviewer was satisfied.

• Input [12,23,33,98,101]
• Output [21,32,89]

2. Create a Python class to implement an API limiter that allows only 60 requests per minute, along with a dummy function inside the class serving as the API. Write code to call the API function 100 times with a 1-second delay. The first 60 calls should return true, and after the 60th call, it should return false.

3. How to create a URL shortener: Determine which components to use, establish the success path, and identify potential corner cases. Also, decide on the type of URL validation to implement.