EatClub (Box8) SDE(Intern + PPO) Interview Experience | On-Campus | ₹22 LPA CTC
Summary
I went through three interview phases for an SDE role at EatClub (Box8), including an online assessment, a DSA + CS fundamentals interview, and an LLD design interview, but I was not selected.
Full Experience
Sharing my interview experience for anyone preparing for similar SDE roles. I wasn't selected, but the process was a good learning experience.
Phase 1 - Online Assessment (HackerRank)
The OA consisted of 3 coding questions:
- Easy - Counting non-overlapping intervals
Relatively straightforward. I was able to solve it. - Medium - Fibonacci-style problem
Similar to Fibonacci in terms of the recurrence/idea, but a bit more complex. I was able to solve it. - Hard - Graph problem
Involved Topological Sort along with further optimizations. I wasn't able to solve this one completely.
The OA was heavily checked for plagiarism, and out of around 70 candidates, only 9 were selected.
Phase 2 - Round 1: DSA + CS Fundamentals
There were 2 interviewers, both of whom seemed to be relatively junior SDEs.
The interview started with an introduction and then moved directly into DSA.
Problem 1 - Search a 2D Matrix II
LeetCode - Search a 2D Matrix II
I was able to solve the problem and explained three different approaches, including the optimal O(n) approach.
Problem 2 - Furthest Building You Can Reach
LeetCode - Furthest Building You Can Reach
I was able to solve this optimally using a Priority Queue (Min Heap).
Projects + CS Fundamentals
After the DSA questions, they asked about my projects and went fairly deep into the implementation details. Some of the topics discussed were:
- WebSockets
- JWT
- Project architecture and implementation details
- Technical decisions made in my projects
- Operating Systems, which was asked quite thoroughly
I was able to answer most of the questions, and both interviewers seemed satisfied with my answers.
After this round, 3 candidates out of the 9 were selected for the next round.
Phase 3 (Last Round) - Round 2: LLD
This round was initially supposed to be an AI-based coding assistant round, but the interviewer directly moved to an LLD problem.
Parking Lot System Design
At that point, I wasn't very familiar with LLD problems. I started by clarifying the requirements and then designed the system based on them. I created the classes and components that came to mind and explained my thought process. The interviewer constantly kept questioning several of my design decisions. The interview ended around 20 minutes earlier than scheduled.
I wasn't selected after this round.
Interview Questions (3)
Search a 2D Matrix II
Given an m x n integer matrix where each row is sorted in ascending order and each column is sorted in ascending order, write an algorithm to determine if a target value exists in the matrix.
Furthest Building You Can Reach
Given an array heights representing building heights, a limited number of bricks, and a limited number of ladders, determine the furthest building you can reach by moving from left to right, using bricks for smaller climbs and ladders for larger climbs.
Parking Lot System Design
Design a parking lot system that manages parking slots, vehicles, entry/exit processes, and payment handling. The design should consider different vehicle types, slot allocation strategies, real‑time status tracking, and scalability.