Derived from 1 submission for ALL. Format details may vary across different teams or locations.
The candidate faced two onsite technical rounds focused on DSA problem-solving. The first round included medium-level questions, while the second round was more challenging with hard-level questions. The candidate struggled with optimization and edge cases but realized after the interview that their approach was correct. The experience highlights the need for more practice in solving complex problems efficiently.
A DSA problem-solving round focused on technical questions based on the candidate's work experience. Two Leetcode medium-level questions were asked. The first involved implementing a solution using classes, objects, and appropriate data structures (min-heap). The second was a tricky problem solvable using sorting techniques.
Implement a solution using classes and objects with a min-heap-based approach.
Solve a problem using a simple sorting technique.
A final DSA problem-solving round where the candidate was asked two Leetcode hard-level questions. The first question involved optimizing a brute-force approach for finding the max sum of a rectangle no larger than K. The second question was about finding arithmetic slices II in a subsequence, which the candidate attempted using an LIS-like approach but struggled with edge cases.
Max Sum of Rectangle No Larger Than K (Leetcode 363)
Arithmetic Slices II - Subsequence (Leetcode 446)
InterviewDigest