← Back to all experiences
Offer
Meesho Interview
SDE-I (Backend)
Process Overview
- August 2025
Interview Rounds Breakdown
Online Assessment (DSA)
ArraysDoubly Linked ListGraphsDSUBinary SearchDigit DP
The assessment required handling large constraints (10^5 to 10^6) necessitating efficient data structures.
The first problem required efficient insertion and deletion, suggesting a Doubly Linked List approach.
The second problem required combining DSU with Binary Search to optimize connectivity checks.
The third problem was a complex Digit DP challenge requiring modular arithmetic properties.
Questions Asked
Array manipulation with room capacity queries (Move left/right, insert/delete).
ArraysDoubly Linked List
Minimum time for K connected components.
Graphs
Technical Interview (DSA)25 mins
TreesDFSSegment TreeFenwick Tree
Machine Coding
System DesignObject-Oriented Programming
The task was to design a carpooling system.
The candidate over-engineered certain classes, leading to time constraints.
The interviewer prioritized the candidate's thought process and design approach over fully executable code.
Clear communication of design trade-offs helped the candidate pass despite the code not running.
Questions Asked
Resume + CS Fundamentals + Behavioural
CS FundamentalsBehavioralResume Deep Dive
The round covered deep dives into previous internship experiences and technical design choices.
The interviewer tested fundamental knowledge of OS and Networking.
Key Takeaways & Advice
Candidate Advice
- Prioritize the design approach and communication over perfect code execution in machine coding rounds.
- Be prepared to defend design choices made in previous projects.
- Time management is crucial during machine coding to ensure the core requirements are met.
Preparation Tips
Final Verdict
The candidate received an offer! 🎉