Meesho Insight

Offer

SDE-I (Backend)

1-3 Years

Jul 29, 2026

Process Overview

August 2025

Evaluation Stages

Online Assessment (DSA)

Arrays

Doubly Linked List

Graphs

DSU

Binary Search

Digit 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.

GraphsDSUBinary Search

Reference

Subsequence modulo X equals K for a large number string.

Digit DP

Technical Interview (DSA)

⏱ 25 mins

TreesDFSSegment TreeFenwick Tree

The candidate was asked to design a system for hierarchical category order tracking.

The interviewer focused on handling range queries efficiently over a tree structure.

The candidate successfully proposed a solution using a combination of DFS traversal and Fenwick Trees for range sum queries.

Only pseudocode was required, emphasizing architectural logic over syntax.

Questions Asked

Design a system to track order quantities in a hierarchical category tree with date range queries.

TreesSegment 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

Design a carpooling system.

System Design

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.

The candidate was evaluated on their ability to articulate technical motivations.

Questions Asked

What are the differences between processes and threads?

Operating Systems

Compare C, C++, Java, and Python.

Programming Languages

Explain the networking layers.

Networking

Executive Insights

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

Focus on mastering DSA for high-constraint problems.
Practice writing clean pseudocode for complex tree and range query problems.
Prepare for machine coding rounds by balancing design depth with time management.
Review core CS fundamentals including OS, Networking, and language-specific nuances.