The coding question I received was quite difficult, requiring a deep understanding of algorithms and data structures. Although I struggled initially, the interviewer provided helpful guidance that allowed me to arrive at a working solution. I focused on breaki...
Showing 41-50 of 127 forum items
The interviewer introduced the task as a small parser for product identifiers. The question was Longest Product Code Tokenizer: https://www.chillinterview.com/learn/coding-interview-questions/longest-product-code-tokenizer. I was asked to reason through a few...
**Round 1:** I was given an array of strings and had to group them based on the distance between each character. The distance is the relative distance between characters (e.g., 'b' - 'a' = 1). I was a bit nervous at first and didn't ask about edge cases immedi...
The interviewer asked about my experience working with marketplace or commerce data. The question was Largest Shared Product Price: https://www.chillinterview.com/learn/coding-interview-questions/largest-shared-product-price. I was given product price records...
I had previously interned in the same role in 2025 but didn't match with a team. This time, as a new grad, I reapplied and contacted the HR representative from before. **Round 1 Coding:** The coding question involved finding the top 10 most frequent IPs from a...
The interviewer shared a grid example and asked me to describe what I believed counted as connected land. The question was Largest Fence Around Connected Land: https://www.chillinterview.com/learn/coding-interview-questions/largest-fence-around-connected-land....
Practice leetcode questions to get familar with algorithm questions, but dont' get too obsessed with leetcode google tags, google has a fair large pool of interview techinical questions :)
The coding question was: Given an array of length N containing only two-digit integers (10-99), select as many elements as possible such that all selected numbers share at least one common digit (0~9). Return the maximum number of elements that can be selected...
In late January, I had an onsite interview. **Round 1:** The interviewer barely interacted, only nodding or shaking his head. The question was: given any two subsequences, determine if they belong to the same parent sequence. The follow-up was to extend this t...
I had two back-to-back rounds, each lasting 45 minutes. During the interviews, I was given only a text editor. I had to define variables and test cases myself, but the code didn't need to be fully runnable. In the first round, I solved LeetCode 198. The follow...
