1. Recruiter call
2. Technical Interview- solve algorithms with prompts along the way to discuss different approaches to data structures etc. that could be used. Problems due to communication barrier.
Interview questions [1]
Question 1
Solve a medium level algorithm problem with questions by the interviewer about how it could be done differently along the way. Main problem I had was I could not understand the interviewer due their heavy accent. This resulted in me asking for them to repeat their questions alot, burned through time and made things tense. Ultimately I solved the problem, but the interviewer was frustrated that I did not do it the way they prompted. I couldn't understand them unfortunately. I guess it seemed like I wasn't good at cooperating. Maybe I should have stopped the interviewer, but this was a key team member for the role.
OA - 1 arrays Medium, 1 Trie Hard. I had 45 minutes to complete that. I was able to do the medium in about 15-20 minutes but I am not that great with trie ds so I was not able to finish.
Four Round Process
Phone Interview with Human Resources
Coding Round; 1 DSA Leetcode Medium Q
Coding Round: 2 DSA Leetcode Medium Q
Manager Round: System Design Q and behavioural Q
It took about four weeks from application to offer, longer than I initially expected. The initial phone screen was straightforward, covering my resume and some basic algorithms. Then came the technical rounds, which were challenging. One question on minimum window substrings had me diving into a sliding-window approach using pointers and hashmaps. Funny enough, I recognized it mid-round as something I’d practiced on PracHub just days before. After a final system design discussion, I received the offer and happily accepted.
Interview questions [1]
Question 1
Given two strings s and t, return the minimum window substring of s that contains every character of t including duplicates, or an empty string if no such window exists. Walk through the sliding-window approach using two pointers and a character-frequency hashmap, analyze the O(|s| + |t|) time complexity, and discuss how to adapt it when t contains characters not present in s or when s arrives as a stream that cannot be fully buffered.
