First Technical Interview
- Commenced with self-introduction, followed by a deep dive into Data Structures and Algorithms.
- Tasked with solving the Trapping Rainwater problem, followed by optimizing it.
- Requested to provide the time complexity proof for Merge Sort.
- Delved into Computer Science fundamentals: Transactions, Object-Oriented Programming, and its advantages.
- Presented with the Largest Rectangle in Histogram problem and asked to optimize.
- Ended with a question on Reverse Integer.
Duration: 1 hour and 15 minutes.