Status: 2.9 years of experience
Position: SDE1 at a product-based MNC
Location: Bangalore

Round 1: Problem Solving/Data Structures
The interview began with introductions and a discussion about my project. Then, the interviewer presented two DSA questions:

1. https://leetcode.com/problems/increasing-triplet-subsequence/description/:

I initially proposed an 𝑂(𝑛3) solution and then optimized it to 𝑂(𝑛). I discussed the approach with the interviewer, who then asked me to code it on Google Docs.
After completing the code, we dry ran it on a few test cases. The interviewer then pointed out that my implementation was incorrect because it didn't maintain 𝑖,𝑗,𝑘 explicitly. I tried to explain that the problem only required a boolean return value, but he disagreed. With 15 minutes left, he moved on to the next question without letting me finish discussing the first one.

2. https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/description/:

I solved this question optimally using a sliding window approach on the first attempt.
The interviewer asked for the time and space complexity. I explained that it was 𝑂(𝑛), but he insisted it should be
𝑂(𝑛2) because of the use of two loops.
Despite my efforts to clarify that the worst-case scenario involves iterating over the entire array twice, he didn't understand and abruptly ended the interview.

Will be very happy to be honest if I don't get selected!!