Eatclubs/box8

Role: SDE (Intern + FTE)

College: Not Specified (On-Campus)

Interview Date: Not Specified

Interview Type: On-Campus/Internship/Full-Time

Result: Selected

Difficulty: Medium

Rounds: 2 rounds (Online Assessment + Technical Interview)

Topics Asked: Data Structures, Algorithms (Group Anagrams, Array Transformation, Unordered Maps, Maximum Subarray Sum, Subsequences)

Experience:

The process started with an Online Assessment.

Online Assessment: This round consisted of two medium-level DSA questions. One question was to find the "Maximum subarray sum possible after removing at most K elements from the array". The second question involved finding the "maximum number of 'LCT' subsequences" that can be formed in a given string after at most one insertion.

Technical Interview 1: This round involved two panelists. After introductions, a medium DSA question was presented: "Group Anagrams". The candidate initially proposed an O(n*n) approach and was then asked to optimize it. Another problem involved digit comparison, where the interviewers asked to solve it without using extra space, focusing on a mathematical solution.