Interview Trends: Week of July 3, 2026

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "BrowserStack\u2019s hiring process is highly structured, emphasizing hands-on coding, system design, and problem-solving skills. Candidates often face multiple rounds of machine coding, technical interviews, and behavioral assessments, with a strong focus on real-time data processing, browser automation, and scalable system design. The process varies by role but consistently includes rigorous technical evaluations and behavioral rounds.", "by_role": {"SDE-2": "# SDE-2 (Software Development Engineer II)\n\n## Overview\nThe SDE-2 role at BrowserStack typically involves 4-5 rounds, including HR screening, machine coding, hiring manager, founder, and HR rounds. The process is designed to assess both technical depth and cultural fit, with a strong emphasis on system design, problem-solving, and real-world browser automation scenarios.\n\n---\n\n## Round Breakdown\n\n### 1. HR Screening\n- Narrative: Discussion about current and previous projects, work experience, and technology stack.\n- Questions:\n - General discussion about projects and experience.\n\n---\n\n### 2. Machine Coding Round(s)\n- Narrative 1: Implement four web services in the language of choice:\n - startBrowser(): Start a browser and open a given URL.\n - stopBrowser(): Kill a specified opened browser.\n - getLatestURL(): Fetch the last visited URL.\n - deleteAllHistory(): Delete all browser data (history, cookies, cache, saved passwords, bookmarks, etc.).\n - Constraints: Requires understanding of how browsers store user-specific data locally (e.g., Mozilla Firefox uses places.sqlite). JDBC Driver was to be used for extracting/deleting data from .sqlite files. Selenium or third-party automation tools were prohibited.\n\n- Narrative 2: Implement functionality similar to tail -f to fetch the latest logs from a server and send them to all clients.\n - Subtask 1: Implement tail -f programmatically without using the tail command directly. The solution should display only the last changed data when the file is saved and avoid reading from line 0 to handle large files efficiently.\n - Subtask 2: Use WebSockets to send the data to all clients.\n - Questions:\n - Implement tail -f programmatically to fetch the latest logs from a file.\n - Use WebSockets to send the fetched logs to all clients.\n\n---\n\n### 3. Hiring Manager Round\n- Narrative: Discussion about current and framework architecture, core Java, JSP-Servlets, JSF-Managed Beans, Oracle ADF, and database ORM. Questions about career experiences, conflicts with managers, learnings, and Java frameworks.\n- Questions:\n - Explain your current project architecture.\n - Discuss the framework architecture (Core Java -> JSP-Servlets -> JSF-Managed Beans -> Oracle ADF).\n - Explain any feature you are interested in from your current work.\n - How did you handle a conflict with your manager?\n - What did you learn from 1.5 years of professional life?\n - Questions on Java Frameworks.\n - How would you modify the Map-Reduce Framework to run on a multi-clustered environment?\n\n---\n\n### 4. Founder Round\n- Narrative: General discussion about the candidate's background, college experiences, preferences between startups and MNCs, strengths and weaknesses, reasons for not applying for GSoC, reasons for leaving the previous organization, and reasons for choosing BrowserStack.\n- Questions:\n - Tell me about yourself.\n - What one thing did you enjoy the most in college?\n - Startups vs MNCs: which one do you prefer and why?\n - What are your strengths and weaknesses?\n - Why didn't you apply for GSoC?\n - Why do you want to leave your previous organization?\n - Why BrowserStack?\n\n---\n\n### 5. HR Round\n- Narrative: Discussion about the candidate's journey, career goals, learnings from the current company, and preferences for the next job.\n- Questions:\n - Tell me about yourself.\n - What did you like the most about the interview process?\n - Describe your overall journey over the last 5 years (B.Tech + Internships + Full-Time Job).\n - What is the most important thing in your career?\n - What are you looking for from your next job?\n - What learnings did you gain from your current company?\n - What is one thing you love about your current company?\n - What is one thing you don't like about your current company?", "SDE-1 / New Grad": "# SDE-1 / New Grad (Software Development Engineer I)\n\n## Overview\nThe SDE-1 / New Grad role at BrowserStack is designed for entry-level candidates and includes an Online Assessment (OA), followed by 2-3 machine coding rounds and HR interviews. The process emphasizes problem-solving, algorithmic thinking, and hands-on implementation skills, with a focus on real-time data processing and automation.\n\n---\n\n## Round Breakdown\n\n### 1. Online Assessment (OA)\n- Platform: HackerEarth\n- Duration: 2 hours\n- Questions:\n 1. Design a reverse proxy for a given scenario with round-robin load balancing and handling server up/down states.\n 2. Given an array, determine if it is spirally sorted.\n 3. Given a list of words, determine if each word has at most n repetitions of any single character.\n- Scoring: 100 + 50 + 50 points. Candidates with 120+ points were shortlisted based on HR screening.\n\n---\n\n### 2. Machine Coding Round - I\n- Duration: 2 hours\n- Narrative: Implement a log-watching solution similar to tail -f in UNIX.\n - Build a server-side program to monitor a log file and stream updates in real-time.\n - Create a web-based client to display updates without page refresh.\n - Technologies Used: Node.js, Express.js, fs.watch, and sockets.\n- Questions:\n - Implement a log-watching solution (like tail -f) where the log file is hosted on a remote machine. The server should push updates to clients in real-time without retransmitting the entire file. The web client should display the last 10 lines and update in real-time without reloading.\n\n---\n\n### 3. Machine Coding Round - II\n- Duration: 2 hours\n- Narrative: Build a knowledge base of top N movies from IMDb and provide a query interface.\n - Fetch movie data and store it in an in-memory data structure.\n - Implement a command-line query interface to find the top M movies for a given actor.\n- Questions:\n - Build a knowledge base of top N movies from IMDb, including movie names and cast. Provide a command-line query interface to find the top M movies for a given actor.\n\n---\n\n### Additional Technical Rounds (Variations Observed)\n- Technical Round 1:\n - Return an array of the Fibonacci sequence.\n - String to number mapping: Given a mapping (e.g., 1=>a, 2=>b), find the smallest mapping of a number (e.g., input 234 should return 'abc').\n\n- Technical Round 2:\n - HTML Parser: Find a specific HTML response code and its count in a long file.\n - SQL Parser: Extract row counts from a file based on SQL queries.\n - Third Parser: Additional parser-related question (details not recalled).\n\n- Technical Round 3:\n - Sorting Array\n - Comment Removal\n - Spirally Traversing a Matrix\n - Code to Take a Screenshot\n\n---\n\n### HR Round\n- Narrative: Focus on personality assessment, suitability for the role, final year project, and general knowledge.\n- Questions:\n - Tell me about yourself.\n - Why BrowserStack?\n - How do you see yourself after five years from now?\n - What are your strengths and weaknesses?", "Other": "# Other Roles (Non-SDE / Non-QA)\n\n## Overview\nBrowserStack\u2019s hiring process for non-SDE and non-QA roles is varied but often includes multi-hour online assessments with a focus on JSON manipulation, custom regex parsing, and system-level problem-solving. These roles may involve app development, browser automation, or specialized parsing tasks.\n\n---\n\n## Round Breakdown\n\n### 1. Online Assessment (OA) - Role 1\n- Platform: HackerEarth\n- Duration: 3 hours\n- Questions:\n 1. Write a program to prettify JSON and compare two JSON objects to find fields with differing values.\n 2. Custom Regex Pattern Matching: Count the number of times a custom regex pattern occurs in a string, where regex symbols have specific meanings (e.g., . means 2 occurrences of the previous character).\n- Scoring: 20 marks per question.\n\n---\n\n### 2. Online Assessment (OA) - Role 2\n- Platform: HackerEarth\n- Duration: 2 hours\n- Questions: 3 questions of Easy/Medium difficulty.\n- Narrative: Rigorous interview process including 2 machine coding rounds, 2 technical rounds with senior leaders, and an HR interview.\n\n---\n\n### 3. Online Assessment (OA) - Role 3\n- Platform: HackerEarth\n- Duration: 3 hours\n- Difficulty: High\n- Questions:\n 1. SQL Parser: Parse SQL queries for a table, execute WHERE clauses, and return the number of matching rows.\n 2. HTTP Headers: Given HTTP headers, determine if it's a request or response and print specific details like Accept-Language, resource requested, response code, or Content-Type.\n 3. Web Server Logs: Parse web server logs and print HTTP status codes along with their occurrence count, sorted in descending order.\n\n---\n\n### 4. Online Assessment (OA) - Role 4\n- Round 1:\n - Duration: 3 hours\n - Questions:\n 1. Write a program to prettify JSON input.\n 2. C Comment Parser.\n\n- Round 2:\n - Duration: 5 hours\n - Questions:\n 1. Series-Based Programming Challenge: Letters correspond to numbers in a specific pattern.\n 2. Tree/Folder Structure Printer: Print a folder structure (like the tree command) with optional filtering using regex.\n 3. Twitter API-Based Image Fetcher: Initially included but replaced due to proxy issues with creating a BrowserStack REST API library wrapper.\n\n---\n\n### 5. Machine Coding Round\n- Narrative: Implement a stateless web service to interact with Google Chrome and Mozilla Firefox browsers.\n - Endpoints: /start, /stop, /cleanup, /geturl to manage browser sessions.\n - Constraints: Do not use Selenium WebDriver protocol. Ensure the service runs on the server's machine.\n- Questions:\n - Implement a web service with endpoints to manage browser sessions.\n\n---\n\n### 6. Technical Round (Engineering Manager)\n- Questions:\n - Bring all zeros to the start of an array in O(n) time and O(1) space.\n - Design a data structure that supports O(1) time queries.\n - How to count word occurrences in a 1TB file with only 8GB RAM?\n\n---\n\n### 7. Technical Round (Director of Engineering)\n- Questions:\n - HTTP vs HTTPS\n - HTTP error codes\n - What is User-Agent in HTTP headers?\n - How to handle a situation where your manager asks you to use C++ and you prefer Python?\n - How to solve a problem independently if your manager is too busy?\n - What points to consider when deploying a system into production?\n - What kind of logs to send out for future monitoring?\n - Database scaling\n\n---\n\n### 8. HR Interview\n- Narrative: Focus on projects and internship experiences.\n- Questions:\n - Rate your proficiency in your most comfortable programming language.\n - Basic but tricky questions from that language.", "SDE-3 / Senior": "# SDE-3 / Senior (Software Development Engineer III)\n\n## Overview\nThe SDE-3 / Senior role at BrowserStack is designed for experienced engineers and includes on-site assignments focused on browser automation and real-time log monitoring via WebSockets. The process is highly technical, with an emphasis on scalable system design and independent problem-solving.\n\n---\n\n## Round Breakdown\n\n### 1. On-Site Assignment\n- Narrative: Two challenging assignments focused on:\n 1. Implementing a RESTful web service to interact with Google Chrome and Mozilla Firefox browsers, allowing operations like starting, stopping, cleaning up cache/history, and fetching the active tab URL.\n 2. Implementing a log-watching solution using WebSockets, where clients could connect to a server to view the last 10 lines of a log and receive real-time updates as the log file was updated.\n- Questions:\n - Implement a RESTful web service to interact with Google Chrome and Mozilla Firefox: start a browser with a URL, stop it, cleanup cache/history, and get the current active tab URL.\n - Implement a log-watching solution using WebSockets: clients connect to a server to view the last 10 lines of a log and receive real-time updates as the log file is updated.\n\n---\n\n### 2. Rejection\n- Narrative: The candidate received a rejection email two days after the interview.\n\n---\n\n## Key Takeaways\n- The process is highly technical and hands-on, with a focus on real-world scenarios like browser automation and log monitoring.\n- Candidates are expected to demonstrate scalable system design and independent problem-solving skills.", "QA / SDET": "# QA / SDET (Quality Assurance / Software Development Engineer in Test)\n\n## Overview\nThe QA / SDET role at BrowserStack includes a multi-stage technical assessment with a focus on automation, problem-solving, and communication skills. The process typically involves a technical aptitude test, coding challenge, and HR interview, with variations based on the specific requirements of the role.\n\n---\n\n## Round Breakdown\n\n### 1. Technical Aptitude Test\n- Duration: 90 minutes\n- Questions: 90 multiple-choice questions covering:\n - Aptitude\n - Analytical reasoning\n - English language skills\n - Pseudocode-based code analysis\n- Technical MCQs: Topics include MS Office, cloud computing, and networking.\n\n---\n\n### 2. Coding Challenge\n- Duration: 45 minutes\n- Questions: 2 coding questions\n- Focus: Proficiency in data structures and algorithms is crucial.\n\n---\n\n### 3. Communication Assessment\n- Narrative: Evaluates reading comprehension, listening, speaking, and timely responses.\n- Guidance: Candidates are advised to maintain a quiet environment and stable internet connection.\n\n---\n\n### 4. Technical Round\n- Narrative: Discussion about the candidate's current job, framework explanation, technologies used in their project, and automation concepts related to Selenium.\n- Questions:\n - General discussion about projects and experience.\n - Questions about Selenium and automation frameworks.\n\n---\n\n### 5. Assignment Round\n- Duration: 1.5 hours\n- Narrative: Hands-on assignment to automate features of an e-commerce site (e.g., clicking dropdowns, sorting, filtering data, and comparing data). Candidates could use external resources like Google.\n- Outcome: The candidate was not selected as the role required 3 years of experience and API automation expertise, while the candidate had 2 years of experience in manual testing and UI automation.\n\n---\n\n### 6. HR Interview\n- Narrative: Focus on personality assessment, suitability for the role, final year project, and general knowledge.\n- Questions:\n - Tell me about yourself.\n - Highlight achievements and problem-solving skills."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Ola\u2019s hiring process for engineering roles is rigorous and multi-layered, emphasizing problem-solving, system design, and behavioral fit. For mid-senior roles like SDE-2 and SDE-3, the process includes problem-solving rounds (often involving data structures, algorithms, and Java/Spring concepts), system design rounds (focusing on scalability, concurrency, and real-world systems), and managerial rounds (delving into past projects, tech stack, and problem-solving approaches). New grad roles (SDE-1) typically start with an online assessment followed by technical interviews and HR rounds, with a strong emphasis on foundational DSA and OOPs concepts.", "by_role": {"SDE-1 / New Grad": "# SDE-1 / New Grad\n\n## Online Assessment (OA) Format\n- Platform: HackerEarth or similar (not specified for all candidates).\n- Duration: 60 minutes.\n- Question Breakdown:\n - 3 coding questions (difficulty: Easy to Medium).\n - Example questions:\n - Reverse Linked List in pairs.\n - Merge 2 sorted linked lists.\n - Intersection of Multiple Arrays.\n - SQL query (e.g., filtering or aggregation).\n - Array manipulation problem (e.g., minimize array sum after performing arr[i] = arr[i] + arr[i] for k times).\n\n## Technical Interview Round\n- Duration: 90 minutes.\n- Topics Covered:\n - Coding Problems:\n - Lowest Common Ancestor of a Binary Tree.\n - Trapping Rain Water.\n - Theory:\n - OOPs concepts (4 pillars).\n - Java vs C++ comparison.\n - Basic DBMS concepts.\n\n## HR / Behavioral Round\n- Duration: 30 minutes.\n- Focus Areas:\n - Self-introduction and company knowledge.\n - Behavioral questions (e.g., strengths, weaknesses, future goals).\n - Discussion on achievements and lockdown activities (if applicable).\n\n---\n\nSources: LeetCode Discussion 1, LeetCode Discussion 2", "SDE-2": "# SDE-2\n\n## Online Assessment (OA) Format\n- Platform: LeetCode or similar (not explicitly specified).\n- Duration: Not fixed (varies by candidate).\n- Question Breakdown:\n - 3 coding questions (2 Medium, 1 Easy) in some cases.\n - Example questions:\n - TwoSum with constraints.\n - Course Schedule (LeetCode problem).\n - Word Break (LeetCode problem).\n\n## Problem-Solving Rounds\n- Round 1:\n - Duration: Standard (1 hour).\n - Questions:\n - Two easy data structure questions (arrays and strings, LeetCode easy level).\n - Example: Questions similar to LeetCode\u2019s easy problems on arrays and strings.\n\n- Round 2:\n - Duration: 40 minutes (shortened).\n - Questions:\n - Check if an array can be sorted by reversing a subarray.\n - TwoSum with specific constraints (e.g., sum to 6).\n\n## System Design Round\n- Focus: Designing real-world systems with scalability and concurrency in mind.\n- Questions:\n - Design a seat booking system (e.g., BookMyShow).\n - Design Ola\u2019s internal notification system (HLD, LLD, APIs, DB schemas).\n - Design an internal application to track drivers (entities, system flow, non-functional requirements).\n- Key Considerations:\n - Database storage (e.g., storing seat information).\n - API design (e.g., GetSeatsInfo, BookSeats).\n - Handling concurrency and consistency issues.\n\n## Hiring Manager Round\n- Duration: 1.5 hours.\n- Focus Areas:\n - Resume Deep Dive: In-depth discussion on past projects, tech stack, and problem-solving approaches.\n - System Design: Microservices architecture, message queues (RabbitMQ vs. Kafka), caching (Redis), databases (NoSQL vs. relational).\n - Behavioral: Reasons for joining Ola, career goals, and past experiences.\n - Technical Depth: Data pipelines, load balancing, proxy/reverse proxy, Zookeeper, sharding.\n\n---\n\nSources: LeetCode Discussion 1, LeetCode Discussion 2, LeetCode Discussion 3, LeetCode Discussion 4", "SDE-3 / Senior": "# SDE-3 / Senior\n\n## Data Structures & Algorithms Round\n- Focus: Advanced problem-solving and architectural discussions.\n- Questions:\n - Array-based question: Find valley elements in an array.\n - Discussion on microservices and system architecture.\n\n## System Design Round\n- Focus: Designing scalable systems with real-world constraints.\n- Questions:\n - Design the IRCTC system considering traffic and scalability requirements.\n - Frontend optimizations for high-traffic systems.\n\n## Hiring Manager Round\n- Focus: Behavioral fit, past experiences, and problem-solving philosophy.\n- Questions:\n - Discussion on system design bottlenecks and their resolutions.\n - Behavioral fit (e.g., why Ola, career goals, past challenges).\n- Note: Offers may be retracted due to miscommunication (as reported by a candidate).\n\n---\n\nSources: LeetCode Discussion"}}

Migrated to JSONB

{"overview": "Meesho\u2019s hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, coding efficiency, and system design. The process varies by role but consistently includes rounds like Online Assessments (OA), Technical Interviews, Machine Coding, and Hiring Manager discussions. Candidates are expected to demonstrate deep technical expertise, clarity in design decisions, and adaptability to real-world scenarios.", "by_role": {"SDE-2": "# SDE-2 Role-Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves 3-4 rounds, including Problem Solving & Data Structures (PS-DS), Machine Coding, System Design, and a Hiring Manager round. Candidates are expected to demonstrate strong problem-solving skills, efficient implementation, and system design capabilities.\n\n---\n\n## Round Breakdown\n\n### 1. Problem Solving & Data Structures (PS-DS) Round\nDuration: 1 hour\nFocus: Two coding questions, often from platforms like LeetCode or GeeksforGeeks.\nKey Topics: Dynamic Programming, Graphs, Trees, Arrays, and Strings.\n\n#### Exact Questions Asked:\n1. Minimum Steps to Reach Target by a Knight (Coding Ninjas)\n - Source: LeetCode Discussion\n2. Remove All Adjacent Duplicates in String II (LeetCode)\n - Source: LeetCode Discussion\n3. Course Schedule II (LeetCode)\n - Source: LeetCode Discussion\n4. Container With Most Water (LeetCode)\n - Source: LeetCode Discussion\n\n---\n\n### 2. Machine Coding Round\nDuration: 1.5 hours\nFocus: Design and implementation of a scalable system or game.\nKey Topics: Object-Oriented Design, Algorithms, Edge Cases, and Code Optimization.\n\n#### Exact Questions Asked:\n1. Snake & Ladder Game Design\n - Source: LeetCode Discussion\n2. Build Features for a Ride-Sharing Application (e.g., ride allocation, fare calculation)\n - Source: GeeksforGeeks\n\n---\n\n### 3. System Design Round (Sometimes Combined with Hiring Manager)\nDuration: 1 hour\nFocus: High-Level Design (HLD) of scalable systems.\nKey Topics: Distributed Systems, Caching, Database Design, and API Design.\n\n#### Exact Questions Asked:\n1. Design Twitter News Feed (High-Level Design)\n - Source: LeetCode Discussion\n\n---\n\n### 4. Hiring Manager Round\nDuration: 1 hour\nFocus: Project Discussion, Behavioral Questions, and Role-Specific Expectations.\nKey Topics: Past Projects, Challenges Faced, and Cultural Fit.\n\n#### Exact Questions Asked:\n1. Project Discussion\n - Source: LeetCode Discussion\n2. Behavioral Questions (e.g., teamwork, problem-solving approach)\n - Source: LeetCode Discussion\n\n---\n\n## Key Takeaways\n- Strong DSA skills are critical for the PS-DS round.\n- Machine Coding tests your ability to write clean, scalable, and efficient code.\n- System Design is a must for SDE-2, focusing on scalability and real-world constraints.\n- Behavioral and project discussions are equally important for the final round.", "SDE-1 / New Grad": "# SDE-1 / New Grad Role-Structured Interview Briefing\n\n## Overview\nThe SDE-1 / New Grad hiring process at Meesho is highly competitive and consists of 4-5 rounds, including an Online Assessment (OA), Technical Interviews, System Design, and HR rounds. Candidates are expected to demonstrate strong fundamentals, problem-solving skills, and adaptability.\n\n---\n\n## Round Breakdown\n\n### 1. Online Assessment (OA)\nDuration: 75-90 minutes\nFormat: Coding Questions + Multiple-Choice Questions (MCQs)\nShortlisting Criteria: Solving 2+ coding questions or meeting CGPA thresholds (often 7.0+ for circuit branches).\n\n#### Exact Questions Asked:\n1. Coding Questions:\n - Weighted Job Scheduling (Dynamic Programming + Binary Search)\n - Source: GeeksforGeeks\n - Common Elements in Two Arrays (Arrays)\n - Source: GeeksforGeeks\n - Make Two Strings Anagram (Strings)\n - Source: GeeksforGeeks\n - Chocolate Distribution Problem (Arrays)\n - Source: GeeksforGeeks\n - LIS Revisited (Dynamic Programming)\n - Source: GeeksforGeeks\n - Graph Colouring (Graphs)\n - Source: GeeksforGeeks\n - String Manipulation (A<->G, C<->T substitutions) (Strings)\n - Source: GeeksforGeeks\n - Path Existence in a 2D Matrix (BFS) (Graphs)\n - Source: GeeksforGeeks\n\n2. MCQ Topics:\n - Operating Systems, Computer Networks, DBMS, C/C++/Java Output Questions.\n\n---\n\n### 2. Technical Interview 1\nDuration: 1-1.5 hours\nFocus: Data Structures, Algorithms, and Problem-Solving.\n\n#### Exact Questions Asked:\n1. Activity Selection Problem (Greedy Algorithms)\n - Source: GeeksforGeeks\n2. Watering Plants (Greedy Approach)\n - Source: GeeksforGeeks\n3. Number of Islands (Extension) (Graphs)\n - Source: GeeksforGeeks\n4. Count Arrays with Rules (Dynamic Programming)\n - Source: GeeksforGeeks\n\n---\n\n### 3. Technical Interview 2\nDuration: 1 hour\nFocus: System Design, OOP, DBMS, and Computer Science Fundamentals.\n\n#### Exact Questions Asked:\n1. SQL Queries:\n - Write queries involving ROW_NUMBER(), RANK(), DENSE_RANK().\n - Grouping and WHERE clause applications.\n - Complex queries with subqueries and WITH clauses.\n - Source: GeeksforGeeks\n\n2. Computer Science Fundamentals:\n - Operating Systems: Semaphores vs. Mutex, Paging, Virtual vs. Physical Memory, Threading in Java.\n - Networking: ARP, DNS, OSI Model.\n - DBMS: SQL vs. NoSQL, Normalization, ACID Properties.\n - C++: Inner implementation of vectors (complexities for insert, delete, read).\n - Source: GeeksforGeeks\n\n---\n\n### 4. System Design Round (For Some Candidates)\nDuration: 1 hour\nFocus: Low-Level and High-Level Design.\n\n#### Exact Questions Asked:\n1. Design a Cab Booking System (OOP + System Design)\n - Implement 10+ functions (e.g., ride allocation, fare calculation).\n - Source: GeeksforGeeks\n2. Design a Basic OTP System (Low-Level Design)\n - Source: GeeksforGeeks\n\n---\n\n### 5. HR/Technical Round\nDuration: 1 hour\nFocus: Project Deep Dives, Optimization, Real-World Scenarios, and Behavioral Questions.\n\n#### Exact Questions Asked:\n1. Project Discussions:\n - Tech stack choices, alternatives, and use cases.\n - GitHub code review and optimization.\n - Source: GeeksforGeeks\n\n2. Real-World Scenarios:\n - Handling a sale with limited product availability (e.g., ensuring exactly x purchases).\n - Source: GeeksforGeeks\n\n3. Situational Questions:\n - Handling a project where the approach is deemed wrong after 3-4 days.\n - Source: GeeksforGeeks\n\n---\n\n## Key Takeaways\n- Strong DSA skills are essential for the OA and Technical Rounds.\n- System Design is increasingly important, even for New Grad roles.\n- Projects and HR rounds focus on your ability to explain and optimize solutions.\n- MCQs test your fundamentals in OS, Networks, and DBMS.", "Intern": "# Intern Role-Structured Interview Briefing\n\n## Overview\nThe Intern hiring process at Meesho is highly selective, with 4-5 rounds including Online Assessments, Coding Tests, Low-Level Design, and Hiring Manager discussions. Candidates are expected to demonstrate strong problem-solving skills, basic system design knowledge, and clarity in communication.\n\n---\n\n## Round Breakdown\n\n### 1. Online Assessment (OA)\nDuration: 30-105 minutes\nFormat: Coding Questions + Multiple-Choice Questions (MCQs)\n\n#### Exact Questions Asked:\n1. NextLevel Screening Test (for some candidates):\n - MCQ Topics: Operating Systems, Data Structures and Algorithms (DSA), Networking, Error Handling.\n - Duration: 30 minutes\n - Source: GeeksforGeeks\n\n2. Meesho DICE Exam:\n - MCQ Topics: Operating Systems, DBMS, Computer Networks, DSA.\n - Duration: 30 minutes (60 seconds per question)\n - Source: GeeksforGeeks\n\n3. Coding Questions (for some candidates):\n - Binary Search, Dynamic Programming, Segment Tree (Medium to Hard)\n - Duration: 105 minutes\n - Source: GeeksforGeeks\n\n---\n\n### 2. Coding Test (HackerRank)\nDuration: 90-105 minutes\nFocus: Problem-Solving and Algorithm Implementation.\n\n#### Exact Questions Asked:\n1. Problems:\n - Binary Search, Dynamic Programming, Segment Tree (Medium to Hard)\n - Source: GeeksforGeeks\n\n---\n\n### 3. Low-Level Design Round\nDuration: 90 minutes\nFocus: Designing scalable and efficient systems using OOP principles.\n\n#### Exact Questions Asked:\n1. Design an Inventory Management System\n - Implement using SOLID principles and design patterns.\n - Source: GeeksforGeeks\n\n---\n\n### 4. Hiring Manager Round\nDuration: 45 minutes\nFocus: Project Discussions, Situational Questions, and Behavioral Assessment.\n\n#### Exact Questions Asked:\n1. Project Discussions:\n - Deep dive into projects, tech stack choices, and alternatives.\n - Source: GeeksforGeeks\n\n2. Situational Questions:\n - Designing a chat application (database schema, APIs, application flow).\n - Source: GeeksforGeeks\n\n---\n\n### 5. Final Presentation Round (for Meesho DICE Exam)\nFocus: Presenting solutions to a panel of judges.\nOutcome: Prizes and potential internship offers.\n\n---\n\n## Key Takeaways\n- Strong fundamentals in DSA and CS subjects are critical.\n- Low-Level Design tests your ability to write clean and scalable code.\n- Project discussions and situational questions assess your problem-solving approach.\n- Communication skills are as important as technical skills.", "Other": "# Other Roles (Non-SDE) Role-Structured Interview Briefing\n\n## Overview\nMeesho\u2019s hiring process for non-SDE roles (e.g., non-technical or hybrid roles) is less standardized but often includes coding assessments, system design discussions, and project validation rounds. The focus is on role-specific skills and cultural fit.\n\n---\n\n## Round Breakdown\n\n### 1. Coding Assessment\nDuration: Varies\nFocus: Problem-Solving and Algorithm Implementation.\n\n#### Exact Questions Asked:\n1. Dynamic Programming, Graphs, Disjoint-Set Union (DSU)\n - Source: GeeksforGeeks\n\n---\n\n### 2. System Design Round\nDuration: 1.5 hours\nFocus: Low-Level Design of Scalable Systems.\n\n#### Exact Questions Asked:\n1. Design a Low-Level System Similar to Uber\n - Source: GeeksforGeeks\n\n---\n\n### 3. Project Discussion and HR Round\nDuration: Varies\nFocus: Validation of Project Originality and Behavioral Assessment.\n\n#### Exact Questions Asked:\n1. Project Discussions:\n - React hooks, system calls, Express handling, database schema design.\n - Source: GeeksforGeeks\n\n2. Behavioral Questions:\n - Cultural fit and role-specific expectations.\n - Source: GeeksforGeeks\n\n---\n\n## Key Takeaways\n- Role-specific skills are critical for non-SDE roles.\n- Project validation is a key part of the process.\n- Behavioral and cultural fit assessments are equally important."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho\u2019s hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, system design, and low-level design across all roles. The process often includes an Online Assessment (OA) followed by multiple technical rounds, including machine coding, system design, and hiring manager discussions. Rejections frequently stem from challenges in implementing edge cases, system design trade-offs, or project originality verification, highlighting the need for deep conceptual clarity and hands-on coding proficiency.", "by_role": {"SDE-2": "# Meesho SDE-2 Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves three core rounds: Problem Solving and Data Structures (PS-DS), Machine Coding, and a Hiring Manager round. The focus is on intermediate to advanced DSA problems, scalable system design, and behavioral/project discussions. Candidates are expected to demonstrate clean code, modular design, and trade-off analysis in their solutions.\n\n---\n\n## Round Breakdowns and Questions\n\n### 1. Problem Solving and Data Structures (PS-DS)\nDuration: 1 hour\nFormat: 2 coding questions (LeetCode medium-hard level)\nEvaluation Criteria: Correctness, time/space complexity, and code readability.\n\nCommon Question Topics:\n- Graph traversals (e.g., Knight\u2019s move problems)\n- String manipulation (e.g., removing adjacent duplicates)\n- Dynamic Programming (e.g., course scheduling, weighted job scheduling)\n- Tree/Graph problems (e.g., container with most water)\n\nExample Questions:\n- Minimum Steps to Reach Target by a Knight\n- Remove All Adjacent Duplicates in String II\n- Course Schedule II\n- Container With Most Water\n\n---\n\n### 2. Machine Coding\nDuration: 1.5 hours\nFormat: Design and implement a scalable system (e.g., Snake & Ladder, ride-sharing app features).\nEvaluation Criteria: Modularity, OOP principles, edge-case handling, and testing.\n\nCommon Problem Statements:\n- Design a Snake & Ladder game (with custom rules, dice logic, and player tracking).\n- Build core features for a ride-sharing application (e.g., ride booking, driver allocation, fare calculation).\n\nExample Problem:\n- Snake & Ladder Game Design\n\nExpected Deliverables:\n- Functional code with comprehensive test cases.\n- Explanation of design choices (e.g., data structures, algorithms, and trade-offs).\n\n---\n\n### 3. System Design + Hiring Manager\nDuration: 1 hour (combined)\nFormat:\n- System Design: High-level design (HLD) for scalable systems (e.g., Twitter news feed).\n- Hiring Manager: Project deep dives, behavioral questions, and role-specific discussions.\n\nExample Questions:\n- System Design: Design a Twitter news feed (timeline generation, fan-out strategies).\n- Coding: Solve a LeetCode medium question (e.g., Binary Tree problems).\n- Behavioral: Discuss past projects, challenges, and team collaborations.\n\n---\n\n## Key Takeaways\n- Strengths: Strong focus on DSA, modular design, and scalability.\n- Pitfalls: Rejections often occur due to incomplete edge-case handling or unclear trade-offs in system design.\n- Preparation Tips:\n - Practice LeetCode medium-hard problems (Graphs, DP, Trees).\n - Implement systems from scratch (e.g., chat apps, OTP systems) with SOLID principles.\n - Prepare project narratives with quantifiable outcomes.", "SDE-1 / New Grad": "# Meesho SDE-1 / New Grad Interview Briefing\n\n## Overview\nThe SDE-1 hiring process for new graduates at Meesho is highly competitive and multi-stage, starting with an Online Assessment (OA) and progressing through technical interviews, system design, and HR rounds. The process emphasizes fundamental DSA, system design basics, and project depth, with a focus on collaboration and problem-solving under constraints.\n\n---\n\n## Round Breakdowns and Questions\n\n### 1. Online Assessment (OA)\nDuration: 75\u201390 minutes\nFormat: Mix of coding questions and MCQs (varies by campus).\nEvaluation Criteria: Correctness, time complexity, and conceptual clarity.\n\nCommon OA Formats:\n1. Coding + MCQs (Computer Science Core):\n - 3 coding questions (easy to medium-hard): Arrays, strings, DP.\n - 20\u201325 MCQs (Operating Systems, Computer Networks, DBMS, C++/Java).\n - Example Questions:\n - Find common elements in two arrays.\n - Make two strings anagrams with minimum modifications.\n - Weighted Job Scheduling (DP + binary search).\n - Source: GeeksforGeeks\n\n2. Coding Only (Medium-Hard):\n - 3 coding questions (focus on greedy, DP, graphs).\n - Example Questions:\n - Activity Selection Problem (Greedy).\n - Water the Plants (Greedy).\n - Source: GeeksforGeeks\n\n3. SQL + MCQs:\n - 25 MCQs (CS fundamentals) + 3 SQL queries (JOINs, subqueries, window functions).\n - Example Questions:\n - Use ROW_NUMBER(), RANK(), DENSE_RANK() in SQL.\n - Complex subqueries with WITH clauses.\n - Source: GeeksforGeeks\n\n4. HackerRank OA:\n - 3 DSA problems (XOR optimization, substring counting, 0-1 Knapsack with constraints).\n - Example Questions:\n - Optimize code for bitwise XOR operations in a loop.\n - Count substrings based on character properties.\n - Solve 0-1 Knapsack with n <= 36 (mid-in-middle optimization).\n - Source: LeetCode\n\n\n---\n\n### 2. Technical Interview 1 (Coding Focus)\nDuration: 1\u20131.5 hours\nFormat: 2\u20133 coding questions (HackerRank/CodePair).\nEvaluation Criteria: Algorithm efficiency, code readability, and problem-solving approach.\n\nCommon Topics:\n- Greedy algorithms (e.g., activity selection).\n- Graph traversals (e.g., BFS for pathfinding).\n- Tree/Graph problems (e.g., Number of Islands extensions).\n- Array/string manipulation.\n\nExample Questions:\n- Activity Selection Problem\n- Water the Plants\n- Extension of Number of Islands\n- Count arrays with divisibility rules (Rule 1: divisible by index, Rule 2: index divisible by element).\n\nAdditional Topics:\n- Operating Systems (semaphores vs. mutex, paging).\n- DBMS (SQL vs. NoSQL, normalization, ACID).\n- C++/Java internals (e.g., vector implementations).\n\n---\n\n### 3. Technical Interview 2 (CS Fundamentals + Projects)\nDuration: 1 hour\nFormat: Discussion-based or coding questions.\nEvaluation Criteria: Depth of CS knowledge, project understanding, and clarity of thought.\n\nCommon Topics:\n- Operating Systems: ARP, DNS, OSI model.\n- Databases: SQL queries, normalization, transactions.\n- Networking: TCP/IP, HTTP/HTTPS.\n- OOP/Java: Singleton class, string builders, threading.\n\nExample Questions:\n- Explain semaphores vs. mutex and their use cases.\n- Describe paging technique and virtual memory.\n- Write Java code for a thread-safe singleton class.\n- Projects: Deep dive into tech stack choices, alternatives, and trade-offs.\n\n---\n\n### 4. System Design (For Some Candidates)\nDuration: 1 hour\nFormat: Design a scalable system (e.g., cab booking, OTP system).\nEvaluation Criteria: Modularity, scalability, and trade-off analysis.\n\nExample Problem Statements:\n- Design a cab booking system (OOP implementation of 10+ functions).\n- Design a basic OTP system (APIs, database schema, failure handling).\n\n---\n\n### 5. HR/Technical Round\nDuration: 1 hour\nFormat: Project deep dives, real-world scenarios, and situational questions.\nEvaluation Criteria: Communication, problem-solving mindset, and cultural fit.\n\nExample Questions:\n- Optimize solutions from the OA using pseudo-code.\n- Handle a sale scenario with limited inventory and high demand (ensure no duplicates).\n- Explain how you would restart a project from scratch after 3\u20134 days.\n- Projects: Discuss tech stack choices, alternatives, and use cases.\n\n---\n\n### 6. HR Round (Final)\nDuration: 30\u201345 minutes\nFormat: Formal HR discussion (no technical questions).\nEvaluation Criteria: Communication skills and cultural alignment.\n\n---\n\n## Key Takeaways\n- Strengths: Strong focus on fundamental DSA, system design basics, and CS fundamentals.\n- Pitfalls: Rejections often occur due to incomplete SQL queries, unoptimized code, or unclear project explanations.\n- Preparation Tips:\n - Master LeetCode easy-medium problems (focus on arrays, strings, graphs).\n - Practice SQL queries (JOINs, subqueries, window functions).\n - Prepare project narratives with quantifiable outcomes.\n - Review OS, networking, and DBMS concepts.\n - Simulate machine coding rounds (e.g., design a URL shortener).", "Intern": "# Meesho Intern Interview Briefing\n\n## Overview\nThe intern hiring process at Meesho is highly selective, with a multi-stage evaluation focusing on DSA, low-level design, and problem-solving under time constraints. The process includes an Online Assessment (OA), followed by technical rounds (coding + design), and a hiring manager round. Candidates are expected to demonstrate creativity, modularity, and clarity in their solutions.\n\n---\n\n## Round Breakdowns and Questions\n\n### 1. Online Assessment (OA)\nPlatform: NextLevel Screening Test / HackerRank / Meesho DICE Exam\nDuration: 30\u2013105 minutes\nFormat: Mix of MCQs and coding problems.\n\nCommon OA Formats:\n1. NextLevel Screening Test:\n - 30 minutes, 20 MCQs (OS, DSA, Networking, Error Handling).\n - Verbal questions evaluated by AI.\n - Source: GeeksforGeeks\n\n2. HackerRank Coding Test:\n - 105 minutes, 3 coding problems (medium to hard).\n - Topics: Binary Search, Dynamic Programming (DP), Segment Tree.\n - Source: GeeksforGeeks\n\n3. Meesho DICE Exam:\n - 30 minutes, 30 MCQs (OS, DBMS, Computer Networks, DSA).\n - Source: GeeksforGeeks\n\n---\n\n### 2. Coding Round\nDuration: 90\u2013105 minutes\nFormat: 2\u20133 coding questions (medium to hard).\nEvaluation Criteria: Correctness, time complexity, and code efficiency.\n\nExample Questions:\n- Binary Search: Find a target in a rotated sorted array.\n- DP: Solve a variant of the LIS problem.\n- Segment Tree: Range queries or updates (e.g., sum queries).\n- Graphs: Detect cycles in a directed graph (DSU).\n\n---\n\n### 3. Low-Level Design (LLD)\nDuration: 90 minutes\nFormat: Design a scalable system using OOP principles.\nEvaluation Criteria: Modularity, SOLID principles, and edge-case handling.\n\nExample Problem Statement:\n- Design an Inventory Management System:\n - Implement core functionalities (e.g., add/remove items, update stock).\n - Use design patterns (e.g., Singleton, Factory).\n - Explain trade-offs (e.g., thread safety, database choices).\n\n---\n\n### 4. Hiring Manager Round\nDuration: 45 minutes\nFormat: Discussion-based (projects, situational questions, and system design).\nEvaluation Criteria: Clarity of thought, problem-solving, and cultural fit.\n\nExample Questions:\n- Design a chat application (database schema, APIs, and application flow).\n- Discuss situational scenarios (e.g., handling project pivots).\n- Deep dive into projects (role, challenges, outcomes).\n\n---\n\n### 5. Final Presentation Round (For Some Candidates)\nFormat: Shortlisted candidates present solutions to a problem statement.\nEvaluation Criteria: Creativity, clarity, and execution.\n\n---\n\n## Key Takeaways\n- Strengths: Strong focus on DSA, LLD, and problem-solving under constraints.\n- Pitfalls: Rejections often occur due to unclear design choices or incomplete edge-case handling.\n- Preparation Tips:\n - Practice LeetCode medium problems (focus on graphs, DP, and trees).\n - Implement LLD systems (e.g., parking lot, ATM machine) using SOLID principles.\n - Review OS, DBMS, and networking basics.\n - Prepare project narratives with quantifiable outcomes.", "Other": "# Meesho Other Roles Interview Briefing\n\n## Overview\nThe interview process for non-SDE roles (e.g., off-campus, campus roles with mixed expectations) at Meesho is less standardized but often includes coding assessments, system design, and HR rounds. The focus varies based on the role, but DSA, system design, and project originality are frequently evaluated. Rejections in this category often stem from unclear project explanations or incomplete technical implementations.\n\n---\n\n## Round Breakdowns and Questions\n\n### 1. Coding Assessment\nDuration: 1\u20132 hours\nFormat: 2\u20133 coding questions (medium to hard).\nEvaluation Criteria: Correctness, time complexity, and code readability.\n\nCommon Topics:\n- Dynamic Programming (DP).\n- Graphs and Disjoint-Set Union (DSU).\n- Trees and arrays.\n\nExample Questions:\n- Solve a DP problem (e.g., coin change, knapsack).\n- Implement graph traversals (e.g., cycle detection, shortest path).\n- Source: GeeksforGeeks\n\n---\n\n### 2. System Design / Low-Level Design\nDuration: 1.5 hours\nFormat: Design a scalable system (e.g., Uber-like cab booking system).\nEvaluation Criteria: Modularity, scalability, and trade-off analysis.\n\nExample Problem Statement:\n- Design a ride-sharing application (e.g., Uber/Lyft):\n - Core functionalities: Ride booking, driver allocation, fare calculation.\n - Database schema, APIs, and failure handling.\n- Source: GeeksforGeeks\n\n---\n\n### 3. Project Discussion and HR\nDuration: 1 hour\nFormat: Deep dive into projects, behavioral questions, and role-specific discussions.\nEvaluation Criteria: Originality of work, clarity of thought, and cultural fit.\n\nCommon Questions:\n- Explain React hooks or Express.js in your project.\n- Describe your database schema design.\n- Verify the originality of your project (tools like plagiarism checkers may be used).\n- Source: GeeksforGeeks\n\n---\n\n### 4. Additional Rounds (For Off-Campus Candidates)\nFormat: Multiple rounds (HR, technical, case studies, on-site interviews).\nEvaluation Criteria: Role-specific skills, problem-solving, and cultural alignment.\n\nExample Rounds:\n1. HR Round: Initial screening (resume review, culture fit).\n2. Technical Interviews: DSA, system design, or role-specific questions.\n3. Case Studies/Projects: Real-world problem-solving.\n4. On-Site Interviews: Final technical and behavioral rounds.\n5. Culture Fit and Values Assessment: Alignment with Meesho\u2019s values.\n\n---\n\n## Key Takeaways\n- Strengths: Focus on DSA, system design, and project depth.\n- Pitfalls: Rejections often occur due to unclear project explanations or incomplete technical implementations.\n- Preparation Tips:\n - Practice LeetCode medium-hard problems (focus on graphs, DP, and trees).\n - Implement system design solutions (e.g., URL shortener, chat app).\n - Prepare project narratives with quantifiable outcomes and originality proofs.\n - Review CS fundamentals (OS, networking, DBMS)."}}

Migrated to JSONB

{"overview": "Meesho\u2019s hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, system design, and practical implementation. For mid-senior roles like SDE-2 and SDE-3, the process includes multi-hour machine coding rounds and system design discussions, while campus hiring for SDE-1 focuses on a mix of DSA, MCQs, and real-world problem-solving. Rejections often stem from gaps in preparation, particularly in system design or low-level implementation, as seen in machine coding rounds.", "by_role": {"SDE-2": "# SDE-2 \u2013 Role-Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho emphasizes depth in problem-solving, system design, and hands-on coding. Candidates typically face three rounds: a Problem Solving/Data Structures (PS-DS) round, a Machine Coding round, and a Hiring Manager round. The process tests both algorithmic rigor and engineering practicality, with a focus on scalable design and clean implementation.\n\n---\n\n## Round Breakdown & Questions\n\n### Round 1: Problem Solving / Data Structures (PS-DS)\nDuration: 1 hour \nFormat: 2 coding questions (LeetCode Medium/Hard level)\nFocus: Dynamic Programming, Graphs, Trees, and String Manipulation\n\n#### Exact Questions Asked:\n1. Minimum Steps to Reach Target by a Knight (Knight move problem)\n - Source: Coding Ninjas\n2. Remove All Adjacent Duplicates in String II (String manipulation with stack-like logic)\n - Source: LeetCode 1209\n\n---\n\n### Round 2: Machine Coding\nDuration: 1.5 hours \nFormat: Design and implement a Snake & Ladder game from scratch\nFocus: OOP principles, clean code, modularity, and handling edge cases\n\n#### Exact Problem Statement:\n- Design a Snake & Ladder game with the following requirements:\n - Support for multiple players.\n - Customizable board size and snake/ladder configurations.\n - Efficient dice rolling and move validation.\n - Test cases for edge scenarios (e.g., cycles, invalid moves).\n\n---\n\n### Round 3: Hiring Manager Round\nDuration: 1 hour \nFormat: Behavioral + Project Discussion\nFocus: Leadership, ownership, and depth of past project contributions\n\n#### Key Discussion Areas:\n1. Project Deep Dive:\n - Tech stack choices, trade-offs, and scalability decisions.\n - Challenges faced and how they were resolved.\n2. Behavioral Questions:\n - Situational problem-solving (e.g., handling ambiguous requirements).\n - Collaboration and conflict resolution in team settings.\n\n---\n\n## Key Takeaways\n- Success in PS-DS: Strong grasp of Dynamic Programming, Graphs, and String Algorithms is critical.\n- Machine Coding: Focus on modularity, clean code, and edge-case handling (e.g., invalid inputs, concurrency in multiplayer games).\n- Hiring Manager Round: Be prepared to defend design choices and discuss past projects in depth.", "SDE-1 / New Grad": "# SDE-1 / New Grad \u2013 Role-Structured Interview Briefing\n\n## Overview\nMeesho\u2019s campus hiring for SDE-1 roles is highly competitive, with a multi-stage process including an Online Assessment (OA), Technical Interviews, and HR Rounds. The OA typically features DSA problems, MCQs, and SQL queries, while technical rounds emphasize greedy algorithms, system design fundamentals, and CS core concepts. Only candidates with strong problem-solving and conceptual clarity progress to later stages.\n\n---\n\n## Round Breakdown & Questions\n\n### Round 1: Online Assessment (OA)\nDuration: 75\u201390 minutes \nFormat: Coding + MCQs + SQL Queries\nEligibility: CGPA > 7, Circuit Branches (for campus hires)\n\n#### Exact Questions Asked:\n1. Coding (3 problems):\n - Easy: Array manipulation (e.g., finding common elements in two arrays).\n - Medium: Weighted Job Scheduling (Dynamic Programming + Binary Search).\n - Hard: Graph-based problem (e.g., 0-1 Knapsack or Stock Price Optimization).\n - Example: GeeksforGeeks Weighted Job Scheduling\n\n2. MCQs (20\u201330 questions):\n - Topics: Operating Systems, Computer Networks, C/C++ (output questions), Java.\n - Difficulty: Easy to Medium.\n\n3. SQL Queries (2\u20133 problems):\n - Topics: ROW_NUMBER(), RANK(), DENSE_RANK(), subqueries, WITH clauses.\n - Example: Apply WHERE conditions and group-by operations.\n\n---\n\n### Round 2: Technical Interview 1\nDuration: 1\u20131.5 hours \nFormat: Coding + CS Core Concepts\nFocus: Greedy Algorithms, Dynamic Programming, and CS Fundamentals\n\n#### Exact Questions Asked:\n1. Greedy Algorithm:\n - Activity Selection Problem (https://www.geeksforgeeks.org/activity-selection-problem/)\n2. Watering Plants (Greedy Approach):\n - Optimize plant watering with time constraints.\n - Source: GeeksforGeeks\n3. CS Core Concepts:\n - Operating Systems: Semaphores vs. Mutex, Paging, Virtual vs. Physical Memory.\n - Databases: SQL vs. NoSQL, Normalization, ACID Properties.\n - Networking: ARP, DNS, OSI Model.\n - C++/Java: Inner workings of vector (complexities for insert/delete/read).\n\n---\n\n### Round 3: Technical Interview 2\nDuration: 1 hour \nFormat: Project Discussion + System Design Basics\nFocus: OOP, System Design Fundamentals, and Real-World Scenarios\n\n#### Exact Questions Asked:\n1. OOP & Java:\n - Singleton Class, StringBuilder vs. StringBuffer.\n - Projects: Tech stack choices, alternatives, and trade-offs.\n2. System Design:\n - Design a cab booking system (OOP implementation with 10+ functions).\n - Focus: Modularity, scalability, and test cases.\n3. Real-World Scenarios:\n - Handle a sale scenario with limited inventory (e.g., ensuring exactly x purchases out of y requests).\n\n---\n\n### Round 4: HR/Technical Round\nDuration: 1 hour \nFormat: Behavioral + Project Deep Dive\nFocus: Leadership, Ownership, and Problem-Solving\n\n#### Key Discussion Areas:\n1. Project Deep Dive:\n - Explain tech stack choices and alternatives.\n - Optimize solutions from the OA (e.g., Knapsack, Stock Price).\n2. Behavioral Questions:\n - Situational: Handling a project restart after 3\u20134 days.\n - Conflict resolution and collaboration.\n\n---\n\n## Key Takeaways\n- OA Success: Focus on DSA (Greedy, DP, Graphs) and CS Core Concepts.\n- Technical Rounds: Prioritize clean OOP design and modular code.\n- HR Round: Be ready to defend design choices and discuss past projects in depth.", "Intern": "# Intern \u2013 Role-Structured Interview Briefing\n\n## Overview\nMeesho\u2019s intern hiring process is highly selective, with four rigorous rounds including online tests, coding challenges, low-level design, and hiring manager discussions. The process tests DSA skills, system design fundamentals, and problem-solving under constraints. Candidates often face medium-to-hard level problems in areas like Binary Search, Dynamic Programming, and Segment Trees.\n\n---\n\n## Round Breakdown & Questions\n\n### Round 1: Online Test\nPlatform: NextLevel Screening Test (Mobile App) or HackerRank \nDuration: 30\u2013105 minutes \nFormat: MCQs + Coding Problems\n\n#### Exact Questions Asked:\n1. MCQs (NextLevel Test):\n - Topics: Operating Systems, DSA, Networking, Error Handling.\n - Duration: 30 minutes, 20 questions.\n\n2. Coding (HackerRank):\n - Problems:\n - Binary Search (e.g., finding peaks in an array).\n - Dynamic Programming (e.g., LIS revisited).\n - Segment Tree (e.g., range queries).\n - Duration: 105 minutes, 3 problems.\n\n---\n\n### Round 2: Low-Level Design\nDuration: 90 minutes \nFormat: Implement a system from scratch\nFocus: SOLID principles, Design Patterns, and Modularity\n\n#### Exact Problem Statement:\n- Design an Inventory Management System with:\n - Support for adding/removing items.\n - Stock tracking and alerts.\n - Bonus: Multi-threaded support for concurrent operations.\n\n---\n\n### Round 3: Hiring Manager Round\nDuration: 45 minutes \nFormat: Behavioral + System Design Discussion\nFocus: Ownership, Problem-Solving, and Project Depth\n\n#### Key Discussion Areas:\n1. Project Deep Dive:\n - Explain design choices and trade-offs.\n2. Behavioral Questions:\n - Situational: Handling ambiguous requirements.\n - Collaboration and conflict resolution.\n\n---\n\n## Key Takeaways\n- MCQs: Focus on CS Core Concepts (OS, Networking, DSA).\n- Coding: Prioritize Binary Search, DP, and Segment Trees.\n- LLD: Practice SOLID principles and modular design.\n- HR Round: Be ready to discuss past projects and problem-solving approaches.", "SDE-3 / Senior": "# SDE-3 / Senior \u2013 Role-Structured Interview Briefing\n\n## Overview\nThe SDE-3 role at Meesho targets senior engineers with strong system design and leadership skills. The process includes multi-hour machine coding rounds, system design discussions, and behavioral assessments. Candidates are expected to demonstrate architectural thinking, clean code, and ownership in their solutions.\n\n---\n\n## Round Breakdown & Questions\n\n### Round 1: Machine Coding\nDuration: 2 hours \nFormat: Implement a N-Elevator System\nFocus: Threading, OOP Principles, and Scalability\n\n#### Exact Problem Statement:\n- Design an N-Elevator System with:\n - Support for multiple elevators and floors.\n - Thread-safe operations (e.g., handling concurrent requests).\n - Efficient algorithms for floor selection and dispatching.\n - Test cases for edge scenarios (e.g., high traffic, deadlocks).\n\n---\n\n### Round 2: System Design\nDuration: 1 hour \nFormat: Design a Trading Platform\nFocus: High-Level Design (HLD), Trade-offs, and Scalability\n\n#### Exact Problem Statement:\n- Design a System Similar to a Trading Platform with:\n - Support for order matching (buy/sell).\n - Real-time updates and notifications.\n - Database schema design for transactions.\n - APIs for user interactions.\n\n---\n\n### Round 3: Technical Round (Unspecified)\nDuration: 1 hour \nFormat: System Design + Personal Projects Discussion\nFocus: Architectural Decisions and Ownership\n\n#### Key Discussion Areas:\n1. System Design:\n - Trade-offs in design choices.\n - Scalability and fault tolerance.\n2. Personal Projects:\n - Explain architectural decisions and lessons learned.\n\n---\n\n### Round 4: Non-Technical (HR + Hiring Manager)\nDuration: 1 hour \nFormat: Behavioral + Cultural Fit\nFocus: Leadership, Values, and Scenario-Based Questions\n\n#### Key Discussion Areas:\n1. Behavioral Questions:\n - Handling ambiguous requirements.\n - Conflict resolution and team collaboration.\n2. Scenario-Based Questions:\n - Designing systems under constraints.\n - Prioritizing features in a product roadmap.\n\n---\n\n## Key Takeaways\n- Machine Coding: Focus on thread safety, OOP principles, and scalability.\n- System Design: Prioritize HLD, trade-offs, and scalability (e.g., trading platforms).\n- HR Round: Be ready to discuss leadership, ownership, and cultural fit."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho's hiring process is highly structured, emphasizing a mix of technical rigor and problem-solving skills across all roles. For entry-level and mid-level positions like SDE-1 and SDE-2, the process includes rigorous online assessments (OAs), machine coding rounds, and system design or hiring manager rounds. Senior roles (e.g., SDE-3) involve deeper technical discussions, multi-threaded system design, and extensive project evaluations. The company prioritizes hands-on coding, algorithmic efficiency, and scalable design principles, reflecting its focus on building robust e-commerce platforms.", "by_role": {"SDE-2": "# Meesho SDE-2 Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves 3-4 rounds: a Problem Solving and Data Structures (PS-DS) round, a Machine Coding round, and a System Design + Hiring Manager round. Candidates are expected to demonstrate strong algorithmic skills, system design acumen, and project ownership. The process is rigorous, with a focus on scalability, efficiency, and real-world problem-solving.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Problem Solving and Data Structures (PS-DS) Round\nDuration: 1 hour\nFormat: 2 coding questions (LeetCode Medium-Hard difficulty)\nTopics: Dynamic Programming, Graphs, Trees, Arrays, Strings\n\nExact Questions Asked:\n1. Minimum Steps to Reach Target by a Knight (Coding Ninjas)\n - Problem: Find the minimum number of moves a knight requires to reach a target position on a chessboard.\n - Topics: BFS, Graph Traversal\n\n2. Remove All Adjacent Duplicates in String II (LeetCode 1209)\n - Problem: Remove adjacent duplicate characters from a string, reducing the string by k duplicates at a time.\n - Topics: Stack, String Manipulation\n\n---\n\n### 2. Machine Coding Round\nDuration: 1.5-2 hours\nFormat: Design and implement a system with specific functionalities\nTopics: OOP Principles, Scalability, Edge Cases\n\nExact Questions Asked:\n1. Snake & Ladder Game Design\n - Problem: Design a Snake & Ladder game with customizable board size, snakes, ladders, and dice rolls.\n - Requirements:\n - Support for multiple players.\n - Ability to add snakes and ladders dynamically.\n - Track player positions and handle dice rolls.\n - Topics: OOP, Game Logic, State Management\n\n---\n\n### 3. System Design + Hiring Manager Round\nDuration: 1 hour\nFormat: System design discussion + project and behavioral questions\nTopics: Scalability, Database Design, API Design, Consistency Models\n\nExact Questions Asked:\n1. Twitter News Feed High-Level Design\n - Problem: Design a scalable news feed system for Twitter.\n - Requirements:\n - Support for user follow/unfollow.\n - Efficient retrieval of news feed for a user.\n - Handle millions of users.\n - Topics: Database Schema, Caching, Load Balancing\n\n2. Design a Ranking and Review System for E-Commerce\n - Problem: Design a system for users to leave reviews, rate products, and sort/filter products by ratings.\n - Requirements:\n - Support for likes/dislikes on reviews.\n - Calculate and display average ratings.\n - Handle high concurrency during sales.\n - Topics: SQL vs. NoSQL, Database Design, API Design (e.g., getProductList())\n\n---\n\n## Key Takeaways\n- PS-DS Round: Focus on graph traversal, string manipulation, and dynamic programming.\n- Machine Coding: Emphasizes OOP principles, scalability, and edge-case handling.\n- System Design: Tests scalability, database design, and real-world trade-offs.\n- Hiring Manager Round: Evaluates project depth, behavioral fit, and problem-solving approach.", "SDE-1 / New Grad": "# Meesho SDE-1 / New Grad Interview Briefing\n\n## Overview\nThe SDE-1 / New Grad hiring process at Meesho is highly competitive and consists of 4-5 rounds: an Online Assessment (OA), 2-3 Technical Interviews, and an HR Round. The process emphasizes coding proficiency, problem-solving under time constraints, and fundamental CS concepts. Candidates are expected to clear the OA to proceed to technical rounds, which test DSA skills, system design basics, and project understanding.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nDuration: 75-90 minutes\nFormat: 3 coding questions + 10-25 MCQs\nTopics: Arrays, Strings, Dynamic Programming, SQL, CS Fundamentals\n\nExact Questions Asked:\n1. Given 2 arrays, find a list of values which are available in both arrays in ascending order\n - Topics: Arrays, Hashing, Sorting\n\n2. Given 2 strings, determine the minimum number of character modifications required to make them anagrams\n - Topics: Strings, Hash Maps\n\n3. Weighted Job Scheduling (GeeksforGeeks)\n - Problem: Schedule jobs to maximize profit, given their start/end times and weights.\n - Topics: Dynamic Programming, Binary Search\n\n4. MCQs (5 each from Operating Systems, Computer Networks, C/C++ output questions, and Java)\n - Topics: OS concepts (e.g., paging, virtual memory), Networking (e.g., ARP, DNS), Java/C++ fundamentals.\n\n---\n\n### 2. Technical Interview 1\nDuration: 1.5 hours\nFormat: Coding questions + CS fundamentals discussion\nTopics: Greedy Algorithms, Graphs, Trees, OS, Databases\n\nExact Questions Asked:\n1. Activity Selection Problem (GeeksforGeeks)\n - Problem: Select the maximum number of activities that don\u2019t overlap.\n - Topics: Greedy Algorithms\n\n2. Watering Plants (GeeksforGeeks)\n - Problem: Calculate the minimum number of steps to water all plants arranged in a line.\n - Topics: Greedy Algorithms\n\n3. CS Fundamentals\n - Operating Systems (e.g., semaphores vs. mutex, paging)\n - Databases (e.g., SQL vs. NoSQL, ACID properties)\n - Networking (e.g., OSI model, DNS, ARP)\n - Java/C++ (e.g., threading, vector implementation)\n\n---\n\n### 3. Technical Interview 2\nDuration: 1 hour\nFormat: Project discussion + SQL queries + CS fundamentals\nTopics: Databases, OS, Networking, OOP\n\nExact Questions Asked:\n1. Write all tables used in your project and answer SQL queries related to them\n - Topics: SQL, Database Design\n\n2. Explain ARP, DNS, and the OSI model\n - Topics: Networking\n\n3. Difference between semaphore and mutex, paging vs. virtual memory, threading in Java\n - Topics: OS, Java\n\n4. Inner implementation of vectors in C++ with complexities for insert, delete, and read operations\n - Topics: C++, Data Structures\n\n---\n\n### 4. HR/Technical Round (for On-Campus Hires)\nDuration: 1 hour\nFormat: Project deep dive + real-world scenario questions + HR questions\nTopics: System Design, Optimization, Situational Questions\n\nExact Questions Asked:\n1. Design a cab booking system and implement around 10 basic functions using OOP concepts\n - Topics: OOP, System Design\n\n2. Optimize the code you wrote for the online assessment problems\n - Topics: Algorithmic Optimization\n\n3. How would you ensure exactly x purchases occur during a sale when y people want the product, ensuring no two people get the same product?\n - Topics: Concurrency, Distributed Systems\n\n4. How would you handle a situation where you are given a project that needs to be restarted after 3-4 days?\n - Topics: Project Management, Agile\n\n---\n\n### 5. System Design Round (for some candidates)\nDuration: 1 hour\nFormat: Design a basic system (e.g., OTP system)\nTopics: Low-Level Design, API Design, Scalability\n\nExact Questions Asked:\n1. Design a basic OTP system\n - Requirements: Generate, validate, and expire OTPs.\n - Topics: System Design, APIs\n\n---\n\n## Key Takeaways\n- OA: Focus on DSA, SQL, and CS fundamentals (e.g., arrays, DP, OS concepts).\n- Technical Interviews: Emphasize greedy algorithms, OOP, databases, and problem-solving.\n- HR/Technical Round: Tests system design, optimization, and real-world scenarios.\n- System Design Round: Evaluates low-level design skills and scalability.\n\nPreparation Tips:\n- Practice LeetCode Medium-Hard problems (e.g., DP, Graphs, Strings).\n- Brush up on SQL queries and database design.\n- Review OS, Networking, and OOP concepts.\n- Prepare for system design basics (e.g., OTP system, cab booking).", "Intern": "# Meesho Intern Interview Briefing\n\n## Overview\nThe intern hiring process at Meesho is highly selective, with 4-5 rounds including an Online Test, Coding Round, Low-Level Design Round, and Hiring Manager Round. The process evaluates DSA skills, system design acumen, and project understanding. Candidates are expected to demonstrate problem-solving under time constraints and fundamental CS knowledge.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Test (NextLevel Screening Test)\nDuration: 30 minutes\nFormat: 20 MCQs (OS, DSA, Networking, Error Handling) + Verbal Questions (AI-evaluated)\nTopics: Operating Systems, Data Structures, Networking, Error Handling\n\nExact Questions Asked:\n- Topics: OS (e.g., processes, threads), DSA (e.g., arrays, trees), Networking (e.g., TCP/IP), Error Handling.\n\n---\n\n### 2. Coding Round (HackerRank)\nDuration: 105 minutes\nFormat: 3 coding problems (Medium-Hard)\nTopics: Binary Search, Dynamic Programming, Segment Trees\n\nExact Questions Asked:\n- Topics: Binary Search, DP (e.g., knapsack variants), Segment Trees.\n\n---\n\n### 3. Low-Level Design Round\nDuration: 90 minutes\nFormat: Design and implement a system using SOLID principles\nTopics: OOP, Design Patterns, System Design\n\nExact Questions Asked:\n1. Implement an Inventory Management System\n - Requirements: Support for adding/removing items, tracking stock, and generating reports.\n - Topics: OOP, Design Patterns (e.g., Singleton, Factory)\n\n---\n\n### 4. Hiring Manager Round\nDuration: 45 minutes\nFormat: Situational questions + project discussion + system design\nTopics: Project Deep Dive, Real-World Scenarios, Databases\n\nExact Questions Asked:\n1. Design a chat application\n - Requirements: Database schema, APIs, and application flow.\n - Topics: System Design, Databases\n\n2. Situational Questions (e.g., handling a project restart)\n - Topics: Project Management\n\n---\n\n## Key Takeaways\n- Online Test: Focus on CS fundamentals (OS, Networking, DSA).\n- Coding Round: Emphasize Binary Search, DP, and Segment Trees.\n- Low-Level Design: Test OOP principles and design patterns.\n- Hiring Manager Round: Evaluate project depth and real-world problem-solving.\n\nPreparation Tips:\n- Practice DSA problems (e.g., Binary Search, DP).\n- Review OOP concepts and design patterns.\n- Brush up on system design basics (e.g., chat applications).", "SDE-3 / Senior": "# Meesho SDE-3 / Senior Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho involves 5+ rounds, including Machine Coding, System Design, and Hiring Manager Rounds. The process emphasizes advanced system design, multi-threaded programming, and scalability. Candidates are expected to demonstrate deep technical expertise, leadership in project discussions, and ability to design high-performance systems.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Machine Coding Round\nDuration: 2 hours\nFormat: Implement a multi-threaded system with OOP principles\nTopics: Threads, OOP, Scalability\n\nExact Questions Asked:\n1. N Elevator System Implementation\n - Problem: Design an elevator system for N elevators with support for concurrent requests.\n - Requirements:\n - Handle multiple elevator requests efficiently.\n - Optimize for minimizing wait time.\n - Use multi-threading for concurrent operations.\n - Topics: Multi-threading, OOP, Concurrency\n\n---\n\n### 2. System Design Round\nDuration: 1 hour\nFormat: Design a scalable system\nTopics: Scalability, Database Design, API Design\n\nExact Questions Asked:\n1. Design a Trading Platform\n - Problem: Design a system similar to a trading platform with a unique use case.\n - Requirements:\n - Support for high-frequency trading.\n - Efficient order matching.\n - Real-time analytics.\n - Topics: System Design, Databases, APIs\n\n---\n\n### 3. Technical Round (Unspecified)\nDuration: 1 hour\nFormat: Discussion on projects and design decisions\nTopics: Project Deep Dive, Design Principles\n\nExact Questions Asked:\n- Topics: Personal projects, design decisions, trade-offs.\n\n---\n\n### 4. Hiring Manager Round\nDuration: 1 hour\nFormat: Project discussion + behavioral and situational questions\nTopics: Project Ownership, Leadership, Values\n\nExact Questions Asked:\n- Topics: Personal projects, scenarios, principles, and values.\n\n---\n\n## Key Takeaways\n- Machine Coding: Focus on multi-threading, OOP, and scalability.\n- System Design: Test advanced system design skills (e.g., trading platforms).\n- Technical Round: Evaluate project depth and design principles.\n- Hiring Manager Round: Assess leadership, ownership, and cultural fit.\n\nPreparation Tips:\n- Practice multi-threaded programming (e.g., elevator systems).\n- Review advanced system design (e.g., trading platforms).\n- Prepare for project deep dives and leadership discussions."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho's hiring process is highly structured, with a strong emphasis on problem-solving, system design, and low-level design across all roles. Candidates are rigorously evaluated in machine coding rounds, where implementation skills, scalability, and edge-case handling are critical. The process often includes a behavioral and project deep-dive round to assess cultural fit and real-world problem-solving ability.", "by_role": {"SDE-2": "# Meesho SDE-2 Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho emphasizes algorithmic problem-solving, scalable system design, and hands-on implementation skills. Candidates are expected to demonstrate proficiency in Dynamic Programming, Graphs, and Low-Level Design, with a strong focus on writing clean, optimized code. The process includes a Problem Solving + Data Structures (PS-DS) round, a Machine Coding round, and a Hiring Manager round to evaluate technical depth and project experience.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Problem Solving + Data Structures (PS-DS) Round\n- Duration: 1 hour\n- Format: 2 coding questions\n- Topics: Dynamic Programming, Graphs, Trees, Arrays, Strings\n- Questions Asked:\n 1. Minimum Steps to Reach Target by a Knight (Coding Ninjas)\n 2. Remove All Adjacent Duplicates in String II (LeetCode)\n\n---\n\n### 2. Machine Coding Round\n- Duration: 1.5 hours\n- Format: Design and implement a working system\n- Topics: Object-Oriented Design, State Management, Edge Cases\n- Questions Asked:\n 1. Snake & Ladder Game Design\n - Implement the game with customizable board size, dice, and player moves.\n - Handle edge cases like invalid moves, simultaneous dice rolls, and winner declaration.\n\n---\n\n### 3. Hiring Manager Round\n- Duration: 1 hour\n- Format: Project discussion + Behavioral Questions\n- Topics: System Design, Project Depth, Collaboration, Problem-Solving\n- Questions Asked:\n 1. Project Discussion: Deep dive into past projects, tech stack choices, and trade-offs.\n 2. Behavioral Questions: Situational and scenario-based questions to assess problem-solving and teamwork.\n\n---\n\n## Key Takeaways for Candidates\n- Focus Areas: Practice Dynamic Programming, Graph Algorithms, and Low-Level Design rigorously.\n- Machine Coding: Prioritize clean code, modularity, and edge-case handling in your implementations.\n- Behavioral Prep: Be ready to discuss scalability, trade-offs, and real-world project challenges in detail.\n\n---\n\n## Resources\n- Practice Platforms: LeetCode, Coding Ninjas\n- System Design: Grokking the System Design Interview, Meesho\u2019s product offerings (e.g., e-commerce, logistics).\n- Low-Level Design: SOLID principles, Design Patterns (e.g., Singleton, Factory).", "SDE-1 / New Grad": "# Meesho SDE-1 / New Grad Interview Briefing\n\n## Overview\nThe SDE-1 / New Grad role at Meesho is designed to identify strong foundational programming skills, problem-solving ability, and adaptability. The process includes an Online Assessment (OA), Technical Rounds, and HR/Technical Rounds, with a strong emphasis on coding, system design, and conceptual clarity. Candidates are expected to demonstrate proficiency in DSA, OOP, and real-world problem-solving.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Online Assessment (OA)\n- Duration: 75\u201390 minutes\n- Format: Coding + MCQs\n- Topics: Arrays, Strings, Dynamic Programming, SQL, CS Fundamentals\n- Questions Asked:\n 1. Coding Questions:\n - Find common elements in two arrays (sorted/unsorted).\n - Minimum modifications to make two strings anagrams.\n - Weighted Job Scheduling (GeeksforGeeks)\n 2. MCQs:\n - Operating Systems, Computer Networks, C/C++/Java Output Questions, DBMS (SQL vs. NoSQL, ACID, Normalization).\n\n---\n\n### 2. Technical Interview 1\n- Duration: 1.5 hours\n- Format: Coding + Concepts\n- Topics: Greedy Algorithms, Graphs, OOP, Databases\n- Questions Asked:\n 1. Activity Selection Problem (GeeksforGeeks)\n 2. Water the Plants (GeeksforGeeks)\n 3. Concepts: Operating Systems (semaphores vs. mutex), DBMS (SQL vs. NoSQL), OOP (inheritance, polymorphism).\n\n---\n\n### 3. Technical Interview 2\n- Duration: 1 hour\n- Format: Concepts + Project Discussion\n- Topics: Networks, DBMS, OOP, Vectors in C++\n- Questions Asked:\n 1. SQL Queries: Write queries for database tables in projects.\n 2. Networking: Explain ARP, DNS, OSI model.\n 3. OOP: Inner workings of vectors in C++ (complexities for insert/delete/read).\n\n---\n\n### 4. HR/Technical Round\n- Duration: 1 hour\n- Format: Project Deep Dive + Real-World Scenarios\n- Topics: System Design, Optimization, Behavioral\n- Questions Asked:\n 1. System Design: Design a cab booking system (OOP implementation, 10+ functions).\n 2. Optimization: Optimize solutions from OA, discuss trade-offs in tech stack choices.\n 3. Real-World Scenarios:\n - Ensure exactly x purchases during a sale with high demand (no duplicates).\n - Handle a project restart after 3\u20134 days due to flawed approach.\n\n---\n\n## Key Takeaways for Candidates\n- Focus Areas: Master DSA (Arrays, Strings, Graphs), OOP, and SQL for the OA.\n- Technical Rounds: Practice coding on HackerRank and review OS/DBMS concepts thoroughly.\n- HR Round: Be prepared to discuss projects, trade-offs, and real-world problem-solving in detail.\n\n---\n\n## Resources\n- Practice Platforms: LeetCode, HackerRank, GeeksforGeeks\n- System Design: Grokking Low-Level Design\n- CS Fundamentals: Operating Systems, Computer Networks, DBMS (SQL vs. NoSQL).", "Intern": "# Meesho Intern Interview Briefing\n\n## Overview\nThe Intern role at Meesho is highly competitive, with a focus on algorithmic problem-solving, low-level design, and real-world application of CS fundamentals. The process includes an Online Test, Coding Round, Low-Level Design Round, and Hiring Manager Round, evaluating both technical depth and adaptability.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Online Test\n- Duration: 30 minutes\n- Format: MCQs (AI-evaluated verbal questions)\n- Topics: Operating Systems, DSA, Networking, Error Handling\n- Questions Asked:\n - 20 multiple-choice questions covering the above topics.\n\n---\n\n### 2. Coding Round\n- Duration: 105 minutes\n- Format: 3 coding problems\n- Topics: Binary Search, Dynamic Programming, Segment Tree\n- Questions Asked:\n 1. Binary Search (e.g., find an element in a rotated sorted array).\n 2. Dynamic Programming (e.g., knapsack variants).\n 3. Segment Tree (e.g., range queries, updates).\n\n---\n\n### 3. Low-Level Design Round\n- Duration: 90 minutes\n- Format: Design + Implementation\n- Topics: OOP, SOLID Principles, Design Patterns\n- Questions Asked:\n - Inventory Management System: Implement using SOLID principles, design patterns (e.g., Observer, Factory).\n - Bonus: Add functionality like restocking, order tracking.\n\n---\n\n### 4. Hiring Manager Round\n- Duration: 45 minutes\n- Format: Project Discussion + Scenario-Based Questions\n- Topics: System Design, Behavioral, Real-World Scenarios\n- Questions Asked:\n 1. System Design: Design a chat application (database schema, APIs, flow).\n 2. Behavioral: Situational questions (e.g., handling tight deadlines, team conflicts).\n\n---\n\n## Key Takeaways for Candidates\n- Focus Areas: Practice DSA (Binary Search, DP, Segment Tree) and Low-Level Design rigorously.\n- SOLID Principles: Understand design patterns and their applications.\n- Behavioral Prep: Be ready to discuss projects, trade-offs, and real-world scenarios confidently.\n\n---\n\n## Resources\n- Practice Platforms: LeetCode, HackerRank\n- Low-Level Design: SOLID Principles, Design Patterns\n- CS Fundamentals: Operating Systems, Networking, Error Handling.", "SDE-3 / Senior": "# Meesho SDE-3 / Senior Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho targets experienced engineers with strong system design, scalability, and leadership skills. The process includes Machine Coding, System Design, and Bar Raiser Rounds, focusing on practical implementation, distributed systems, and architectural trade-offs.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Machine Coding Round\n- Duration: 2 hours\n- Format: Design + Implementation\n- Topics: Threading, OOP, Scalability\n- Questions Asked:\n - N Elevator System: Implement with thread safety, OOP principles, and state management.\n - Inventory/Order Management Service: Design for concurrent users, thread safety, and edge-case handling.\n\n---\n\n### 2. System Design Round\n- Duration: 1\u20131.5 hours\n- Format: High-Level Design\n- Topics: Microservices, Scalability, Trade-offs\n- Questions Asked:\n 1. Trading Platform: Design a system with real-time updates, user management, and order processing.\n 2. Custom Ad Service: Focus on scalability, microservices architecture, and load balancing.\n\n---\n\n### 3. Bar Raiser Round\n- Duration: 1 hour\n- Format: Follow-up + Scenario-Based Questions\n- Topics: Distributed Systems, Algorithms, Behavioral\n- Questions Asked:\n 1. Distributed Systems: Design a fault-tolerant system (e.g., leader election, consensus protocols).\n 2. Algorithms: Solve scenario-based problems (e.g., optimizing database queries).\n 3. Behavioral: Discuss leadership, mentorship, and handling high-pressure situations.\n\n---\n\n## Key Takeaways for Candidates\n- Focus Areas: Master System Design, Distributed Systems, and Threading.\n- Scalability: Prioritize microservices, load balancing, and fault tolerance in your designs.\n- Behavioral Prep: Be ready to discuss leadership, trade-offs, and real-world architectural decisions.\n\n---\n\n## Resources\n- System Design: Grokking the System Design Interview, Meesho\u2019s Product Docs\n- Distributed Systems: MIT 6.824, Designing Data-Intensive Applications\n- Threading: Java Concurrency in Practice, POSIX Threads Programming.", "Other": "# Meesho Other Roles Interview Briefing\n\n## Overview\nMeesho\u2019s "Other" roles (e.g., off-campus, non-standard tracks) follow a flexible but rigorous process, often including HR, Technical, and System Design Rounds. The focus varies by role but typically emphasizes problem-solving, conceptual clarity, and cultural fit.\n\n---\n\n## Round Breakdown & Questions\n\n### Candidate 1\n#### 1. Coding Assessment\n- Topics: Dynamic Programming, Graphs, Disjoint-Set Union (DSU)\n- Outcome: Shortlisted for system design round.\n\n#### 2. System Design Round\n- Duration: 1.5 hours\n- Format: Low-Level Design\n- Topics: Scalability, OOP\n- Questions Asked:\n - Design a system similar to Uber (ride matching, driver management, real-time updates).\n\n#### 3. Project Discussion + HR\n- Topics: React Hooks, System Calls, Express.js, Database Schema\n- Outcome: Rejected due to doubts about project originality (verified via browser extension).\n\n---\n\n### Candidate 2\n#### Rounds (Generic Structure)\n1. HR Round: Initial screening (cultural fit, communication).\n2. Technical Interviews: Focus on DSA, System Design, or Case Studies (varies by role).\n3. Behavioral Round: Project deep dives, scenario-based questions.\n4. Final Interviews: On-site or virtual, assessing problem-solving and teamwork.\n\n---\n\n## Key Takeaways for Candidates\n- Flexibility: Be prepared for role-specific variations in the process.\n- Project Originality: Ensure all projects are verifiable and well-documented.\n- Conceptual Clarity: Review DSA, System Design, and CS Fundamentals thoroughly.\n\n---\n\n## Resources\n- DSA: LeetCode, Codeforces\n- System Design: Grokking the System Design Interview\n- Behavioral: Amazon Leadership Principles, Meesho\u2019s Culture Docs"}}

{"overview": "Meesho\u2019s hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, system design, and practical implementation. The process varies significantly by role, with SDE-1 and Intern candidates facing a mix of coding, MCQs, and system design rounds, while senior roles (SDE-2 and above) focus more on advanced DSA, machine coding, and scalable system design. Rejections often hinge on edge-case handling, scalability concerns, and project originality verification.", "by_role": {"SDE-2": "# Meesho SDE-2 Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves 3-4 rounds, including a DSA round, machine coding round, and hiring manager/system design round. Candidates are expected to demonstrate strong problem-solving skills, proficiency in system design, and the ability to write clean, scalable code. Rejections often occur due to challenges in implementing edge cases or scalability concerns in machine coding rounds.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. PS-DS / Technical Round (1 hour)\nFormat: 2 coding questions, often on platforms like LeetCode or HackerRank.\nKey Topics: Dynamic Programming, Graphs, Greedy Algorithms, and Tree-based problems.\nSample Questions:\n- Minimum Steps to Reach Target by a Knight\n- Remove All Adjacent Duplicates in String II\n\n---\n\n### 2. Machine Coding Round (1.5\u20132 hours)\nFormat: Design and implement a scalable system (e.g., Snake & Ladder, ride-sharing app features).\nKey Focus: OOPs principles, thread safety, concurrent user handling, and edge-case optimization.\nSample Problem:\n- Design a Snake & Ladder game with customizable rules and efficient move validation.\n- Implement two features for a ride-sharing application (e.g., ride matching, fare calculation).\n\n---\n\n### 3. System Design + Hiring Manager Round (1 hour)\nFormat: High-level design (HLD) and behavioral/project discussions.\nKey Topics: Scalability, microservices, database design, and API implementation.\nSample Problem:\n- Design a ranking and review system for an e-commerce website with sorting, filtering, and consistency guarantees.\n- Write a getProductList() API and discuss trade-offs between SQL/NoSQL, MongoDB/Redis.\n\n---\n\n### 4. Additional Notes\n- Rejection Triggers: Poor handling of edge cases, lack of scalability in design, or inability to justify design choices.\n- Preparation Tip: Focus on LeetCode Medium/Hard problems and Low-Level Design (LLD) principles.\n\n---\n\nSources: LeetCode Discuss, GeeksforGeeks", "SDE-1 / New Grad": "# Meesho SDE-1 / New Grad Interview Briefing\n\n## Overview\nThe SDE-1 hiring process for new graduates at Meesho is highly competitive, with a strong emphasis on coding proficiency, system design fundamentals, and project depth. The process includes an Online Assessment (OA), technical rounds, and HR/technical rounds, with a focus on problem-solving and real-world applications. Candidates with CGPA > 7 and from circuit branches are often prioritized.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA) (75\u201390 minutes)\nFormat: 3 coding questions (easy to hard) + 10\u201325 MCQs (CS fundamentals).\nKey Topics: DSA, SQL, Operating Systems, Computer Networks, and OOP concepts.\nSample Questions:\n- Coding:\n - Given two arrays, find common elements in ascending order.\n - Make two strings anagrams with minimal modifications.\n - Weighted Job Scheduling (optimized with DP and binary search).\n- MCQs:\n - Operating Systems, Computer Networks, C++/Java output questions, and DBMS.\n\n---\n\n### 2. Technical Interview 1 (1.5 hours)\nFormat: Coding problems and conceptual discussions.\nKey Topics: Greedy Algorithms, Graphs, and SQL/DBMS.\nSample Questions:\n- Activity Selection Problem\n- Water the Plants\n- SQL queries: ROW_NUMBER(), RANK(), DENSE_RANK().\n\n---\n\n### 3. Technical Interview 2 (1 hour)\nFormat: Deep dive into projects, DBMS, OS, and Networking.\nKey Topics: Semaphores vs. Mutex, Paging, Virtual Memory, SQL vs. NoSQL, and ACID properties.\nSample Questions:\n- Explain ARP, DNS, and OSI model.\n- Difference between semaphore and mutex.\n- Inner implementation of vectors in C++.\n\n---\n\n### 4. System Design Round (1.5 hours)\nFormat: Design a cab booking system or similar real-world system.\nKey Topics: OOP principles, scalability, and debugging.\nSample Problem:\n- Design a cab booking system and implement 10+ functions using OOP concepts.\n\n---\n\n### 5. HR/Technical Round (1 hour)\nFormat: Project deep dives, optimization, and situational questions.\nKey Topics: Tech stack choices, real-world scenario handling (e.g., sale scenarios with limited inventory).\nSample Questions:\n- Optimize solutions from the OA.\n- How would you ensure exactly x purchases occur during a sale with high demand?\n- Handle a project where the approach is deemed wrong after 3\u20134 days.\n\n---\n\n### 6. Additional Notes\n- Rejection Triggers: Poor optimization, inability to explain project choices, or weak CS fundamentals.\n- Preparation Tip: Focus on Greedy Algorithms, SQL, and OOP principles.\n\n---\n\nSources: GeeksforGeeks, LeetCode Discuss", "Intern": "# Meesho Intern Interview Briefing\n\n## Overview\nThe intern hiring process at Meesho is highly selective, with a strong focus on DSA, low-level design, and problem-solving. The process includes an online test, coding round, low-level design round, and hiring manager round. Candidates are expected to demonstrate a strong grasp of CS fundamentals and the ability to design scalable systems.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Test (30 minutes)\nFormat: 20 MCQs (OS, DSA, Networking, Error Handling).\nKey Topics: Operating Systems, Data Structures, Networking, and Error Handling.\nSample Questions:\n- MCQs on OS, DSA, Networking, and Error Handling.\n\n---\n\n### 2. Coding Test (105 minutes)\nFormat: 3 coding problems (medium to hard) on HackerRank.\nKey Topics: Binary Search, Dynamic Programming, and Segment Tree.\nSample Questions:\n- Binary Search problems.\n- Dynamic Programming (e.g., LIS revisited).\n- Segment Tree applications.\n\n---\n\n### 3. Low-Level Design Round (90 minutes)\nFormat: Design and implement a system (e.g., Inventory Management System).\nKey Topics: SOLID principles, design patterns, and thread safety.\nSample Problem:\n- Implement an Inventory Management System with bonus functionalities.\n\n---\n\n### 4. Hiring Manager Round (45 minutes)\nFormat: Situational questions, project deep dives, and system design (e.g., chat application).\nKey Topics: Database schema, APIs, and application flow.\nSample Questions:\n- Design a chat application (database schema, APIs).\n- Discuss situational scenarios and project choices.\n\n---\n\n### 5. Additional Notes\n- Rejection Triggers: Struggles with follow-up questions or inability to justify design choices.\n- Preparation Tip: Focus on DSA, LLD, and system design.\n\n---\n\nSources: GeeksforGeeks", "SDE-3 / Senior": "# Meesho SDE-3 / Senior Interview Briefing\n\n## Overview\nThe SDE-3 hiring process at Meesho is rigorous and advanced, focusing on scalable system design, machine coding, and leadership principles. Candidates are expected to demonstrate expertise in distributed systems, concurrency, and real-world problem-solving. The process includes multiple technical rounds, a bar raiser round, and behavioral assessments.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Machine Coding Round (2 hours)\nFormat: Implement a complex system (e.g., N Elevator system) with a focus on threads, OOPs, and scalability.\nKey Topics: Concurrency, Thread Safety, and OOPs Principles.\nSample Problem:\n- Design an N Elevator system with thread-safe operations.\n\n---\n\n### 2. System Design Round (1.5 hours)\nFormat: Design a scalable system (e.g., trading platform, custom ad service).\nKey Topics: Microservices, Scalability, and Distributed Systems.\nSample Problem:\n- Design a system similar to a trading platform with a unique use case.\n- Design a custom ad service with scalability and microservices architecture.\n\n---\n\n### 3. Bar Raiser Round (1 hour)\nFormat: Follow-up on weaker areas, scenario-based questions.\nKey Topics: Distributed Systems, Algorithms, and Scenario-Based Design.\nSample Questions:\n- Discuss distributed systems design and trade-offs.\n- Solve scenario-based algorithmic problems.\n\n---\n\n### 4. Non-Technical Round (1 hour)\nFormat: Behavioral questions, project deep dives, and values assessment.\nKey Topics: Personal projects, principles, and scenario-based discussions.\nSample Questions:\n- Discuss personal projects and design decisions.\n- Handle scenario-based questions (e.g., handling failure in distributed systems).\n\n---\n\n### 5. Additional Notes\n- Rejection Triggers: Poor scalability in design, inability to justify choices, or weak concurrency handling.\n- Preparation Tip: Focus on System Design, Distributed Systems, and Leadership Principles.\n\n---\n\nSources: LeetCode Discuss"}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho\u2019s hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, system design, and practical implementation. For experienced roles like SDE-2 and above, the process typically includes technical rounds, machine coding, and system design, while for interns and new grads, it starts with an online assessment (OA) followed by multiple technical and HR rounds. Machine coding and system design are recurring themes across all roles, reflecting Meesho\u2019s focus on scalable and efficient solutions.", "by_role": {"SDE-2": "# Role: SDE-2\n\n## Online Assessment (OA) Format\n- Not consistently used for this role. Some candidates skipped OA and went directly to technical rounds.\n\n## Round Breakdown\n\n### 1. Technical Round (DSA Focus)\n- Duration: 1 hour\n- Format: 2 coding problems (LeetCode medium/hard or similar).\n- Topics: Dynamic Programming, Graphs, Trees, Arrays, Strings.\n- Exact Questions Asked:\n - Minimum Steps to Reach Target by a Knight\n - Remove All Adjacent Duplicates in String II\n - Course Schedule II\n - Container With Most Water\n - Asteroid Collision\n - Number of Islands (Matrix Problem)\n\n### 2. Machine Coding Round\n- Duration: 1.5\u20132 hours\n- Format: Design and implement a system (e.g., Snake & Ladder, ride-sharing features, Facebook APIs).\n- Focus: OOPs, design patterns, scalability, and thread safety.\n- Exact Questions Asked:\n - Snake & Ladder Game Design\n - Design a ride-sharing application (e.g., Uber-like features).\n - Implement Facebook APIs (Create Post, Delete Post, Get Feed, Follow/Unfollow).\n - Design an N Elevator system (focus on threads and OOPs).\n\n### 3. System Design Round\n- Duration: 1 hour\n- Format: High-Level Design (HLD) and Low-Level Design (LLD) discussions.\n- Topics: Scalability, microservices, database design, APIs.\n- Exact Questions Asked:\n - Design a Twitter news feed system.\n - Design a ranking and review system for an e-commerce website.\n - Design a trading platform (similar to Meesho\u2019s use case).\n - Design a custom ad service (focus on scalability).\n\n### 4. Hiring Manager Round\n- Duration: 1 hour\n- Format: Project discussion, behavioral questions, and scenario-based problems.\n- Topics: Deep dive into projects, problem-solving approaches, and cultural fit.\n\n---\n\n## Key Takeaways\n- Machine coding and system design are critical for SDE-2 roles.\n- Dynamic Programming and Graphs are frequently tested in technical rounds.\n- Practical implementation (e.g., APIs, system design) is a recurring theme.", "SDE-1 / New Grad": "# Role: SDE-1 / New Grad\n\n## Online Assessment (OA) Format\n- Duration: 75\u201390 minutes\n- Format: 3 coding questions (easy to hard) + 20\u201325 MCQs (Computer Science fundamentals).\n- Topics: DSA, OS, CN, DBMS, OOPs, and programming languages (C++/Java/Python).\n- Exact Questions Asked:\n - Coding Questions:\n - Find common elements in two arrays.\n - Make two strings anagrams (minimum modifications).\n - Weighted Job Scheduling (DP + Binary Search).\n - Activity Selection Problem.\n - Water the Plants (Greedy approach).\n - Reverse a string with substitutions (A<->G, C<->T).\n - BFS in a 2D matrix (pathfinding with obstacles).\n - MCQs:\n - Operating Systems (semaphores vs. mutex, paging).\n - Computer Networks (ARP, DNS, OSI model).\n - DBMS (SQL vs. NoSQL, Normalization, ACID).\n - Programming (C++/Java, vectors, threading).\n\n## Round Breakdown\n\n### 1. Technical Interview 1\n- Duration: 1\u20131.5 hours\n- Format: 2 coding questions + conceptual topics.\n- Topics: DSA, OS, DBMS, CN.\n- Exact Questions Asked:\n - Coding: Extension of Number of Islands.\n - Coding: Count arrays with divisibility conditions.\n - Concepts: OS (paging, virtual memory), DBMS (SQL vs. NoSQL).\n\n### 2. Technical Interview 2\n- Duration: 1 hour\n- Format: Project discussion, SQL queries, and CS fundamentals.\n- Topics: OOPs, design patterns, system design basics.\n- Exact Questions Asked:\n - Write SQL queries for a given database schema.\n - Explain tech stack choices in projects.\n - Optimize solutions from OA (e.g., weighted job scheduling).\n - Real-world scenarios (e.g., handling sales with limited inventory).\n\n### 3. System Design Round\n- Duration: 1 hour\n- Format: Basic system design (e.g., OTP system, cab booking).\n- Topics: HLD, LLD, APIs.\n- Exact Questions Asked:\n - Design a basic OTP system.\n - Design a cab booking system (OOP implementation).\n\n### 4. HR Round\n- Duration: 30\u201360 minutes\n- Format: Formal discussion (no technical questions).\n- Focus: Cultural fit, situational questions.\n\n---\n\n## Key Takeaways\n- OA is a major filter: Candidates must solve 2+ coding questions to advance.\n- CS fundamentals are critical: MCQs cover OS, CN, DBMS, and programming.\n- Project depth matters: Interviewers ask detailed questions about resume projects.\n- System design basics: Expect 1 round focused on designing simple systems.", "Intern": "# Role: Intern\n\n## Online Assessment (OA) Format\n- Duration: 30\u2013105 minutes\n- Format: Coding + MCQs (Computer Science fundamentals).\n- Topics: DSA, OS, DBMS, CN, error handling.\n- Exact Questions Asked:\n - Coding Questions:\n - Binary Search.\n - Dynamic Programming (e.g., Segment Tree).\n - Graph Colouring.\n - Chocolate Distribution Problem.\n - LIS (Longest Increasing Subsequence) revisited.\n - MCQs:\n - Operating Systems (processes, threads).\n - DBMS (SQL queries, normalization).\n - Computer Networks (protocols, OSI model).\n\n## Round Breakdown\n\n### 1. Online Test\n- Duration: 30 minutes\n- Format: 20 MCQs + verbal questions (AI-evaluated).\n- Topics: OS, DSA, CN, error handling.\n\n### 2. Coding Test\n- Duration: 90\u2013105 minutes\n- Format: 2\u20133 coding problems (medium to hard).\n- Topics: DSA (Binary Search, DP, Graphs).\n\n### 3. Low-Level Design (LLD) Round\n- Duration: 90 minutes\n- Format: Implement a system (e.g., Inventory Management).\n- Topics: SOLID principles, design patterns.\n- Exact Questions Asked:\n - Implement an Inventory Management System.\n\n### 4. Hiring Manager Round\n- Duration: 45 minutes\n- Format: Project discussion, scenario-based questions.\n- Topics: System design (e.g., chat application), behavioral questions.\n\n---\n\n## Key Takeaways\n- OA is the first major hurdle: Candidates must perform well in coding and MCQs.\n- LLD and system design are introduced early for interns.\n- Project discussions are a key part of the hiring manager round.", "SDE-3 / Senior": "# Role: SDE-3 / Senior\n\n## Round Breakdown\n\n### 1. Machine Coding Round\n- Duration: 2 hours\n- Format: Implement a scalable system (e.g., inventory/order management).\n- Focus: OOPs, threads, concurrency, scalability.\n- Exact Questions Asked:\n - Design an N Elevator system (thread handling, OOPs).\n - Design an inventory/order management service (concurrent users, thread safety).\n\n### 2. System Design Round\n- Duration: 1\u20131.5 hours\n- Format: High-level design (HLD) for complex systems.\n- Topics: Scalability, microservices, distributed systems.\n- Exact Questions Asked:\n - Design a trading platform (similar to Meesho\u2019s use case).\n - Design a custom ad service (scalability, microservices).\n\n### 3. Bar Raiser Round\n- Duration: 1 hour\n- Format: Follow-up on weaker areas, scenario-based questions.\n- Topics: Distributed systems, algorithms, system design.\n- Focus: Deep dive into design decisions and trade-offs.\n\n### 4. Non-Technical Round\n- Duration: 1 hour\n- Format: HR and hiring manager discussion.\n- Topics: Personal projects, principles, values, scenario-based questions.\n\n---\n\n## Key Takeaways\n- Machine coding and system design are non-negotiable for senior roles.\n- Scalability and concurrency are critical topics.\n- Bar raiser round ensures candidates meet Meesho\u2019s high standards."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho\u2019s hiring process is highly structured, emphasizing a mix of Data Structures and Algorithms (DSA), Machine Coding, System Design, and Behavioral Assessments. The process is rigorous, with a strong focus on problem-solving, scalability, and practical implementation in rounds like PS-DS, Machine Coding, and Hiring Manager discussions. Candidates with consistent preparation and adaptability to real-world scenarios (e.g., e-commerce systems, ride-sharing apps) tend to perform better, while gaps in implementation or design principles often lead to rejections.", "by_role": {"SDE-2": "# SDE-2 Interview Briefing for Meesho\n\n## Overview\nThe SDE-2 role at Meesho emphasizes DSA proficiency, scalable design, and hands-on coding in machine coding rounds. Candidates typically undergo 3-4 rounds, including a PS-DS round (DSA), Machine Coding (implementation-heavy), and System Design/Hiring Manager rounds. Success hinges on clean code, problem-solving under constraints, and design trade-offs.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. PS-DS (Problem Solving - Data Structures) Round\nDuration: 1 hour\nFormat: 2 coding questions (LeetCode-style)\nFocus: DSA fundamentals, edge-case handling, and optimization.\n\nExample Questions:\n- Minimum Steps to Reach Target by a Knight (Coding Ninjas)\n- Remove All Adjacent Duplicates in String II (LeetCode)\n- Course Schedule II\n- Container With Most Water\n- Asteroid Collision\n- Number of Islands (Matrix/Graph traversal)\n\nKey Themes:\n- Graph traversals (BFS/DFS)\n- Stack/queue manipulations\n- Dynamic Programming (DP) basics\n- Greedy algorithms\n\n---\n\n### 2. Machine Coding Round\nDuration: 1.5\u20132 hours\nFormat: Design and implement a functional system (e.g., Snake & Ladder, ride-sharing app features).\nFocus: OOPs, design patterns, concurrency, and scalability.\n\nExample Problems:\n- Snake & Ladder Game Design (Core logic, dice rolls, player movement)\n- Ride-Sharing App Features (e.g., ride booking, driver allocation)\n- Facebook API Design (Create Post, Delete Post, Get Feed, Follow/Unfollow)\n- Inventory Management System (addProduct, createOrder, confirmOrder, getInventory)\n- N Elevator System (Thread handling, OOPs principles)\n\nKey Themes:\n- Design Patterns (Singleton, Factory, Observer)\n- Concurrency (Thread safety, race conditions)\n- Scalability (Handling concurrent users, load balancing)\n- Low-Level Design (LLD) (Class diagrams, modularity)\n\n---\n\n### 3. System Design Round\nDuration: 1\u20131.5 hours\nFormat: High-Level Design (HLD) + Low-Level Design (LLD) discussions.\nFocus: Trade-offs, scalability, and real-world constraints.\n\nExample Problems:\n- Twitter News Feed Design (HLD)\n- Ranking & Review System for E-Commerce (Sorting, filtering, consistency models)\n- Trading Platform (Microservices, event-driven architecture)\n- Custom Ad Service (Scalability, microservices, caching)\n\nKey Themes:\n- Database Design (SQL vs. NoSQL, indexing, sharding)\n- Caching Strategies (Redis, CDN integration)\n- API Design (RESTful principles, pagination)\n- Consistency Models (Strong vs. eventual consistency)\n\n---\n\n### 4. Hiring Manager Round\nDuration: 1 hour\nFormat: Project deep dives, behavioral questions, and situational scenarios.\nFocus: Communication, ownership, and alignment with Meesho\u2019s values.\n\nExample Topics:\n- Project Discussions (Tech stack, challenges, trade-offs)\n- Behavioral Questions (e.g., handling project pivots, conflict resolution)\n- Scenario-Based Problems (e.g., optimizing a sale event with high demand)\n\n---\n\n## Key Takeaways\n- DSA is non-negotiable: Expect medium-hard LeetCode problems with tight time constraints.\n- Machine Coding is critical: Prioritize clean, modular code with design patterns.\n- System Design matters: Focus on scalability, trade-offs, and real-world constraints.\n- Behavioral alignment: Prepare to discuss projects and scenarios in detail.\n\nResources:\n- Practice DSA on LeetCode\n- Study design patterns via Refactoring.Guru\n- Mock system design rounds with peers.\n\n---\n\nSources: Meesho Interview Experiences (SDE-2) from LeetCode Discussions and GeeksforGeeks.", "SDE-1 / New Grad": "# SDE-1 / New Grad Interview Briefing for Meesho\n\n## Overview\nThe SDE-1 role at Meesho is designed for entry-level engineers, with a strong emphasis on DSA, problem-solving, and adaptability. The process includes an Online Assessment (OA), Technical Rounds (DSA + System Design), and HR Rounds. Candidates are evaluated on coding proficiency, conceptual clarity, and project depth.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Online Assessment (OA)\nDuration: 75\u201390 minutes\nFormat: Coding + MCQs\nCutoff: Typically 2+ coding questions solved (varies by campus).\n\nExample Questions:\n- Coding Problems:\n - Find Common Elements in Two Arrays (Sorting/Hashing)\n - Make Two Strings Anagram\n - Weighted Job Scheduling (DP + Binary Search)\n - Activity Selection Problem\n - Water the Plants (Greedy BFS)\n - Chocolate Distribution Problem\n - Longest Increasing Subsequence (LIS)\n - Graph Colouring\n - Max Sum of M Non-Overlapping Subarrays of Size K\n\n- MCQ Topics:\n - Operating Systems (Semaphores vs. Mutex, Paging, Virtual Memory)\n - Computer Networks (ARP, DNS, OSI Model)\n - Databases (SQL vs. NoSQL, ACID, Normalization)\n - Programming (C++/Java output questions, vectors)\n\nKey Themes:\n- Greedy Algorithms (Activity selection, job scheduling)\n- Dynamic Programming (Weighted jobs, LIS)\n- Graph Algorithms (BFS/DFS, Graph Colouring)\n- Array/Strings (Anagrams, common elements)\n\n---\n\n### 2. Technical Rounds (1\u20132 Rounds)\nDuration: 1\u20131.5 hours per round\nFormat: DSA + Conceptual Questions\nFocus: Problem-solving, optimization, and core CS fundamentals.\n\nExample Problems:\n- Data Structures:\n - Pair of Nodes Equal to Given Sum (BST)\n - Kth Node from Last (Linked List)\n - Add Two Numbers (Linked Lists)\n- Algorithms:\n - Number of Islands (Graph Traversal)\n - Infinite Grid Problem (Knight\u2019s Moves)\n- Conceptual Questions:\n - DBMS: SQL vs. NoSQL, ACID properties, normalization.\n - OS: Paging, virtual memory, threading in Java.\n - Networking: ARP, DNS, OSI model.\n\nKey Themes:\n- Tree/Graph Traversals (BFS/DFS, recursive solutions)\n- Linked Lists (Reversal, cycle detection)\n- Hashing (Frequency maps, anagrams)\n- Greedy/DP (Optimization problems)\n\n---\n\n### 3. System Design Round\nDuration: 1 hour\nFormat: Low-Level Design (LLD) or High-Level Design (HLD)\nFocus: Modularity, scalability, and real-world constraints.\n\nExample Problems:\n- Design a Cab Booking System (OOP principles, 10+ functions)\n- Design an OTP System (APIs, database schema)\n- Database Design for E-Commerce (Tables, queries, indexing)\n\nKey Themes:\n- OOP Concepts (Inheritance, polymorphism, SOLID principles)\n- Database Schema Design (ER diagrams, normalization)\n- API Design (RESTful principles, pagination)\n\n---\n\n### 4. HR/Technical Round\nDuration: 1 hour\nFormat: Project deep dives, situational questions, and behavioral assessments.\nFocus: Communication, ownership, and problem-solving mindset.\n\nExample Topics:\n- Project Discussions: Tech stack, trade-offs, alternatives.\n- Optimization Problems: Improve solutions from OA/technical rounds.\n- Real-World Scenarios:\n - Handling high-demand sales events (e.g., "Ensure exactly X purchases occur without duplicates").\n - Pivoting project approaches mid-development.\n\n---\n\n## Key Takeaways\n- Master DSA: Focus on LeetCode mediums (Greedy, DP, Graphs, Trees).\n- Practice MCQs: CS fundamentals (OS, DBMS, Networks) are heavily tested.\n- System Design Basics: Understand OOP and database design.\n- Project Depth: Be ready to discuss tech stack and trade-offs.\n\nResources:\n- LeetCode (DSA practice)\n- GeeksforGeeks (MCQs, system design)\n- Refactoring.Guru (Design patterns)\n\n---\n\nSources: Meesho Interview Experiences (SDE-1) from LeetCode Discussions and GeeksforGeeks.", "Intern": "# Intern Interview Briefing for Meesho\n\n## Overview\nThe Intern role at Meesho is highly competitive, with a multi-stage process including MCQs, DSA coding, Low-Level Design (LLD), and Hiring Manager rounds. The focus is on adaptability, problem-solving, and foundational CS concepts (DSA, OS, Networks).\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Online Assessment (MCQs)\nDuration: 30 minutes\nFormat: 20\u201330 multiple-choice questions\nTopics Covered:\n- Operating Systems (Processes, threads, memory management)\n- Data Structures & Algorithms (Arrays, trees, graphs)\n- Computer Networks (ARP, DNS, OSI model)\n- Error Handling (Debugging, edge cases)\n\nExample Questions:\n- Concepts like semaphores vs. mutex, paging, and virtual memory. \n- DSA basics (e.g., array manipulations, graph traversals).\n\n---\n\n### 2. Coding Test (HackerRank)\nDuration: 90\u2013105 minutes\nFormat: 3 DSA problems (Medium to Hard)\nFocus: Optimization, edge cases, and efficient solutions.\n\nExample Problems:\n- Binary Search\n- Dynamic Programming (DP)\n- Segment Tree\n- Chocolate Distribution Problem\n- Longest Increasing Subsequence (LIS)\n- Graph Colouring\n\nKey Themes:\n- Greedy Algorithms (Optimal choices)\n- Tree/Graph Traversals (BFS/DFS)\n- Array/Strings (Substrings, anagrams)\n\n---\n\n### 3. Low-Level Design (LLD) Round\nDuration: 90 minutes\nFormat: Design a functional system (e.g., Inventory Management System)\nFocus: OOPs principles, modularity, and scalability.\n\nExample Problems:\n- Inventory Management System (addProduct, createOrder, confirmOrder, getInventory)\n- Chat Application (Database schema, APIs, application flow)\n\nKey Themes:\n- Design Patterns (Singleton, Factory)\n- Concurrency (Thread safety, race conditions)\n- Database Schema (Tables, relationships)\n\n---\n\n### 4. Hiring Manager Round\nDuration: 45 minutes\nFormat: Project discussions, situational questions, and behavioral assessments.\nFocus: Communication, ownership, and alignment with Meesho\u2019s values.\n\nExample Topics:\n- Project Deep Dives (Tech stack, challenges, trade-offs)\n- Scenario-Based Problems (e.g., handling scalability issues)\n- Behavioral Questions (e.g., "How would you handle a project pivot?")\n\n---\n\n## Key Takeaways\n- MCQs are critical: Focus on OS, Networks, and DSA basics.\n- Coding tests are challenging: Prioritize optimization and edge cases.\n- LLD matters: Practice OOPs and design patterns.\n- Behavioral alignment: Be ready to discuss projects and scenarios.\n\nResources:\n- LeetCode (DSA practice)\n- GeeksforGeeks (MCQs, LLD)\n- HackerRank (Coding tests)\n\n---\n\nSources: Meesho Interview Experiences (Intern) from LeetCode Discussions and GeeksforGeeks.", "SDE-3 / Senior": "# SDE-3 / Senior Interview Briefing for Meesho\n\n## Overview\nThe SDE-3/Senior role at Meesho targets experienced engineers with deep expertise in system design, scalability, and leadership. The process includes Machine Coding, System Design, and Bar Raiser rounds, focusing on practical implementation, trade-offs, and architectural decisions.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Machine Coding Round\nDuration: 2 hours\nFormat: Implement a complex system (e.g., Elevator System, Inventory Management)\nFocus: Concurrency, OOPs principles, and scalability.\n\nExample Problems:\n- N Elevator System (Thread handling, OOPs principles)\n- Inventory/Order Management Service (Concurrent users, thread safety)\n\nKey Themes:\n- Concurrency (Thread safety, race conditions)\n- Design Patterns (Singleton, Factory, Observer)\n- Scalability (Handling high load, load balancing)\n- Low-Level Design (LLD) (Class diagrams, modularity)\n\n---\n\n### 2. System Design Round\nDuration: 1\u20131.5 hours\nFormat: High-Level Design (HLD) + Low-Level Design (LLD)\nFocus: Trade-offs, scalability, and real-world constraints.\n\nExample Problems:\n- Trading Platform (Microservices, event-driven architecture)\n- Custom Ad Service (Scalability, caching, microservices)\n\nKey Themes:\n- Database Design (SQL vs. NoSQL, indexing, sharding)\n- Caching Strategies (Redis, CDN integration)\n- API Design (RESTful principles, pagination)\n- Consistency Models (Strong vs. eventual consistency)\n\n---\n\n### 3. Bar Raiser Round\nDuration: 1 hour\nFormat: Follow-up on weaker areas, scenario-based questions\nFocus: Distributed systems, algorithms, and leadership principles.\n\nExample Topics:\n- Distributed Systems Design (e.g., handling failures, consistency)\n- Scenario-Based Problems (e.g., optimizing a high-traffic service)\n- Leadership Questions (e.g., mentoring junior engineers)\n\n---\n\n### 4. Non-Technical Round\nDuration: 1 hour\nFormat: Project discussions, principles, and values alignment\nFocus: Communication, ownership, and cultural fit.\n\nExample Topics:\n- Project Deep Dives (Tech stack, challenges, trade-offs)\n- Behavioral Questions (e.g., handling conflicts, project pivots)\n\n---\n\n## Key Takeaways\n- Machine Coding is critical: Prioritize concurrency, design patterns, and scalability.\n- System Design matters: Focus on trade-offs, scalability, and real-world constraints.\n- Bar Raiser round is tough: Prepare for distributed systems and leadership scenarios.\n- Non-technical rounds: Highlight project ownership and cultural alignment.\n\nResources:\n- System Design Primer\n- High Scalability\n- LeetCode (Advanced DSA)\n\n---\n\nSources: Meesho Interview Experiences (SDE-3) from LeetCode Discussions."}}

Migrated to JSONB

Migrated to JSONB

{"overview": "Dream11\u2019s hiring process is rigorous and highly structured, with a strong emphasis on technical depth and problem-solving. The process varies by role, but candidates can expect multiple rounds of interviews, including DSA (Data Structures and Algorithms), system design, database design, and managerial rounds. The company values scalability, real-time systems, and hands-on coding, particularly for mid-to-senior roles.", "by_role": {"SDE-1 / New Grad": "# SDE-1 / New Grad - Interview Briefing\n\n## Overview\nThe interview process for SDE-1 / New Grad roles at Dream11 is typically fast-paced, with all rounds completed within a week. The process includes a Technical Round, Managerial Round, and HR Round, focusing on DSA and resume-based discussions.\n\n## Round Breakdown\n\n### 1. Technical Round\n- Format: Two DSA questions (one medium-level, one hard-level).\n- Topics: Graphs and Dynamic Programming.\n- Source: LeetCode Discussion\n\n### 2. Managerial Round\n- Format: In-depth discussion about the candidate's resume and projects.\n- Focus: Deep dive into past experiences, projects, and problem-solving approaches.\n\n### 3. HR Round\n- Format: Standard HR and culture-fit questions.\n\n---\n\nFor further clarification, refer to the source.", "SDE-2": "# SDE-2 - Interview Briefing\n\n## Overview\nThe interview process for SDE-2 roles at Dream11 is comprehensive, spanning multiple rounds including DSA, System Design, Database Design, and Managerial Discussions. Candidates often describe the process as rigorous, with a focus on scalability, real-time systems, and hands-on coding.\n\n## Round Breakdown\n\n### 1. Coding Assessment (Online Round)\n- Tasks:\n 1. Minimum Path Sum\n 2. First Missing Positive\n- Source: GeeksforGeeks\n\n### 2. Technical Round (DSA + Database/Project Discussion)\n- DSA Questions:\n 1. Binary Search Variant (similar to Painter's Partition problem)\n 2. Topological Sort Variant (similar to LeetCode 207 - Course Schedule)\n- Database/Project Discussion:\n - Internal architecture of a project\n - DB schema\n - CDN, Load Balancers, and MySQL specifics\n- Source: LeetCode Discussion\n\n### 3. System Design Round\n- Task: Design a scalable notification system for Dream11 users.\n- Discussion Points:\n - Functional/non-functional requirements\n - Data model\n - System architecture\n - Scalability and failure handling\n - Ingestion mechanisms and database choices\n- Advanced Topics:\n - Implementing a database from scratch using EC2 instances\n - Covering MongoDB and Cassandra's architecture (e.g., append-on-file strategies, SSTables, bloom filters, merging, indexing, replication strategies)\n- Source: LeetCode Discussion\n\n### 4. Managerial Round (Hiring Manager Round)\n- Format: Discussion about projects, hiring philosophy, and feedback on previous rounds.\n- Focus: Insights into payment system implementations and team fit.\n- Source: GeeksforGeeks\n\n---\n\nFor further details, refer to the following sources:\n- GeeksforGeeks - SDE-2 Interview Experience\n- LeetCode Discussion - SDE-2 Backend", "SDE-3 / Senior": "# SDE-3 / Senior - Interview Briefing\n\n## Overview\nThe interview process for SDE-3 / Senior roles at Dream11 is highly detailed, with a focus on system design, database architecture, and hands-on coding. The process can span over a month and includes rounds tailored to assess scalability, real-time systems, and leadership in technical discussions.\n\n## Round Breakdown\n\n### 1. Pre-Screening Call\n- Format: Half-hour call with the Head of Engineering.\n- Focus: Initial alignment on expectations, experience, and role fit.\n\n### 2. Technical Round (Machine Coding)\n- Task: Design a message broker system.\n- Format: Machine coding round to assess practical implementation skills.\n- Source: LeetCode Discussion\n\n### 3. Database Round\n- Format: Deep dive into databases used in past projects.\n- Topics Covered:\n - Database architecture\n - Latency, failure handling, and scalability\n - Multi-tenancy, monitoring, and optimizations\n- Outcome: Interviewers were not satisfied with the answers, indicating high expectations for database expertise.\n- Source: LeetCode Discussion\n\n---\n\nFor further details, refer to the source. "}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Dream11's hiring process for engineering roles is rigorous and multi-staged, emphasizing strong fundamentals in Data Structures and Algorithms (DSA), database design, and system design. The process often includes virtual and onsite rounds, with a strong focus on scalability, real-world problem-solving, and managerial fit. Candidates are expected to demonstrate depth in their technical expertise, particularly in backend systems, distributed architectures, and performance optimization.", "by_role": {"SDE-2": "# SDE-2 (3 Candidates)\n\n## Overview\nThe SDE-2 role at Dream11 involves a five-round process, combining technical rigor with managerial and HR assessments. Candidates are evaluated on DSA, database design, system design, and behavioral fit. The process includes both virtual and onsite rounds, with a strong emphasis on real-world problem-solving and scalability.\n\n---\n\n## Round Breakdown\n\n### 1. Technical Round (DSA Focus)\nFormat: 2 LeetCode-style problems in 1 hour.\nTopics Covered:\n- Maps with string keys and lists\n- Binary search implementations\n- String manipulation (e.g., removing digits to form the smallest number)\n\nExact Questions Asked:\n1. Solve a problem involving maps with string keys and lists, requiring binary search implementation.\n2. Given a numeric string and a number k, remove k digits from the string to make the resulting number the smallest possible.\n\nSource: LeetCode Discussion\n\n---\n\n### 2. Technical Round (Database + Resume Deep Dive)\nFormat: Open-ended discussion with a focus on PostgreSQL, reactive stacks, and system design.\nTopics Covered:\n- PostgreSQL (concurrency control, isolation levels, locks, replication, scaling reads/writes)\n- Reactive stack (Netty, R2DBC)\n- Designing a ticket booking system (e.g., BookMyShow)\n\nExact Questions Asked:\n1. Describe a project you are currently working on and the design choices made.\n2. Explain PostgreSQL concurrency control, isolation levels, locks, and replication.\n3. How would you scale PostgreSQL reads and writes?\n4. Explain how Netty and R2DBC work in a reactive stack.\n5. How would you implement a ticket booking system like BookMyShow at scale?\n6. How would you ensure that when a person selects a seat, others cannot see it?\n\nSource: LeetCode Discussion\n\n---\n\n### 3. System Design Round\nFormat: Design an alerting and monitoring system (e.g., Prometheus and Grafana).\nTopics Covered:\n- Defining scope, functional/non-functional requirements, and scale estimation\n- Timeseries data storage and format\n- Consistency vs. availability trade-offs\n- Detecting new pods for metrics scraping\n- Maintaining active web connections for clients\n\nExact Questions Asked:\n1. Design an alerting and monitoring system like Prometheus and Grafana.\n2. Define scope, NFRs, FRs, and estimate scale for the system.\n3. How will timeseries data be stored and in what format?\n4. How will Prometheus server know to start scraping metrics from a new pod?\n5. How will you maintain active web connections with many clients to scrape metrics?\n\nSource: LeetCode Discussion\n\n---\n\n### 4. Managerial Round\nFormat: Scenario-based discussion with a VP (13+ years of experience).\nTopics Covered:\n- Past work experience and problem-solving mindset\n- Handling challenging situations (e.g., IPL traffic spikes)\n- SDLC process and incident/bug resolution\n- Keeping up with new technologies\n\nExact Questions Asked:\n1. How would you prepare your system for IPL given that it is coming?\n2. Explain the SDLC process you follow to develop a feature.\n3. What is the most challenging problem you have solved in Navi? What was your contribution?\n4. How do you keep yourself updated with new technologies?\n5. What is the procedure you follow to solve any incident/bug in your company?\n6. Questions based on the candidate's resume.\n\nSource: LeetCode Discussion\n\n---\n\n### 5. HR Round\nFormat: Personal background and cultural fit discussion with an experienced HR.\nTopics Covered:\n- Personal background, schooling, and college experiences\n- Interest in coding and reasons for job change\n- Future perspectives and goals\n\nExact Questions Asked:\n1. Discuss childhood, schooling, college experiences, and interest in coding.\n2. Reasons for wanting to leave the current company.\n3. Candidate's future perspectives and goals.\n\nSource: LeetCode Discussion\n\n---\n\n## Key Takeaways\n- DSA and System Design are critical for SDE-2 candidates.\n- Database expertise (PostgreSQL, scaling, replication) is heavily tested.\n- Managerial and HR rounds assess cultural fit and long-term potential.\n- Real-world problem-solving (e.g., ticket booking systems) is a recurring theme.", "SDE-1 / New Grad": "# SDE-1 / New Grad (1 Candidate)\n\n## Overview\nThe SDE-1 / New Grad role at Dream11 follows a fast-paced, week-long process with 1-2 days between rounds. The focus is on fundamental DSA skills, problem-solving under pressure, and cultural fit. Candidates are expected to demonstrate a strong grasp of algorithms and data structures, as well as enthusiasm for learning and growth.\n\n---\n\n## Round Breakdown\n\n### 1. Technical Round (DSA Focus)\nFormat: 2 LeetCode-style problems (medium and hard).\nTopics Covered:\n- Graphs (medium-level)\n- Dynamic Programming (hard-level)\n\nExact Questions Asked:\n1. (Medium) Graph traversal problem.\n2. (Hard) Dynamic Programming problem.\n\nSource: LeetCode Discussion\n\n---\n\n### 2. Managerial Round\nFormat: In-depth discussion about the candidate's resume and projects.\nTopics Covered:\n- Project details and learnings\n- Problem-solving approach\n- Teamwork and collaboration\n\nSource: LeetCode Discussion\n\n---\n\n### 3. HR Round\nFormat: Standard HR and culture fit questions.\nTopics Covered:\n- Personal background and motivations\n- Career goals and aspirations\n- Cultural alignment with Dream11\n\nSource: LeetCode Discussion\n\n---\n\n## Key Takeaways\n- DSA is the primary focus for New Grad candidates.\n- Managerial round assesses problem-solving mindset and teamwork.\n- HR round ensures cultural fit and long-term alignment.\n- The process is designed to be fast and efficient, with a decision delivered within a week.", "SDE-3 / Senior": "# SDE-3 / Senior (1 Candidate)\n\n## Overview\nThe SDE-3 / Senior role at Dream11 involves a month-long, multi-stage process with a strong emphasis on system design, database expertise, and leadership. Candidates are expected to demonstrate deep technical knowledge, scalability insights, and the ability to mentor teams. The process includes pre-screening, machine coding, and database rounds.\n\n---\n\n## Round Breakdown\n\n### 1. Pre-Screening Call\nFormat: Half-hour call with the Head of Engineering.\nTopics Covered:\n- Introduction and role expectations\n- High-level fit assessment\n\nSource: LeetCode Discussion\n\n---\n\n### 2. Technical Round (Machine Coding)\nFormat: Design a message broker system from scratch.\nTopics Covered:\n- System design for distributed messaging\n- Scalability and fault tolerance\n\nExact Questions Asked:\n1. Design a message broker system.\n\nSource: LeetCode Discussion\n\n---\n\n### 3. Technical Round (Database Deep Dive)\nFormat: Discussion on databases used in the candidate's projects.\nTopics Covered:\n- Database architecture (e.g., MongoDB, Cassandra)\n- Append-on-file strategies, SSTables, bloom filters, indexing, and replication\n- Scalability and performance optimization\n\nExact Questions Asked:\n1. Explain the database architecture used in your projects.\n2. Implement a database from scratch using EC2 instances (covering MongoDB and Cassandra's architecture).\n\nSource: LeetCode Discussion\n\n---\n\n## Key Takeaways\n- System design and leadership are critical for Senior roles.\n- Database expertise (e.g., Cassandra, MongoDB) is heavily tested.\n- Machine coding rounds assess practical implementation skills.\n- The process is rigorous and time-intensive, reflecting the seniority of the role."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho's hiring process is structured to assess both technical depth and practical problem-solving skills across roles. For mid-level and senior roles (e.g., SDE-2, SDE-3), the process heavily emphasizes machine coding, system design, and real-world scalability challenges. Entry-level roles (SDE-1, Interns) focus on DSA fundamentals, object-oriented design, and conceptual clarity in core CS subjects. Rejections often stem from struggles in implementing edge cases during machine coding rounds or inconsistencies in handling trade-offs during system design discussions.", "by_role": {"SDE-2": "# Meesho SDE-2 Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves three core rounds: a technical screening (DSA focus), a machine coding round (implementation-heavy), and a system design + hiring manager round. Candidates are expected to demonstrate strong problem-solving skills, clean code practices, and scalable design thinking. The machine coding round is a critical differentiator, often deciding the final outcome.\n\n---\n\n## Round Breakdown\n\n### Round 1: Technical Screening (DSA Focus)\nFormat: 1-hour session with 2 coding problems (LeetCode-style).\nPlatform: HackerRank or similar.\nKey Topics:\n- Dynamic Programming (e.g., Knapsack variants, weighted job scheduling)\n- Graph Algorithms (e.g., connected components, BFS/DFS)\n- Tree/Array Manipulations (e.g., Number of Islands, Asteroid Collision)\n- Bit Manipulation and Greedy Algorithms\n\nExample Questions:\n1. Minimum Steps to Reach Target by a Knight\n2. Remove All Adjacent Duplicates in String II\n3. Course Schedule II\n4. Container With Most Water\n5. Asteroid Collision\n6. Matrix Problem: Count connected components of 1s and answer queries about component sizes (similar to Number of Islands).\n\n---\n\n### Round 2: Machine Coding (Implementation & Design)\nFormat: 1.5\u20132-hour round focused on building a functional system from scratch.\nPlatform: HackerRank or live coding with IDE.\nKey Expectations:\n- Write fully functional code with all edge cases handled.\n- Follow OOPs principles and design patterns (e.g., Singleton, Factory).\n- Implement thread safety and concurrency if applicable.\n- Write unit tests or handle test cases efficiently.\n\nExample Problems:\n1. Snake & Ladder Game Design (with custom dice rules, player moves, and win conditions).\n2. Ride-Sharing Application Features (e.g., ride matching, pricing algorithms).\n3. Facebook-like APIs (Create Post, Delete Post, Get Feed, Follow/Unfollow users).\n4. Inventory Management System (e.g., blocking inventory until order confirmation).\n5. N Elevator System (focus on thread handling and OOPs principles).\n\n---\n\n### Round 3: System Design + Hiring Manager\nFormat: 1-hour round combining system design and behavioral/project discussion.\nKey Topics:\n- System Design: Scalability, microservices, database schema, API design.\n- High-Level Design (HLD): Twitter news feed, ranking/review systems.\n- Low-Level Design (LLD): Deep dive into specific components (e.g., OTP system).\n- Behavioral: Project deep dives, trade-off discussions, and team collaboration.\n\nExample Problems:\n1. Design a Ranking and Review System for an e-commerce platform:\n - Requirements: User reviews, ratings, sorting/filtering, like/dislike features.\n - Discuss HLD/LLD, database design, and write getProductList() API.\n - Follow-ups: SQL vs. NoSQL, MongoDB vs. Redis, consistency models.\n2. Design a Twitter News Feed System (focus on fan-out strategies, caching).\n3. Design an OTP System (database schema, API flow, scalability).\n\n---\n\n## Common Pitfalls\n- Machine Coding: Candidates often struggle with time management or edge cases (e.g., inventory blocking logic, thread safety in elevator systems).\n- System Design: Lack of clarity in trade-off discussions (e.g., SQL vs. NoSQL, consistency vs. availability) can lead to rejections.\n- Behavioral: Weak project explanations or inability to justify tech stack choices raises red flags.\n\n---\n\n## Preparation Tips\n- Machine Coding: Practice OOPs design patterns and clean code principles. Use platforms like CodeSignal or Pramp for mock interviews.\n- System Design: Study scalability patterns (e.g., sharding, caching) and real-world systems (e.g., Uber, Twitter).\n- DSA: Focus on LeetCode Medium/Hard problems, especially in DP, Graphs, and Trees.\n\n---\n\n## Resources\n- Machine Coding Practice: Low-Level Design Problems\n- System Design: Grokking the System Design Interview\n- DSA: LeetCode Top Interview Questions", "SDE-1 / New Grad": "# Meesho SDE-1 / New Grad Interview Briefing\n\n## Overview\nThe SDE-1 role at Meesho is designed for entry-level engineers and typically involves 4 rounds: an Online Assessment (OA), two technical interviews, and an HR/technical round. The process emphasizes DSA fundamentals, object-oriented design, and problem-solving under constraints. Candidates are expected to demonstrate clean code practices and conceptual clarity in core CS subjects (e.g., OS, DBMS, Networks).\n\n---\n\n## Round Breakdown\n\n### Round 1: Online Assessment (OA)\nFormat: 75\u201390 minutes, conducted on platforms like HackerRank or NextLevel.\nComponents:\n1. Coding Problems (2\u20134): Mix of easy, medium, and hard LeetCode-style questions.\n2. MCQs (5\u201325): Based on DSA, OS, DBMS, Computer Networks, and OOPs.\n\nKey Topics:\n- DSA: Arrays, Strings, Trees, Graphs, Dynamic Programming (e.g., LIS, Knapsack).\n- Core CS: OS (semaphores vs. mutex), DBMS (SQL vs. NoSQL, ACID), Networks (OSI model, DNS).\n\nExample Questions:\n#### Coding Problems\n1. Easy:\n - Find common elements in two arrays.\n - Reverse a string with character substitutions (e.g., A<->G, C<->T).\n2. Medium:\n - Weighted Job Scheduling (optimized with binary search).\n - Activity Selection Problem.\n - Water the Plants (greedy approach).\n3. Hard:\n - Minimum Degree of a Connected Trio in a Graph.\n - Rectangle Area II (loose constraints).\n - Combinatorial problems (e.g., factorial/power calculations with edge cases).\n\n#### MCQs\n- Operating Systems: Semaphores vs. mutex, paging, virtual vs. physical memory.\n- DBMS: SQL vs. NoSQL, normalization, ACID properties.\n- Computer Networks: ARP, DNS, OSI model.\n- OOPs: Singleton class, StringBuilder vs. StringBuffer, vector implementations.\n\n---\n\n### Round 2: Technical Interview 1 (DSA Focus)\nFormat: 1\u20131.5-hour session on HackerRank CodePair or similar.\nKey Topics:\n- Greedy Algorithms (e.g., activity selection, watering plants).\n- Data Structures (e.g., BST, Linked Lists, Stacks).\n- Problem-Solving: Ability to optimize brute-force solutions.\n\nExample Questions:\n1. Greedy:\n - Activity Selection Problem.\n - Stock price optimization (max profit with O(n) complexity).\n2. Data Structures:\n - Pair of nodes equal to a given sum (BST).\n - Kth node from the last (Linked List).\n - Add two numbers represented by linked lists (Stacks).\n\n---\n\n### Round 3: Technical Interview 2 (System Design + Core CS)\nFormat: 1-hour session focusing on projects, core CS concepts, and optimizations.\nKey Topics:\n- System Design: OOPs design (e.g., cab booking system).\n- Core CS: OS, DBMS, Networks (deep dives into concepts).\n- Projects: Tech stack choices, trade-offs, and optimizations.\n\nExample Questions:\n1. System Design:\n - Design a cab booking system and implement 10+ functions using OOPs principles.\n2. Core CS:\n - Explain semaphores vs. mutex, paging, virtual memory.\n - Discuss SQL vs. NoSQL, normalization, ACID properties.\n - Inner implementation of vectors in C++ (complexities for insert/delete/read).\n3. Projects:\n - Deep dive into resume projects: tech stack choices, alternatives, optimizations.\n\n---\n\n### Round 4: HR/Technical Round\nFormat: 1-hour session combining HR questions and technical deep dives.\nKey Topics:\n- Project Discussions: Detailed explanations of work done.\n- Real-World Scenarios: E.g., handling sales with limited inventory.\n- Behavioral: Situational questions (e.g., restarting a flawed project).\n\nExample Questions:\n1. Optimization:\n - Optimize solutions from the OA (e.g., reduce time complexity).\n2. Scenario-Based:\n - How would you ensure exactly x purchases during a sale with y users demanding the product?\n3. Behavioral:\n - How would you handle a project where your approach is deemed wrong after 3\u20134 days?\n\n---\n\n## Common Pitfalls\n- OA: Failing to solve 2+ coding questions or scoring poorly in MCQs (e.g., <58% in combinatorial problems).\n- DSA Rounds: Struggling with greedy algorithms or data structure manipulations (e.g., linked lists, stacks).\n- System Design: Weak OOPs implementation or inability to explain project trade-offs.\n- HR Round: Lack of clarity in behavioral responses or project explanations.\n\n---\n\n## Preparation Tips\n- OA: Practice LeetCode Easy/Medium problems and core CS MCQs (focus on OS/DBMS/Networks).\n- DSA Rounds: Master Greedy Algorithms, Tree/Graph Traversals, and Linked List Manipulations.\n- System Design: Understand OOPs principles and design patterns (e.g., Singleton, Factory).\n- Core CS: Revise OS, DBMS, Networks from standard textbooks (e.g., Operating System Concepts by Silberschatz).\n\n---\n\n## Resources\n- DSA Practice: LeetCode Top 100, GeeksforGeeks DSA\n- Core CS: Operating Systems, Database System Concepts\n- System Design: OOPs Design Patterns\n- Mock Interviews: Pramp, Interviewing.io", "Intern": "# Meesho Intern Interview Briefing\n\n## Overview\nThe Intern role at Meesho is highly competitive, with over 100,000 applicants vying for a few spots. The process includes 4 rigorous rounds: an online assessment, a coding test, a low-level design round, and a hiring manager round. Candidates are evaluated on DSA skills, design acumen, and problem-solving under constraints. The bar is set exceptionally high, with a focus on clean code and scalable solutions.\n\n---\n\n## Round Breakdown\n\n### Round 1: Online Assessment (OA)\nFormat: 30\u2013105 minutes, conducted on platforms like NextLevel or HackerRank.\nComponents:\n1. MCQs (20\u201330): Core CS subjects (OS, DBMS, Networks, DSA).\n2. Coding Problems (2\u20133): Medium to hard LeetCode-style questions.\n\nKey Topics:\n- DSA: Binary Search, Dynamic Programming, Segment Trees.\n- Core CS: Operating Systems, DBMS, Computer Networks.\n\nExample Questions:\n#### MCQs\n- Operating Systems: Process scheduling, memory management.\n- DBMS: SQL queries, normalization.\n- Computer Networks: OSI model, DNS, ARP.\n- DSA: Time/space complexity, sorting algorithms.\n\n#### Coding Problems\n1. Binary Search: Standard problems with edge cases.\n2. Dynamic Programming: LIS (Longest Increasing Subsequence) variants.\n3. Segment Tree: Range queries, updates.\n4. Graph Algorithms: BFS/DFS traversals, connected components.\n\n---\n\n### Round 2: Coding Test\nFormat: 90\u2013105 minutes on HackerRank.\nComponents: 2\u20133 coding problems with hidden test cases.\n\nKey Topics:\n- DSA: Trees, Graphs, Greedy Algorithms.\n- Problem-Solving: Ability to handle constraints (e.g., time/space limits).\n\nExample Questions:\n1. Trees: BST manipulations, traversals.\n2. Graphs: Connected components, shortest path.\n3. Greedy: Activity selection, interval scheduling.\n\n---\n\n### Round 3: Low-Level Design (LLD)\nFormat: 90-minute virtual interview.\nFocus: Implementing a functional system with SOLID principles and design patterns.\n\nExample Problem:\n- Inventory Management System:\n - Functions: addProduct(), createOrder(), confirmOrder(), getInventory().\n - Constraints: Inventory blocking until order confirmation.\n - Expectations: Thread safety, OOPs principles, clean code.\n\n---\n\n### Round 4: Hiring Manager Round\nFormat: 45-minute interview.\nFocus: Situational questions, project deep dives, and system design (e.g., chat application).\n\nExample Questions:\n1. Behavioral:\n - How would you handle a project with a flawed approach after 3\u20134 days?\n2. System Design:\n - Design a chat application: Database schema, APIs, application flow.\n3. Core CS:\n - Deep dive into projects: Tech stack choices, trade-offs, optimizations.\n\n---\n\n## Common Pitfalls\n- OA: Scoring poorly in MCQs or failing to solve 2+ coding problems.\n- Coding Test: Struggling with hidden test cases or time constraints.\n- LLD: Weak OOPs implementation or inability to handle thread safety.\n- Hiring Manager Round: Lack of clarity in project explanations or behavioral responses.\n\n---\n\n## Preparation Tips\n- OA: Practice core CS MCQs (OS/DBMS/Networks) and LeetCode Medium problems.\n- Coding Test: Focus on BST, Graphs, and Greedy Algorithms.\n- LLD: Study design patterns (e.g., Singleton, Factory) and SOLID principles.\n- System Design: Practice OOPs-based designs (e.g., chat apps, inventory systems).\n\n---\n\n## Resources\n- DSA Practice: LeetCode Explore, GeeksforGeeks DSA\n- Core CS: Operating Systems, Database System Concepts\n- Design Patterns: Refactoring Guru\n- Mock Interviews: Pramp", "SDE-3 / Senior": "# Meesho SDE-3 / Senior Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho targets experienced engineers (4+ years) and emphasizes leadership in system design, scalable architectures, and hands-on coding. The process includes 5+ rounds with a focus on machine coding, distributed systems, and strategic trade-offs. Candidates are expected to demonstrate deep technical expertise, mentorship potential, and business acumen in designing real-world systems.\n\n---\n\n## Round Breakdown\n\n### Round 1: Machine Coding (Core Focus)\nFormat: 2-hour round on HackerRank or live coding with IDE.\nFocus: Implementing a scalable, thread-safe system with clean code and edge-case handling.\n\nExample Problem:\n- N Elevator System:\n - Requirements: Handle multiple elevators, thread safety, OOPs principles.\n - Expectations: Efficient algorithms for elevator scheduling, state management.\n\n---\n\n### Round 2: Design Round (System Design Focus)\nFormat: 1.5-hour round.\nFocus: Designing a scalable, distributed system with a focus on microservices and trade-offs.\n\nExample Problem:\n- Custom Ad Service:\n - Requirements: Scalability, microservices architecture, real-time bidding.\n - Expectations: Discuss HLD, database design, APIs, and scalability patterns.\n\n---\n\n### Round 3: Bar Raiser Round\nFormat: 1-hour round.\nFocus: Deep dive into weaker areas from previous rounds, including distributed systems and algorithms.\n\nExample Topics:\n- Distributed Systems: Consistency models, CAP theorem, sharding strategies.\n- Algorithms: Scenario-based questions (e.g., designing a distributed cache).\n\n---\n\n### Round 4: Technical Round (Projects + Design Decisions)\nFormat: 1-hour round.\nFocus: Discussion on personal projects, design decisions, and trade-offs.\n\nExample Questions:\n1. Explain the design choices in your projects (e.g., tech stack, architecture).\n2. How would you optimize a given system for scalability or cost?\n\n---\n\n### Round 5: Non-Technical (HR + Hiring Manager)\nFormat: 1-hour round.\nFocus: Behavioral questions, scenarios, and cultural fit.\n\nExample Questions:\n1. Discuss principles and values that guide your work.\n2. How would you handle a conflict in a team project?\n\n---\n\n## Common Pitfalls\n- Machine Coding: Struggling with thread safety or scalability in system design.\n- System Design: Lack of trade-off discussions (e.g., consistency vs. availability).\n- Bar Raiser: Inability to explain distributed systems concepts clearly.\n- HR Round: Weak behavioral responses or cultural fit.\n\n---\n\n## Preparation Tips\n- Machine Coding: Practice thread-safe designs and scalable algorithms.\n- System Design: Study distributed systems (e.g., Designing Data-Intensive Applications).\n- Bar Raiser: Revise CAP theorem, sharding, and consistency models.\n- Behavioral: Prepare STAR method responses for leadership and conflict resolution.\n\n---\n\n## Resources\n- Machine Coding: Awesome Low-Level Design\n- System Design: Grokking the System Design Interview\n- Distributed Systems: Designing Data-Intensive Applications\n- Behavioral: Educative\u2019s Behavioral Interview Guide"}}

Migrated to JSONB

{"overview": "Meesho's hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, system design, and practical implementation. For mid-level roles like SDE-2 and SDE-3, the process includes multiple technical rounds (e.g., machine coding, system design, and hiring manager discussions) alongside behavioral and project-specific questions. Junior roles (SDE-1 and Interns) often begin with an online assessment (OA) featuring coding, MCQs, and system design components, followed by technical and HR rounds. The process is designed to assess both technical depth and real-world application, with a focus on scalability, concurrency, and design patterns.", "by_role": {"SDE-2": "# SDE-2 Role Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves three to four rounds, including technical screening, machine coding, system design, and a hiring manager round. The process emphasizes problem-solving in DSA, practical implementation in machine coding, and scalability in system design. Candidates are expected to demonstrate proficiency in object-oriented design, concurrency, and real-world problem decomposition. The machine coding round is particularly critical, often involving design patterns and thread-safe implementations.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Technical Screening (DSA Focus)\nFormat: 1-hour round with 2 coding questions.\nPlatform: HackerRank or similar coding platforms.\nTopics: Dynamic Programming, Graphs, Trees, and String Manipulation.\n\n#### Exact Questions Asked:\n1. Minimum Steps to Reach Target by a Knight (Coding Ninjas)\n - Problem: Find the minimum number of steps a knight takes to reach a target position on a chessboard.\n - Source: LeetCode Discussion\n\n2. Remove All Adjacent Duplicates in String II (LeetCode)\n - Problem: Remove adjacent duplicate characters in a string, reducing the string by k characters at a time.\n - Source: LeetCode Discussion\n\n3. Asteroid Collision (LeetCode)\n - Problem: Simulate the collision of asteroids in a row, where asteroids moving right collide with those moving left.\n - Source: LeetCode Discussion\n\n4. Connected Components in a Matrix (Similar to Number of Islands)\n - Problem: Given a matrix of 0s and 1s, count the number of 1s in connected components and answer queries about the frequency of specific counts.\n - Source: LeetCode Discussion\n\n5. Course Schedule II (LeetCode)\n - Problem: Return the order of courses to take to finish all courses given their prerequisites.\n - Source: LeetCode Discussion\n\n6. Container with Most Water (LeetCode)\n - Problem: Find two lines that form a container with the most water.\n - Source: LeetCode Discussion\n\n---\n\n### 2. Machine Coding Round\nFormat: 1.5 to 2-hour round focused on designing and implementing a functional system.\nPlatform: HackerRank or similar.\nEmphasis: Design patterns, OOPs, concurrency, and test case coverage.\n\n#### Exact Questions Asked:\n1. Snake & Ladder Game Design\n - Problem: Design a Snake & Ladder game with functionalities like dice rolling, snake and ladder jumps, and player movement.\n - Source: LeetCode Discussion\n\n2. Ride-Sharing Application Features\n - Problem: Implement two main features for a ride-sharing app (e.g., ride booking and driver assignment).\n - Source: GeeksforGeeks\n\n3. Facebook API Design\n - Problem: Design APIs for Facebook-like functionalities (e.g., create post, delete post, get feed, follow/unfollow users).\n - Source: LeetCode Discussion\n\n---\n\n### 3. System Design Round\nFormat: 1 to 1.5-hour round focused on high-level and low-level design.\nTopics: Scalability, microservices, database design, and API design.\n\n#### Exact Questions Asked:\n1. Twitter News Feed Design\n - Problem: Design a system to generate a news feed for Twitter users, including ranking and relevance.\n - Source: LeetCode Discussion\n\n2. Ranking and Review System for E-Commerce\n - Problem: Design a system for product reviews, ratings, sorting, filtering, and handling likes/dislikes.\n - Follow-up: Discuss SQL vs. NoSQL, MongoDB vs. Redis, and consistency models.\n - Source: LeetCode Discussion\n\n---\n\n### 4. Hiring Manager Round\nFormat: 1-hour round focused on project discussions and behavioral questions.\nTopics: Project deep dives, problem-solving approaches, and cultural fit.\n\n#### Exact Questions Asked:\n1. Project Discussion\n - Problem: Explain your projects, tech stack choices, and problem-solving approaches.\n - Source: LeetCode Discussion\n\n2. Behavioral Questions\n - Problem: Discuss scenarios like handling conflicts, project failures, and team collaborations.\n - Source: LeetCode Discussion\n\n---\n\n## Key Takeaways\n- Machine coding is a make-or-break round: Focus on clean, modular, and well-tested code.\n- System design requires scalability thinking: Practice designing systems like Twitter feeds or e-commerce review systems.\n- DSA remains critical: Expect medium to hard-level problems in graphs, trees, and dynamic programming.\n- Behavioral rounds assess culture fit: Be prepared to discuss your projects and past experiences in detail.", "SDE-1 / New Grad": "# SDE-1 / New Grad Role Structured Interview Briefing\n\n## Overview\nThe SDE-1 (New Grad) role at Meesho is designed to identify candidates with strong foundational knowledge in DSA, system design, and problem-solving. The process typically includes an Online Assessment (OA), followed by two to three technical rounds and an HR round. The OA often features a mix of coding questions, MCQs, and SQL queries, while the technical rounds focus on greedy algorithms, graph theory, and object-oriented design. Candidates are expected to demonstrate clarity in thought, clean code implementation, and understanding of real-world systems.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nFormat: 75 to 90 minutes, featuring coding questions and MCQs.\nPlatform: HackerRank, NextLevel, or similar.\nTopics: DSA, MCQs (OS, CN, DBMS, OOPs), and SQL queries.\n\n#### Exact Questions Asked:\n1. Coding Questions\n - Weighted Job Scheduling (Solved using Dynamic Programming and optimized with binary search to avoid TLE)\n - Source: GeeksforGeeks\n - Activity Selection Problem (Greedy Algorithm)\n - Source: GeeksforGeeks\n - Watering Plants (Greedy Approach)\n - Source: GeeksforGeeks\n - Minimum Degree of a Connected Trio in a Graph (LeetCode)\n - Source: LeetCode Discussion\n - Rectangle Area II (LeetCode)\n - Source: LeetCode Discussion\n - Dynamic Programming Problem (LeetCode Hard)\n - Source: LeetCode Discussion\n\n2. MCQs\n - Topics: Operating Systems, Computer Networks, C/C++ output questions, Java, DBMS, and OOPs.\n - Source: GeeksforGeeks\n\n3. SQL Queries\n - Topics: ROW_NUMBER(), RANK(), DENSE_RANK(), subqueries, and WITH clauses.\n - Source: GeeksforGeeks\n\n---\n\n### 2. Technical Rounds\nFormat: 1 to 1.5-hour rounds focused on DSA, system design, and OOPs.\nPlatform: HackerRank CodePair or similar.\n\n#### Exact Questions Asked:\n1. Greedy Algorithms\n - Problem: Activity Selection Problem\n - Source: GeeksforGeeks\n\n2. Graph Theory\n - Problem: Number of Islands (Extension)\n - Source: GeeksforGeeks\n\n3. Dynamic Programming\n - Problem: Count arrays of size n with values 1 to n where each element follows specific divisibility rules.\n - Source: GeeksforGeeks\n\n4. System Design\n - Problem: Design a cab booking system and implement 10+ functions using OOP concepts.\n - Source: GeeksforGeeks\n\n---\n\n### 3. HR/Technical Round\nFormat: 1-hour round focused on project deep dives, optimization, and real-world scenarios.\nTopics: Project discussions, tech stack choices, and situational questions.\n\n#### Exact Questions Asked:\n1. Project Deep Dive\n - Problem: Explain the tech stack used in your projects and why you chose it over alternatives.\n - Source: GeeksforGeeks\n\n2. Real-World Scenarios\n - Problem: How would you ensure exactly x purchases occur during a sale when y people want the product, ensuring no two people get the same product?\n - Source: GeeksforGeeks\n\n3. Situational Questions\n - Problem: How would you handle a project that needs to be restarted after 3-4 days due to a flawed approach?\n - Source: GeeksforGeeks\n\n---\n\n## Key Takeaways\n- OA is the first hurdle: Focus on solving 2+ coding questions and 70%+ MCQs to qualify for technical rounds.\n- Technical rounds test depth: Expect questions on greedy algorithms, graph theory, and system design.\n- HR rounds assess practical thinking: Be prepared to discuss projects, optimization, and real-world scenarios.\n- Practice on HackerRank: Most rounds are conducted on this platform, so familiarity is crucial.", "Intern": "# Intern Role Structured Interview Briefing\n\n## Overview\nThe Intern role at Meesho is highly competitive, with a selection rate of less than 0.1% from over 100,000 applicants. The process begins with a technical screening (coding and MCQs) and progresses to low-level design, system design, and hiring manager rounds. Candidates are evaluated on their problem-solving skills, design acumen, and ability to handle pressure. The machine coding round is particularly challenging, often involving real-time constraints and scalability considerations.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nFormat: 30 to 105 minutes, featuring coding questions and MCQs.\nPlatform: NextLevel, HackerRank, or similar.\nTopics: DSA, OS, CN, DBMS, and verbal reasoning.\n\n#### Exact Questions Asked:\n1. Multiple-Choice Questions (MCQs)\n - Topics: Operating Systems, Data Structures and Algorithms (DSA), Networking, and Error Handling.\n - Source: GeeksforGeeks\n\n2. Coding Questions\n - Binary Search (Medium to Hard)\n - Source: GeeksforGeeks\n - Dynamic Programming (e.g., LIS revisited)\n - Source: GeeksforGeeks\n - Segment Tree (Advanced Data Structure)\n - Source: GeeksforGeeks\n\n---\n\n### 2. Low-Level Design Round\nFormat: 90-minute round focused on designing a functional system.\nTopics: SOLID principles, design patterns, and OOPs.\n\n#### Exact Questions Asked:\n1. Inventory Management System\n - Problem: Design an inventory management system with functionalities like adding products, creating orders, and blocking inventory until order confirmation.\n - Source: GeeksforGeeks\n\n---\n\n### 3. Hiring Manager Round\nFormat: 45-minute round focused on situational questions and project discussions.\nTopics: Project deep dives, behavioral questions, and system design.\n\n#### Exact Questions Asked:\n1. System Design\n - Problem: Design a chat application, including database schema, APIs, and application flow.\n - Source: GeeksforGeeks\n\n---\n\n## Key Takeaways\n- OA is the gatekeeper: Focus on solving 2+ coding questions and 70%+ MCQs to qualify for technical rounds.\n- Low-level design tests practical skills: Practice designing systems like inventory management or chat applications.\n- Hiring manager rounds assess fit: Be prepared to discuss projects, problem-solving approaches, and cultural alignment.\n- Competition is fierce: Only the top 0.1% of candidates are selected, so preparation is key.", "SDE-3 / Senior": "# SDE-3 / Senior Role Structured Interview Briefing\n\n## Overview\nThe SDE-3 (Senior) role at Meesho is tailored for experienced engineers with 4+ years of experience and a proven track record in system design, scalability, and leadership. The process includes multiple machine coding rounds, system design discussions, and bar raiser rounds to assess both technical depth and leadership potential. Candidates are expected to demonstrate expertise in distributed systems, concurrency, microservices, and real-world problem-solving.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Machine Coding Round\nFormat: 2-hour round focused on implementing a complex system.\nPlatform: HackerRank or similar.\nTopics: Concurrency, OOPs, design patterns, and thread safety.\n\n#### Exact Questions Asked:\n1. N Elevator System\n - Problem: Design an N Elevator system with emphasis on handling threads, OOPs principles, and scalability.\n - Source: LeetCode Discussion\n\n2. Inventory/Order Management Service\n - Problem: Design a service for inventory and order management, including concurrent user handling and thread safety.\n - Source: LeetCode Discussion\n\n---\n\n### 2. System Design Round\nFormat: 1.5-hour round focused on designing scalable systems.\nTopics: Microservices, distributed systems, and API design.\n\n#### Exact Questions Asked:\n1. Trading Platform\n - Problem: Design a system similar to a trading platform with a slightly different use case.\n - Source: LeetCode Discussion\n\n2. Custom Ad Service\n - Problem: Design a custom ad service with emphasis on scalability and microservices architecture.\n - Source: LeetCode Discussion\n\n---\n\n### 3. Bar Raiser Round\nFormat: 1-hour round focused on weaker areas and scenario-based questions.\nTopics: Distributed systems, algorithms, and leadership principles.\n\n#### Exact Questions Asked:\n1. Distributed Systems Design\n - Problem: Discuss distributed systems design, including scalability, fault tolerance, and consistency models.\n - Source: LeetCode Discussion\n\n2. Scenario-Based Questions\n - Problem: Handle scenarios like system failures, high traffic loads, and team collaborations.\n - Source: LeetCode Discussion\n\n---\n\n### 4. Non-Technical Round\nFormat: 1-hour round focused on personal projects, principles, and values.\nTopics: Project deep dives, behavioral questions, and cultural fit.\n\n#### Exact Questions Asked:\n1. Personal Projects and Design Decisions\n - Problem: Discuss your personal projects, design decisions, and problem-solving approaches.\n - Source: LeetCode Discussion\n\n---\n\n## Key Takeaways\n- Machine coding is critical: Focus on clean, modular, and thread-safe implementations.\n- System design requires scalability thinking: Practice designing systems like trading platforms or ad services.\n- Bar raiser rounds assess depth: Be prepared to discuss distributed systems, algorithms, and leadership.\n- Non-technical rounds evaluate fit: Highlight your projects, principles, and alignment with Meesho's culture.", "Other": "# Other Role Structured Interview Briefing\n\n## Overview\nThe 'Other' role category at Meesho includes off-campus and non-standard roles, often involving a mix of technical assessments, system design, and project discussions. The process is less standardized but typically includes coding rounds, system design, and HR discussions. Candidates are evaluated on their problem-solving skills, design acumen, and ability to handle real-world scenarios.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Coding Assessment\nFormat: 1-hour round focused on DSA and problem-solving.\nTopics: Dynamic Programming, Graphs, and Disjoint Set Union (DSU).\n\n#### Exact Questions Asked:\n1. Dynamic Programming\n - Problem: Standard DP questions (exact problem not specified).\n - Source: GeeksforGeeks\n\n2. Graphs and DSU\n - Problem: Questions involving graph traversal and DSU (exact problem not specified).\n - Source: GeeksforGeeks\n\n---\n\n### 2. System Design Round\nFormat: 1.5-hour round focused on low-level and high-level design.\nTopics: Scalability, microservices, and API design.\n\n#### Exact Questions Asked:\n1. Uber-like System Design\n - Problem: Design a low-level system similar to Uber, including database schema, APIs, and scalability considerations.\n - Source: GeeksforGeeks\n\n---\n\n### 3. Project Discussion and HR Round\nFormat: 1-hour round focused on project verification and behavioral questions.\nTopics: Project deep dives, behavioral questions, and cultural fit.\n\n#### Exact Questions Asked:\n1. Project Verification\n - Problem: Discuss your projects in detail, including tech stack, problem-solving approaches, and originality.\n - Source: GeeksforGeeks\n\n2. Behavioral Questions\n - Problem: Discuss scenarios like handling conflicts, project failures, and team collaborations.\n - Source: GeeksforGeeks\n\n---\n\n## Key Takeaways\n- Coding rounds test depth: Focus on DP, graphs, and DSU.\n- System design assesses scalability: Practice designing Uber-like systems.\n- Project discussions are critical: Be prepared to justify your projects and design choices.\n- HR rounds evaluate fit: Highlight your alignment with Meesho's culture and values."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho's hiring process is highly structured, with a strong emphasis on problem-solving, system design, and practical implementation. For mid-level and senior roles, the process typically includes multiple technical rounds (e.g., DSA, machine coding, and system design), while interns and new grads face rigorous online assessments followed by technical and HR rounds. The company values depth in algorithms, scalability considerations, and hands-on coding skills, with a notable focus on real-world problem-solving and behavioral assessments.", "by_role": {"SDE-2": "# SDE-2 - Role-Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves 3-4 rounds, including a Problem Solving and Data Structures (PS-DS) round, a Machine Coding round, and a System Design + Hiring Manager round. Candidates are expected to demonstrate strong problem-solving skills, proficiency in algorithms, and the ability to design scalable systems. The process is rigorous, with a focus on practical implementation and real-world problem-solving.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Problem Solving and Data Structures (PS-DS) Round\nDuration: 1 hour\nFocus: DSA problems (LeetCode Medium-Hard)\nPlatform: HackerRank, LeetCode, or similar\n\nKey Questions Asked:\n- Minimum Steps to Reach Target by a Knight\n- Remove All Adjacent Duplicates in String II\n- Course Schedule II\n- Container With Most Water\n- Asteroid Collision\n- Number of Islands (Matrix Problem)\n\nTopics Covered:\n- Graph traversal (BFS/DFS)\n- Dynamic Programming\n- Greedy Algorithms\n- String manipulation\n\n---\n\n### 2. Machine Coding Round\nDuration: 1.5\u20132 hours\nFocus: Design and implement a small-scale system\nPlatform: HackerRank or similar\n\nKey Questions Asked:\n- Design and implement a Snake & Ladder game.\n- Build a ride-sharing application with specific features (e.g., ride matching, pricing).\n- Implement a Facebook-like API system (e.g., Create Post, Delete Post, Get Feed, Follow/Unfollow).\n- Design an inventory management system for an e-commerce platform.\n\nTopics Covered:\n- Object-Oriented Design (OOP principles)\n- Concurrency and thread safety\n- API design and pagination\n- Database schema design (SQL/NoSQL considerations)\n\n---\n\n### 3. System Design Round\nDuration: 1\u20131.5 hours\nFocus: High-Level and Low-Level Design\nPlatform: Virtual whiteboard or document\n\nKey Questions Asked:\n- Design a Twitter-like news feed system (HLD).\n- Design a rating and review system for an e-commerce website (HLD + LLD).\n- Discuss trading platform design (scalability and microservices).\n- Design a rule engine system for scheduling and executing rules.\n\nTopics Covered:\n- Scalability and load balancing\n- Database design (SQL vs. NoSQL)\n- Caching strategies (Redis, Memcached)\n- Consistency models (strong vs. eventual consistency)\n\n---\n\n### 4. Hiring Manager Round\nDuration: 1 hour\nFocus: Project discussion, behavioral questions, and cultural fit\nPlatform: Virtual meeting (e.g., Google Meet)\n\nKey Topics Covered:\n- Deep dive into projects (tech stack, challenges, optimizations)\n- Behavioral scenarios (e.g., handling project pivots, teamwork)\n- Problem-solving approach and decision-making\n\n---\n\n## Preparation Tips\n- Practice DSA: Focus on LeetCode Medium-Hard problems, especially in Graphs, Dynamic Programming, and String Manipulation.\n- Machine Coding: Build small-scale systems (e.g., APIs, games) and practice writing clean, modular code.\n- System Design: Study scalable architectures (e.g., Twitter, Uber) and practice designing systems from scratch.\n- Behavioral: Prepare for project deep dives and scenario-based questions.\n\n---\n\n## Common Rejection Reasons\n- Struggling with time management in machine coding rounds.\n- Lack of depth in system design (e.g., not considering scalability or failure cases).\n- Poor problem-solving approach (e.g., not discussing trade-offs).\n\n---\n\n## Resources\n- LeetCode\n- GeeksforGeeks\n- System Design Primer (GitHub)", "SDE-1 / New Grad": "# SDE-1 / New Grad - Role-Structured Interview Briefing\n\n## Overview\nThe SDE-1 role at Meesho is designed for entry-level candidates and typically involves 4-5 rounds, including an Online Assessment (OA), Technical Interviews, Machine Coding, and HR Rounds. The process is highly competitive, with a strong emphasis on problem-solving, coding proficiency, and system design fundamentals. Candidates are expected to demonstrate a solid grasp of DSA, OOP, and basic system design concepts.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Online Assessment (OA)\nDuration: 75\u2013100 minutes\nFocus: DSA problems and MCQs\nPlatform: HackerRank or similar\n\nKey Questions Asked:\n- Coding Problems:\n - Weighted Job Scheduling (Dynamic Programming + Binary Search)\n - Activity Selection Problem (Greedy Algorithm)\n - Water the Plants (Greedy Approach)\n - Minimum Degree of a Connected Trio in a Graph\n - Rectangle Area II\n - Longest Substring with At Least K Repeating Characters (Variation)\n - Making a Large Island\n - Chocolate Distribution Problem\n - LIS Revisited\n - Graph Colouring\n\n- MCQs:\n - Operating Systems (e.g., semaphores vs. mutex, paging)\n - Computer Networks (e.g., ARP, DNS, OSI model)\n - DBMS (e.g., SQL vs. NoSQL, Normalization, ACID properties)\n - Programming (e.g., C++/Java output questions, OOP concepts)\n\nTopics Covered:\n- Greedy Algorithms\n- Dynamic Programming\n- Graph Theory\n- String and Array Manipulation\n- Basic System Design (e.g., OOP, APIs)\n\n---\n\n### 2. Technical Interviews (2 Rounds)\nDuration: 1\u20131.5 hours per round\nFocus: DSA, OOP, and conceptual topics\nPlatform: HackerRank CodePair or similar\n\nKey Questions Asked:\n- Round 1:\n - Number of Islands (Variation)\n - Count Arrays with Specific Rules\n - BST, Linked List, and Stack problems (e.g., Pair of Nodes Equal to Given Sum)\n\n- Round 2:\n - SQL queries (e.g., ROW_NUMBER(), RANK(), DENSE_RANK())\n - Database design (e.g., normalization, ACID properties)\n - OOP concepts (e.g., Singleton class, String builder/buffer)\n - Projects deep dive (tech stack, alternatives, use cases)\n\nTopics Covered:\n- Data Structures (BST, Linked List, Stack, Queue)\n- Algorithms (BFS, DFS, Greedy, DP)\n- SQL and Database Design\n- OOP Principles\n- Operating Systems and Computer Networks\n\n---\n\n### 3. Machine Coding Round\nDuration: 1\u20132 hours\nFocus: Design and implement a small-scale system\nPlatform: HackerRank or similar\n\nKey Questions Asked:\n- Design a cab booking system (OOP + 10 basic functions).\n- Implement a social media system (e.g., Create Post, Delete Post, Get Feed, Follow/Unfollow).\n- Design an inventory management system for an e-commerce platform.\n\nTopics Covered:\n- OOP Design (e.g., SOLID principles)\n- API design and pagination\n- Concurrency and thread safety (for scalability)\n- Database schema design (SQL/NoSQL considerations)\n\n---\n\n### 4. System Design Round (Optional for Some Candidates)\nDuration: 1 hour\nFocus: Basic system design concepts\nPlatform: Virtual whiteboard\n\nKey Questions Asked:\n- Design a basic OTP system.\n- Design a chat application (database schema, APIs, application flow).\n\nTopics Covered:\n- High-Level Design (HLD)\n- Low-Level Design (LLD)\n- Scalability considerations\n\n---\n\n### 5. HR Round\nDuration: 1 hour\nFocus: Behavioral questions and cultural fit\nPlatform: Virtual meeting\n\nKey Topics Covered:\n- Project deep dives and optimizations\n- Real-world scenario questions (e.g., handling sales with limited inventory)\n- Situational questions (e.g., handling project pivots)\n\n---\n\n## Preparation Tips\n- Practice DSA: Focus on LeetCode Easy-Medium problems, especially in Greedy, DP, and Graph Theory.\n- Machine Coding: Build small-scale systems (e.g., APIs, games) and practice writing clean, modular code.\n- System Design: Study basic architectures (e.g., OTP systems, chat apps) and practice designing systems.\n- Behavioral: Prepare for project deep dives and scenario-based questions.\n\n---\n\n## Common Rejection Reasons\n- Struggling with time management in coding rounds.\n- Lack of depth in problem-solving (e.g., not discussing trade-offs).\n- Poor OOP design in machine coding rounds.\n\n---\n\n## Resources\n- LeetCode\n- GeeksforGeeks\n- System Design Primer (GitHub)", "Intern": "# Intern - Role-Structured Interview Briefing\n\n## Overview\nThe Intern role at Meesho is highly competitive, with a multi-stage process that includes online assessments, coding tests, low-level design rounds, and hiring manager interviews. Candidates are expected to demonstrate problem-solving skills, basic system design knowledge, and proficiency in DSA and OOP concepts. The process is rigorous, with a strong emphasis on practical implementation and real-world scenarios.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Online Assessment (OA) - NextLevel Screening Test\nDuration: 30 minutes\nFocus: MCQs on CS fundamentals\nPlatform: NextLevel mobile app\n\nKey Topics Covered:\n- Operating Systems\n- Data Structures and Algorithms (DSA)\n- Networking\n- Error Handling\n\n---\n\n### 2. Coding Test\nDuration: 105 minutes\nFocus: DSA problems (Medium-Hard)\nPlatform: HackerRank\n\nKey Questions Asked:\n- Binary Search\n- Dynamic Programming (DP)\n- Segment Tree\n\nExample Problems:\n- Binary Search Variations\n- DP Problems\n\n---\n\n### 3. Low-Level Design (LLD) Round\nDuration: 90 minutes\nFocus: Design and implement a small-scale system\nPlatform: Virtual interview\n\nKey Questions Asked:\n- Design an Inventory Management System (e.g., addProduct, createOrder, confirmOrder).\n\nTopics Covered:\n- OOP Principles (SOLID principles)\n- Design Patterns\n- Database Schema Design\n\n---\n\n### 4. Hiring Manager Round\nDuration: 45 minutes\nFocus: Project discussion and behavioral questions\nPlatform: Google Meet\n\nKey Topics Covered:\n- Deep dive into projects (tech stack, challenges, optimizations)\n- Situational questions (e.g., designing a chat application)\n- Behavioral scenarios (e.g., handling high-traffic scenarios)\n\n---\n\n## Preparation Tips\n- Practice DSA: Focus on LeetCode Medium problems, especially in Binary Search, DP, and Segment Trees.\n- Low-Level Design: Study OOP principles and design patterns (e.g., Singleton, Factory).\n- Behavioral: Prepare for project deep dives and scenario-based questions.\n\n---\n\n## Common Rejection Reasons\n- Struggling with time management in coding rounds.\n- Lack of depth in design (e.g., not considering scalability).\n- Poor problem-solving approach (e.g., not discussing trade-offs).\n\n---\n\n## Resources\n- LeetCode\n- GeeksforGeeks\n- System Design Primer (GitHub)", "SDE-3 / Senior": "# SDE-3 / Senior - Role-Structured Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho is designed for experienced engineers and typically involves 4-5 rounds, including Machine Coding, System Design, Algorithm Rounds, and Hiring Manager Interviews. The process emphasizes scalability, system design, and leadership in problem-solving. Candidates are expected to demonstrate deep expertise in algorithms, distributed systems, and practical implementation.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Machine Coding Round\nDuration: 2 hours\nFocus: Design and implement a scalable system\nPlatform: HackerRank or similar\n\nKey Questions Asked:\n- Design and implement an N Elevator system (focus on concurrency and OOP principles).\n- Design an inventory/order management service (focus on thread safety and scalability).\n\nTopics Covered:\n- Concurrency and Thread Safety\n- OOP Principles\n- Scalable API Design\n- Database Schema Design\n\n---\n\n### 2. System Design Round\nDuration: 1.5 hours\nFocus: High-Level and Low-Level Design\nPlatform: Virtual whiteboard\n\nKey Questions Asked:\n- Design a trading platform (scalability and microservices).\n- Design a custom ad service (focus on scalability and efficiency).\n- Design a rule engine system (scheduling and executing rules at scale).\n\nTopics Covered:\n- Microservices Architecture\n- Database Design (SQL vs. NoSQL)\n- Caching Strategies (Redis, Memcached)\n- Consistency Models (Strong vs. Eventual Consistency)\n- Distributed Systems Design\n\n---\n\n### 3. Algorithm Round\nDuration: 1 hour\nFocus: Advanced DSA problems\nPlatform: HackerRank or similar\n\nKey Topics Covered:\n- Graph Algorithms (e.g., Dijkstra\u2019s, A*)\n- Dynamic Programming (Advanced)\n- Concurrency and Parallelism\n- Advanced Data Structures (e.g., Segment Trees, Fenwick Trees)\n\n---\n\n### 4. Hiring Manager Round\nDuration: 1 hour\nFocus: Project discussion, leadership, and cultural fit\nPlatform: Virtual meeting\n\nKey Topics Covered:\n- Deep dive into projects (design decisions, challenges, optimizations)\n- Leadership scenarios (e.g., mentoring, handling conflicts)\n- Behavioral questions (e.g., handling project pivots)\n\n---\n\n## Preparation Tips\n- Practice DSA: Focus on LeetCode Hard problems, especially in Graphs, DP, and Concurrency.\n- System Design: Study scalable architectures (e.g., trading platforms, ad services) and practice designing systems from scratch.\n- Behavioral: Prepare for leadership scenarios and project deep dives.\n\n---\n\n## Common Rejection Reasons\n- Struggling with scalability considerations in system design.\n- Lack of depth in distributed systems (e.g., not discussing trade-offs).\n- Poor leadership or mentorship examples in behavioral rounds.\n\n---\n\n## Resources\n- LeetCode\n- GeeksforGeeks\n- System Design Primer (GitHub)\n- Designing Data-Intensive Applications (Book)"}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho's hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, system design, and practical implementation. For mid-level roles like SDE-2 and SDE-3, the process includes multiple rounds of machine coding, system design, and technical discussions, often focusing on scalability and real-world scenarios. For entry-level roles like SDE-1 and interns, the process begins with a coding-heavy online assessment (OA) followed by technical and HR rounds, with a notable focus on Data Structures and Algorithms (DSA), OOPs, and low-level design. Rejections often hinge on implementation challenges, time management, and depth of project discussions.", "by_role": {"SDE-2": "# SDE-2 Role-Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves three core rounds: a technical round (DSA-focused), a machine coding round (implementation-heavy), and a system design + hiring manager round. Candidates are expected to demonstrate strong problem-solving skills, clean code implementation, and the ability to design scalable systems. The process is highly selective, with rejections often attributed to incomplete features, time constraints, or lack of depth in system design discussions.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Technical Round (DSA-Focused)\nFormat: 1-hour round with 2 coding questions (often LeetCode medium/hard).\nPlatform: HackerRank or LeetCode.\nKey Topics: Dynamic Programming, Graphs, Trees, Arrays, Strings.\n\n#### Example Questions:\n- Minimum Steps to Reach Target by a Knight (Coding Ninjas)\n- Remove All Adjacent Duplicates in String II (LeetCode)\n- Course Schedule II (LeetCode)\n- Container With Most Water (LeetCode)\n- Asteroid Collision (LeetCode)\n- Number of Islands (LeetCode)\n- Infinite Grid Problem (Knight\u2019s possible ways from (x,y) to (p,q))\n\n---\n\n### 2. Machine Coding Round\nFormat: 1.5\u20132-hour round focused on designing and implementing a functional system.\nPlatform: HackerRank or similar.\nKey Topics: OOPs, Design Patterns, Concurrency, Thread Safety.\n\n#### Example Problems:\n- Snake & Ladder Game Design\n- Ride-Sharing Application (e.g., Uber-like features)\n- Facebook-like Newsfeed System (Posting, Following, Pagination)\n- Inventory Management System (Blocking inventory until order confirmation)\n- N Elevator System (Thread handling, OOPs principles)\n\n---\n\n### 3. System Design + Hiring Manager Round\nFormat: 1-hour round combining system design (HLD/LLD) and behavioral/project discussions.\nKey Topics: Scalability, Microservices, Database Design, API Design, Trade-offs.\n\n#### Example Problems:\n- Design a Ranking and Review System for E-commerce (Sorting, Filtering, Ratings)\n- Twitter News Feed System (HLD focus)\n- OTP System Design (Basic functionalities)\n- Rule Engine System (Scheduling, Rule Collisions, Third-Party API Integrations)\n\n---\n\n## Common Pitfalls\n- Incomplete Features: Candidates often struggle to implement all required functionalities in machine coding rounds.\n- Time Management: Balancing DSA problems and system design questions within tight time constraints.\n- Depth of Discussion: Superficial system design discussions (e.g., not addressing scalability or trade-offs) lead to rejections.\n- Project Originality: Interviewers scrutinize project authenticity and depth of technical contribution.\n\n---\n\n## Preparation Tips\n1. DSA: Focus on Dynamic Programming, Graphs, and Trees (LeetCode medium/hard).\n2. Machine Coding: Practice OOPs, Design Patterns (Singleton, Factory, Observer), and Concurrency.\n3. System Design: Study scalability, microservices, and database design (e.g., SQL vs. NoSQL trade-offs).\n4. Projects: Be ready for deep dives into your resume projects (tech stack, trade-offs, optimizations).\n\n---\n\n## Resources\n- DSA: LeetCode, GeeksforGeeks\n- System Design: Grokking the System Design Interview, System Design Primer\n- Machine Coding: Practice on HackerRank, CodePair\n\n---\nLast Updated: Based on aggregated candidate data from 2021\u20132024.", "SDE-1 / New Grad": "# SDE-1 / New Grad Role-Structured Interview Briefing\n\n## Overview\nThe SDE-1 role at Meesho is designed for entry-level engineers and follows a multi-stage process starting with a coding-heavy online assessment (OA), followed by technical interviews, machine coding, and HR/managerial rounds. The process is highly competitive, with a strong emphasis on DSA, problem-solving, and project depth. Rejections are often due to incomplete coding problems, MCQ gaps, or shallow project discussions.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nFormat: 60\u201390 minutes, coding + MCQs.\nPlatform: HackerRank, NextLevel, or campus-specific platforms.\nKey Topics: DSA (Arrays, Strings, Graphs, DP), Core CS (OS, CN, DBMS, OOPs).\n\n#### Example Questions:\n- Coding:\n - Weighted Job Scheduling (Dynamic Programming + Binary Search)\n - Number of Islands (Graphs)\n - Activity Selection Problem (Greedy Algorithms)\n - Water the Plants (Greedy Approach)\n - Minimum Degree of a Connected Trio in a Graph (LeetCode Hard)\n - Rectangle Area II (LeetCode Hard)\n - Chocolate Distribution Problem (Arrays)\n - LIS Revisited (Dynamic Programming)\n - Graph Colouring (Graphs)\n - String Transformation (BFS-based problems)\n - Knapsack Problem (0-1 Knapsack with Constraints)\n\n- MCQs:\n - Operating Systems (Semaphores vs. Mutex, Paging, Virtual Memory)\n - Computer Networks (ARP, DNS, OSI Model)\n - DBMS (SQL vs. NoSQL, Normalization, ACID Properties)\n - OOPs (Inheritance, Polymorphism, Singleton Class)\n - C++/Java (Output Questions, String Constructors)\n\n---\n\n### 2. Technical Interview 1 (Coding-Focused)\nFormat: 1\u20131.5-hour round, 2 coding questions.\nPlatform: HackerRank CodePair.\nKey Topics: DSA (Trees, Graphs, Hashing, Stacks).\n\n#### Example Questions:\n- Pair of Nodes Equal to Given Sum (BST)\n- Kth Node from the Last (Linked List)\n- Add Two Numbers Represented by Linked Lists (Stacks)\n- Storing Frequencies in a Map (Hashing)\n- Stock Price Optimization (Arrays)\n- Longest Substring with K Repeating Characters (Variation)\n- Making a Large Island (LeetCode Hard)\n\n---\n\n### 3. Technical Interview 2 (System Design + Core CS)\nFormat: 1-hour round, mix of coding and theory.\nKey Topics: SQL Queries, Database Design, OOPs, OS, Networking.\n\n#### Example Questions:\n- Write SQL Queries for a given database schema (e.g., ROW_NUMBER(), RANK(), DENSE_RANK())\n- Explain ARP, DNS, and OSI Model\n- Difference Between Semaphore and Mutex\n- Paging Technique vs. Virtual Memory\n- Threading in Java\n- Inner Implementation of Vectors in C++ (Complexities for insert/delete/read)\n- Tech Stack Choices (Why you chose a specific stack for your projects)\n\n---\n\n### 4. Machine Coding Round\nFormat: 1\u20132 hours, design and implement a functional system.\nKey Topics: OOPs, Design Patterns, API Design, Pagination.\n\n#### Example Problems:\n- Design a Cab Booking System (OOP-based implementation of 10+ functions)\n- Design a Facebook-like Newsfeed System (Posting, Following, Pagination)\n- Design an Inventory Management System (Blocking inventory until order confirmation)\n- Design a Social Media System (Create Post, Delete Post, Get Feed, Follow/Unfollow)\n\n---\n\n### 5. HR/Technical Round (Project Deep Dive + Behavioral)\nFormat: 1-hour round, focus on projects, optimizations, and real-world scenarios.\nKey Topics: Project Discussions, Optimization, Situational Questions.\n\n#### Example Questions:\n- Explain your project\u2019s tech stack and why you chose it\n- Optimize your OA solutions (e.g., reduce time complexity)\n- Handle a sale scenario where only x products are available but y people want them (no duplicates).\n- How would you restart a project if your approach was deemed wrong after 3\u20134 days?\n- Design a basic OTP System (Database schema, APIs, flow)\n- Deep dive into your projects: Problems faced, solutions, trade-offs.\n\n---\n\n## Common Pitfalls\n- MCQ Performance: Weaknesses in OS, CN, or DBMS MCQs often lead to rejection.\n- OA Cutoffs: Failing to solve 2+ coding questions in OA (medium-hard difficulty).\n- Project Originality: Interviewers verify project authenticity (e.g., React hooks, Express handling).\n- Time Management: Struggling to complete machine coding within 90 minutes.\n- Theory Gaps: Lack of clarity in core CS topics (e.g., semaphores, normalization).\n\n---\n\n## Preparation Tips\n1. DSA: Master LeetCode medium/hard (focus on Trees, Graphs, DP, Greedy).\n2. MCQs: Revise OS, CN, DBMS, and OOPs (use GeeksforGeeks for practice).\n3. Machine Coding: Practice OOPs, Design Patterns, and API Design (e.g., Singleton, Factory).\n4. Projects: Be ready for deep dives (tech stack, trade-offs, optimizations).\n5. Behavioral: Prepare for situational questions (e.g., handling flawed project approaches).\n\n---\n\n## Resources\n- DSA: LeetCode, Codeforces\n- MCQs: GeeksforGeeks, InterviewBit\n- System Design: Grokking the System Design Interview\n- Machine Coding: HackerRank, CodePair\n\n---\nLast Updated: Based on aggregated candidate data from 2021\u20132024.", "Intern": "# Intern Role-Structured Interview Briefing\n\n## Overview\nMeesho\u2019s internship hiring process is highly competitive, with over 100,000 applicants vying for a handful of spots. The process includes a multi-stage evaluation starting with a coding + MCQ online assessment, followed by low-level design, technical, and hiring manager rounds. Candidates are expected to demonstrate strong DSA skills, problem-solving under time constraints, and the ability to design scalable systems. Rejections often occur due to incomplete problems, shallow project discussions, or time management issues.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nFormat: 30\u2013105 minutes, coding + MCQs.\nPlatform: NextLevel, HackerRank, or campus-specific platforms.\n\n#### Example Questions:\n- MCQs:\n - Operating Systems (DSA, Error Handling)\n - Computer Networks (Protocols, OSI Model)\n - DBMS (SQL Queries, Normalization)\n - Programming Concepts (C++/Java Output Questions)\n\n- Coding:\n - Binary Search (Medium)\n - Dynamic Programming (Medium-Hard, e.g., Segment Tree)\n - Graph Problems (e.g., BFS-based pathfinding)\n - String Manipulation (e.g., Reverse with substitutions)\n - Knapsack Problem (0-1 Knapsack with Constraints)\n\n---\n\n### 2. Coding Test (Technical Round 1)\nFormat: 60\u201390 minutes, 2\u20133 coding questions.\nPlatform: HackerRank.\nKey Topics: DSA (Arrays, Strings, Graphs, DP).\n\n#### Example Questions:\n- Stack-based Balls Collision (Similar to LeetCode\u2019s Asteroid Collision)\n- Hashmap and String-Based Problems (e.g., Frequency Storage)\n- Stock Price Optimization (Arrays)\n\n---\n\n### 3. Low-Level Design Round\nFormat: 60\u201390 minutes, design and implement a functional system.\nKey Topics: OOPs, SOLID Principles, Design Patterns.\n\n#### Example Problems:\n- Inventory Management System\n - Functions: addProduct, createOrder, confirmOrder, getInventory\n - Requirements: Block inventory until order confirmation\n\n---\n\n### 4. Hiring Manager Round\nFormat: 45\u201360 minutes, project deep dive + situational questions.\nKey Topics: Projects, High-Traffic Scenarios, Transactional Concepts.\n\n#### Example Questions:\n- Design a Chat Application (Database schema, APIs, application flow)\n- Explain your projects in detail (Problems faced, solutions, tech stack)\n- Handling High-Traffic Scenarios (e.g., sale scenarios)\n- Transactional Concepts in Spring Boot\n\n---\n\n## Common Pitfalls\n- OA Performance: Failing to solve all 3 coding questions in OA.\n- Time Management: Struggling to complete machine coding within 90 minutes.\n- Project Depth: Superficial explanations of projects or tech stack choices.\n- MCQ Gaps: Weaknesses in OS, CN, or DBMS MCQs.\n- Follow-up Questions: Unable to address scalability or trade-offs in system design.\n\n---\n\n## Preparation Tips\n1. DSA: Focus on LeetCode medium/hard (Graphs, DP, Arrays).\n2. MCQs: Revise OS, CN, and DBMS (use GeeksforGeeks).\n3. Low-Level Design: Practice OOPs, SOLID Principles, and Design Patterns.\n4. Projects: Be ready for deep dives (tech stack, optimizations, trade-offs).\n5. Behavioral: Prepare for situational questions (e.g., handling high-traffic scenarios).\n\n---\n\n## Resources\n- DSA: LeetCode, Codeforces\n- MCQs: GeeksforGeeks\n- Low-Level Design: SOLID Principles, Design Patterns\n- System Design: Grokking the System Design Interview\n\n---\nLast Updated: Based on aggregated candidate data from 2021\u20132024.", "SDE-3 / Senior": "# SDE-3 / Senior Role-Structured Interview Briefing\n\n## Overview\nThe SDE-3 role at Meesho targets senior engineers with 4+ years of experience and emphasizes scalability, system design, and leadership in implementation. The process includes machine coding, system design, and bar raiser rounds, with a strong focus on practical implementation, concurrency, and architectural trade-offs. Rejections often occur due to incomplete implementations, superficial design discussions, or lack of depth in project contributions.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Machine Coding Round\nFormat: 2-hour round, design and implement a scalable system.\nPlatform: HackerRank.\nKey Topics: OOPs, Concurrency, Thread Safety, Microservices.\n\n#### Example Problems:\n- N Elevator System\n - Focus: Thread handling, OOPs principles, scalability\n- Inventory/Order Management Service\n - Focus: Concurrent users, thread safety, LLD\n\n---\n\n### 2. System Design Round\nFormat: 1.5-hour round, design a scalable system.\nKey Topics: Microservices, Scalability, Database Design, API Design.\n\n#### Example Problems:\n- Design a Trading Platform (Custom use case)\n- Design a Custom Ad Service\n - Focus: Scalability, microservices architecture\n- Design a Restaurant Rating System\n - Requirements: Multi-branch support, rating aggregation, pincode-based searches\n\n---\n\n### 3. Bar Raiser Round\nFormat: 1-hour round, follow-up on weaker areas.\nKey Topics: Distributed Systems, Algorithms, Scenario-Based Questions.\n\n#### Example Questions:\n- Design a Rule Engine System\n - Requirements: Schedule millions of rules, handle collisions, third-party API integrations\n- Distributed Systems Design (e.g., CAP Theorem, Consistency Models)\n- Algorithms for Scalability (e.g., Load Balancing, Caching Strategies)\n\n---\n\n### 4. Non-Technical Round (HR + Hiring Manager)\nFormat: 1-hour round, project discussions, principles, and values.\nKey Topics: Personal Projects, Leadership, Scenario-Based Questions.\n\n#### Example Questions:\n- Explain your design decisions in personal projects\n- Scenario-Based Questions (e.g., Handling conflicts, team leadership)\n- Meesho\u2019s Values and Cultural Fit\n\n---\n\n## Common Pitfalls\n- Incomplete Implementations: Failing to handle concurrency or scalability in machine coding.\n- Superficial Designs: Not addressing trade-offs (e.g., SQL vs. NoSQL, consistency models).\n- Project Depth: Lack of clarity in explaining architectural choices in projects.\n- Time Management: Struggling to complete system design within 90 minutes.\n\n---\n\n## Preparation Tips\n1. Machine Coding: Practice OOPs, Concurrency, and Design Patterns.\n2. System Design: Study scalability, microservices, and distributed systems (e.g., CAP Theorem).\n3. Projects: Be ready for deep dives into your contributions and trade-offs.\n4. Behavioral: Prepare for leadership and scenario-based questions.\n\n---\n\n## Resources\n- Machine Coding: HackerRank, CodePair\n- System Design: Grokking the System Design Interview, System Design Primer\n- Concurrency: Java Concurrency in Practice\n- Distributed Systems: Designing Data-Intensive Applications\n\n---\nLast Updated: Based on aggregated candidate data from 2021\u20132024."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho\u2019s hiring process is rigorous and multi-staged, with a strong emphasis on problem-solving, system design, and practical implementation. Candidates are evaluated across technical rounds (DSA, Machine Coding, System Design), managerial rounds, and HR rounds, with a notable focus on scalability, edge cases, and real-world applicability. Rejections often stem from gaps in preparation, especially in machine coding and system design, where hands-on implementation and trade-off discussions are critical.", "by_role": {"SDE-2": "# Meesho SDE-2 Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho involves a three-round process with a strong focus on Data Structures and Algorithms (DSA), Machine Coding, and System Design/Hiring Manager rounds. Candidates are expected to demonstrate depth in problem-solving, scalability considerations, and practical implementation skills, particularly in backend or distributed systems. The process is highly selective, with rejections often attributed to incomplete features, poor time management, or lack of Java experience.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Problem Solving and Data Structures (PS-DS) / Technical Round\nFormat: 1-hour round with 2 coding questions.\nFocus: DSA problems, including graph algorithms, dynamic programming, and string manipulation.\nCommon Topics:\n- Graph traversals (e.g., Number of Islands, Asteroid Collision)\n- Dynamic Programming (e.g., Knapsack, weighted job scheduling)\n- String manipulation (e.g., palindromic strings, anagrams)\n- Matrix problems (e.g., connected components)\n\nExact Questions Asked:\n- Minimum Steps to Reach Target by a Knight (Coding Ninjas)\n- Remove All Adjacent Duplicates in String II (LeetCode)\n- Course Schedule II (LeetCode)\n- Container With Most Water (LeetCode)\n- Asteroid Collision (LeetCode)\n- Matrix Connected Components (Similar to Number of Islands)\n\n---\n\n### 2. Machine Coding Round\nFormat: 1.5\u20132-hour round focused on designing and implementing a system with specific functionalities.\nFocus: Low-Level Design (LLD), OOP principles, and scalability considerations.\nCommon Topics:\n- Game design (e.g., Snake & Ladder)\n- Ride-sharing applications (e.g., cab booking systems)\n- Social media systems (e.g., Facebook-like newsfeed)\n- E-commerce features (e.g., inventory management, ranking systems)\n\nExact Questions Asked:\n- Snake & Ladder Game Design\n- Ride-Sharing Application Features (e.g., implementing 2 main features for a ride-sharing app)\n- Facebook-like Newsfeed System (Posting, following users, pagination support)\n- Cab Booking System (Design and implement 10+ functions using OOP concepts)\n- Inventory Management System (e.g., blocking inventory until order confirmation)\n- Rating and Review System (e.g., e-commerce product ratings, sorting, filtering)\n\n---\n\n### 3. System Design + Hiring Manager Round\nFormat: 1-hour round combining system design, project discussion, and behavioral questions.\nFocus: High-Level Design (HLD), scalability, and real-world trade-offs.\nCommon Topics:\n- Designing scalable systems (e.g., Twitter news feed, OTP systems)\n- Database design (SQL vs. NoSQL, indexing, sharding)\n- API design (e.g., getProductList())\n- Behavioral questions (e.g., project deep dives, optimization techniques)\n\nExact Questions Asked:\n- Twitter News Feed Design (HLD and LLD)\n- Ranking and Review System (e.g., e-commerce product ratings, sorting, filtering)\n- Database Design for E-commerce (e.g., SQL vs. NoSQL, MongoDB vs. Redis)\n- Project Discussion (Deep dive into resume projects, tech stack choices, and trade-offs)\n- Behavioral Questions (e.g., handling failures, team collaboration, debugging)\n\n---\n\n## Key Takeaways\n- Success Factors: Strong DSA skills, ability to design scalable systems, and clean code implementation are critical.\n- Common Pitfalls: Incomplete machine coding features, poor time management, and lack of Java experience (for backend roles).\n- Preparation Tips:\n - Practice machine coding problems under time constraints.\n - Focus on scalability and edge cases in system design.\n - Review OOP principles and design patterns (e.g., Singleton, Factory).\n\n---\n\n## Resources\n- Meesho SDE-2 Interview Experience (Snake & Ladder)\n- Meesho SDE-2 Backend Rejection Analysis\n- Meesho SDE-2 Offer Experience", "SDE-1 / New Grad": "# Meesho SDE-1 / New Grad Interview Briefing\n\n## Overview\nThe SDE-1 role at Meesho is designed for entry-level candidates and includes a multi-stage process starting with an Online Assessment (OA), followed by technical interviews, machine coding, and HR rounds. The process is highly competitive, with a focus on DSA, system design fundamentals, and problem-solving under constraints. Candidates are expected to demonstrate strong fundamentals in computer science and practical implementation skills.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nFormat: 75\u2013100 minutes, including coding questions and MCQs.\nFocus: DSA problems, SQL queries, and computer science fundamentals (OS, DBMS, CN, OOPs).\nCommon Topics:\n- Arrays, strings, dynamic programming\n- Graph algorithms (e.g., BFS, DFS)\n- SQL queries (e.g., JOINs, subqueries, window functions)\n- Computer science fundamentals (e.g., OS, DBMS, networking)\n\nExact Questions Asked:\n- Coding Questions:\n - Find common elements in two arrays (ascending order).\n - Minimum number of modifications to make two strings anagrams.\n - Weighted job scheduling (optimized with binary search).\n - Chocolate Distribution Problem.\n - Longest Increasing Subsequence (LIS) revisited.\n - Graph Colouring problem.\n - Minimum Degree of a Connected Trio in a Graph (LeetCode).\n - Rectangle Area II (LeetCode).\n - String transformation (e.g., reverse with substitutions).\n - BFS in a matrix with obstacles.\n - Knapsack Problem with constraints.\n\n- SQL Queries:\n - Use of ROW_NUMBER(), RANK(), and DENSE_RANK().\n - Complex queries with subqueries and WITH clauses.\n - Join operations and aggregation.\n\n- MCQs:\n - Operating Systems (e.g., semaphores vs. mutex, paging)\n - Computer Networks (e.g., ARP, DNS, OSI model)\n - DBMS (e.g., SQL vs. NoSQL, normalization, ACID properties)\n - Programming (e.g., C++/Java output questions, OOP concepts)\n\n---\n\n### 2. Technical Interview Rounds\nFormat: 1\u20131.5-hour rounds focused on DSA, system design fundamentals, and CS concepts.\nFocus: Problem-solving, optimization, and debugging.\nCommon Topics:\n- Arrays, strings, dynamic programming\n- Graph algorithms (e.g., BFS, DFS)\n- Low-Level Design (LLD) and OOP principles\n- SQL and database concepts\n\nExact Questions Asked:\n- DSA Problems:\n - Activity Selection Problem (greedy algorithm).\n - Watering plants (greedy approach).\n - Extension of the Number of Islands problem.\n - Count arrays with specific divisibility rules.\n - Pair of nodes equal to a given sum (BST).\n - Kth node from the last (Linked List).\n - Add two numbers represented by linked lists (stack-based).\n - Asteroid Collision (stack-based).\n - Stock price optimization (O(n) solution).\n\n- System Design Fundamentals:\n - Design a cab booking system (OOP implementation).\n - Design a basic OTP system.\n\n- CS Concepts:\n - Inner implementation of vectors in C++.\n - Java optimization techniques (e.g., garbage collection).\n - Database design (e.g., normalization, ACID properties).\n\n---\n\n### 3. Machine Coding Round\nFormat: 1\u20132-hour round focused on designing and implementing a system with specific functionalities.\nFocus: Low-Level Design (LLD), OOP principles, and scalability considerations.\nCommon Topics:\n- Social media systems (e.g., Facebook-like newsfeed)\n- E-commerce features (e.g., inventory management)\n- Cab booking systems\n\nExact Questions Asked:\n- Design a Facebook-like newsfeed system (posting, following users, pagination).\n- Design an inventory management system (e.g., blocking inventory until order confirmation).\n\n---\n\n### 4. HR/Technical Round\nFormat: 1-hour round combining project discussions, optimization, and behavioral questions.\nFocus: Resume deep dives, real-world scenario questions, and cultural fit.\nCommon Topics:\n- Project discussions (tech stack, trade-offs, optimization)\n- Real-world scenarios (e.g., handling sales with limited inventory)\n- Situational questions (e.g., restarting a flawed project)\n\nExact Questions Asked:\n- Explain tech stack choices and alternatives for projects.\n- Optimize solutions from the OA.\n- Handle a sale scenario where only x products are available but y people want them.\n- How to handle a project that needs to be restarted after 3\u20134 days?\n\n---\n\n## Key Takeaways\n- Success Factors: Strong DSA skills, fundamental CS knowledge, and ability to implement systems are critical.\n- Common Pitfalls: Poor time management in OA, lack of optimization in solutions, and incomplete machine coding implementations.\n- Preparation Tips:\n - Practice DSA problems under time constraints.\n - Review SQL queries and database concepts.\n - Focus on OOP principles and design patterns.\n - Prepare for system design fundamentals (e.g., designing small-scale systems).\n\n---\n\n## Resources\n- Meesho SDE-1 On-Campus Experience\n- Meesho SDE-1 OA and Technical Rounds\n- Meesho SDE-1 Machine Coding Round", "Intern": "# Meesho Intern Interview Briefing\n\n## Overview\nThe Meesho Intern hiring process is highly competitive, with a multi-stage evaluation focusing on DSA, machine coding, and system design fundamentals. Candidates are expected to demonstrate strong problem-solving skills, practical implementation abilities, and a solid grasp of computer science fundamentals. The process includes an Online Assessment (OA), coding rounds, LLD/system design, and HR rounds, with a strong emphasis on scalability and real-world applicability.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nFormat: 30\u2013105 minutes, including MCQs and coding questions.\nFocus: DSA, computer science fundamentals, and problem-solving under constraints.\nCommon Topics:\n- Arrays, strings, dynamic programming\n- Graph algorithms (e.g., BFS, DFS)\n- Computer science fundamentals (e.g., OS, DBMS, networking)\n- SQL queries (for some roles)\n\nExact Questions Asked:\n- MCQs:\n - Operating Systems (e.g., threads, virtual memory)\n - Data Structures and Algorithms (e.g., arrays, trees)\n - Computer Networks (e.g., ARP, DNS, OSI model)\n - Programming (e.g., C++/Java output questions)\n\n- Coding Questions:\n - Binary Search problems.\n - Dynamic Programming (e.g., Segment Tree, LIS).\n - Graph problems (e.g., connected components).\n - String manipulation (e.g., reverse with substitutions).\n - BFS in a matrix with obstacles.\n - Weighted job scheduling.\n\n---\n\n### 2. Coding Round (HackerRank/Similar Platforms)\nFormat: 90\u2013105 minutes, with 2\u20133 coding problems.\nFocus: DSA, optimization, and edge-case handling.\nCommon Topics:\n- Arrays, strings, dynamic programming\n- Graph algorithms\n- Stack-based problems\n- Hashmap-based problems\n\nExact Questions Asked:\n- Storing frequencies in a map.\n- Stock price optimization (O(n) solution).\n- Stack-based balls collision problem (similar to Asteroid Collision).\n- Hashmap and string-based problems.\n\n---\n\n### 3. Low-Level Design (LLD) Round\nFormat: 60\u201390 minutes, focused on designing and implementing a system.\nFocus: OOP principles, design patterns, and scalability considerations.\nCommon Topics:\n- Inventory management systems\n- Social media systems (e.g., chat applications)\n- E-commerce features\n\nExact Questions Asked:\n- Design an inventory management system (e.g., blocking inventory until order confirmation).\n- Design a chat application (database schema, APIs, application flow).\n- Implement SOLID principles and use design patterns (e.g., Singleton).\n\n---\n\n### 4. Hiring Manager Round\nFormat: 45-minute round focused on project discussions, situational questions, and behavioral assessment.\nFocus: Resume deep dives, real-world scenarios, and cultural fit.\nCommon Topics:\n- Project discussions (tech stack, trade-offs, challenges)\n- Situational questions (e.g., handling high-traffic scenarios)\n- Transactional concepts (e.g., Spring Boot)\n\nExact Questions Asked:\n- Discuss projects in detail (e.g., problems faced, solutions, tech stack).\n- Design a chat application (database schema, APIs, application flow).\n- Handle high-traffic scenarios and transactional concepts.\n\n---\n\n## Key Takeaways\n- Success Factors: Strong DSA skills, fundamental CS knowledge, and ability to design and implement systems are critical.\n- Common Pitfalls: Poor time management in OA, lack of optimization in solutions, and incomplete LLD implementations.\n- Preparation Tips:\n - Practice DSA problems under time constraints.\n - Review OOP principles and design patterns.\n - Focus on system design fundamentals (e.g., designing small-scale systems).\n - Prepare for resume deep dives and behavioral questions.\n\n---\n\n## Resources\n- Meesho Intern OA and Coding Round\n- Meesho DICE Exam Experience", "SDE-3 / Senior": "# Meesho SDE-3 / Senior Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho targets experienced engineers with a strong focus on scalability, system design, and leadership in implementation. The hiring process includes machine coding, system design, and bar raiser rounds, with an emphasis on practical implementation, trade-offs, and architectural decisions. Candidates are expected to demonstrate depth in distributed systems, concurrency, and real-world problem-solving.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Machine Coding Round\nFormat: 2-hour round focused on implementing a complex system with an emphasis on threads, OOP principles, and scalability.\nFocus: Low-Level Design (LLD), concurrency, and practical implementation.\nCommon Topics:\n- Elevator system design (thread handling)\n- Inventory/order management systems\n- Rule engine design\n\nExact Questions Asked:\n- N Elevator Implementation (Focus on handling threads, OOP principles).\n- Inventory/Order Management Service (40-minute discussion on approach and LLD, followed by Java implementation with thread safety considerations).\n- Restaurant Rating System (Handling multiple branches, pincode-based searches, and rating aggregations).\n\n---\n\n### 2. System Design Round\nFormat: 1.5\u20132-hour round focused on designing scalable systems with an emphasis on microservices and trade-offs.\nFocus: High-Level Design (HLD), scalability, and architectural decisions.\nCommon Topics:\n- Trading platforms\n- Custom ad services\n- Rule engines (scheduling, collision handling)\n\nExact Questions Asked:\n- Design a System Similar to a Trading Platform (Emphasis on scalability and real-time processing).\n- Custom Ad Service (Microservices architecture, scalability considerations).\n- Rule Engine System (Scheduling millions of rules, handling collisions, and failure scenarios).\n\n---\n\n### 3. Bar Raiser Round\nFormat: 1-hour round focused on weaknesses from previous rounds and advanced topics.\nFocus: Distributed systems, algorithms, and scenario-based questions.\nCommon Topics:\n- Distributed systems design\n- Advanced algorithms (e.g., greedy, divide and conquer)\n- Scenario-based trade-offs\n\nExact Questions Asked:\n- Follow-up questions on distributed systems design.\n- Scenario-based questions (e.g., handling failures, optimizing performance).\n- Algorithmic challenges (e.g., trade-offs in design decisions).\n\n---\n\n### 4. Hiring Manager Round (Non-Technical)\nFormat: 1-hour round focused on project discussions, principles, and cultural fit.\nFocus: Resume deep dives, behavioral questions, and leadership principles.\nCommon Topics:\n- Project discussions (design decisions, challenges)\n- Behavioral questions (e.g., handling conflicts, team collaboration)\n- Cultural fit and values\n\nExact Questions Asked:\n- Discuss personal projects and design decisions.\n- Scenario-based questions (e.g., handling project failures, optimizing processes).\n- Cultural fit and values assessment.\n\n---\n\n## Key Takeaways\n- Success Factors: Strong system design skills, experience with distributed systems, and ability to lead implementation are critical.\n- Common Pitfalls: Poor trade-off discussions, lack of scalability considerations, and incomplete implementations.\n- Preparation Tips:\n - Practice system design problems (e.g., designing scalable systems).\n - Review distributed systems concepts (e.g., concurrency, thread safety).\n - Focus on trade-offs and scalability in design decisions.\n - Prepare for behavioral questions and resume deep dives.\n\n---\n\n## Resources\n- Meesho SDE-3 Remote Offer Experience\n- Meesho SDE-3 Bangalore Experience\n- Meesho SDE-3 Restaurant Rating System"}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho\u2019s hiring process is highly structured and rigorous, emphasizing problem-solving, system design, and practical implementation across all roles. The process typically includes multiple rounds of coding (DSA), machine coding, system design, and managerial discussions, with a strong focus on scalability, edge cases, and real-world applicability. Rejections often stem from gaps in preparation, particularly in machine coding and system design, where candidates struggle with implementation depth or scalability constraints.", "by_role": {"SDE-2": "# SDE-2 Role Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves 3-4 rounds, including DSA, Machine Coding, System Design, and a Hiring Manager round. The process is designed to assess problem-solving, coding proficiency, system design skills, and project depth. Candidates are expected to demonstrate clean code, scalability awareness, and a strong grasp of core computer science concepts.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Problem Solving and Data Structures (DSA) Round\nDuration: 1 hour\nFormat: 2 coding questions (LeetCode medium/hard level)\nPlatform: HackerRank or similar\n\n#### Common Questions:\n- Minimum Steps to Reach Target by a Knight (Dynamic Programming/Graphs)\n- Remove All Adjacent Duplicates in String II (String manipulation, Stacks)\n- Asteroid Collision (Stack-based simulation)\n- Course Schedule II (Topological Sorting)\n- Container With Most Water (Two-pointer technique)\n- Number of Islands (Graph traversal, DFS/BFS)\n- Infinite Grid Problem (Knight\u2019s possible moves in an infinite grid)\n\nKey Focus:\n- Time and space complexity optimization.\n- Edge case handling (e.g., empty grids, large inputs).\n- Clean code implementation with proper test cases.\n\n---\n\n### 2. Machine Coding Round\nDuration: 1.5\u20132 hours\nFormat: Design and implement a small system with specific functionalities.\nPlatform: HackerRank or virtual IDE\n\n#### Common Problems:\n- Snake & Ladder Game Design (OOPs, Randomization, State Management)\n- Design a Ride-Sharing Application (Features: Ride booking, driver allocation, pricing)\n- Facebook-like Newsfeed System (Posting, Following, Pagination, Feed Generation)\n- Facebook APIs (Create Post, Delete Post, Get Feed, Follow/Unfollow Users)\n- Inventory Management System (Add/Remove Products, Order Management, Stock Updates)\n\nKey Focus:\n- Modular design using OOPs principles.\n- Concurrency handling (e.g., thread safety, race conditions).\n- Scalability considerations (e.g., caching, database design).\n- Test case coverage (Unit tests, edge cases).\n\n---\n\n### 3. System Design Round\nDuration: 1\u20131.5 hours\nFormat: High-Level Design (HLD) and Low-Level Design (LLD) discussion.\n\n#### Common Problems:\n- Design a Ranking and Review System for E-commerce (Requirements: Reviews, Ratings, Sorting, Filtering, Likes/Dislikes)\n- Twitter News Feed System (HLD: Feed generation, ranking algorithms)\n- OTP System Design (Scalability, API design, Security)\n- Trading Platform (Microservices, Real-time data processing)\n\nKey Focus:\n- Database design (SQL vs. NoSQL, indexing strategies).\n- API design (RESTful principles, pagination).\n- Caching strategies (Redis, Memcached).\n- Scalability and load balancing (Microservices vs. Monolith).\n- Consistency models (Strong vs. Eventual Consistency).\n\n---\n\n### 4. Hiring Manager Round\nDuration: 1 hour\nFormat: Behavioral questions, project deep dives, and role-specific discussions.\n\n#### Common Topics:\n- Project Discussions (Tech stack, challenges, optimizations, trade-offs).\n- Behavioral Questions (e.g., Handling conflicts, teamwork, failures).\n- Java Optimization (Garbage collection, threading, JVM internals).\n- System Monitoring and Debugging (Tools: Prometheus, Grafana, Debugging techniques).\n\nKey Focus:\n- Alignment with Meesho\u2019s culture (Collaboration, ownership, innovation).\n- Problem-solving approach (How candidates tackle ambiguity).\n- Past experiences (Lessons learned, impact on projects).\n\n---\n\n## Preparation Tips\n1. DSA: Focus on Dynamic Programming, Graphs, Trees, and String Manipulation. Practice on platforms like LeetCode (medium/hard problems).\n2. Machine Coding: Implement OOPs concepts, design patterns (e.g., Singleton, Factory), and concurrency in your solutions.\n3. System Design: Study scalability patterns, database design, and caching strategies. Use resources like Grokking the System Design Interview.\n4. Behavioral: Prepare STAR (Situation, Task, Action, Result) stories for common behavioral questions.\n\n---\n\n## Rejection Patterns\n- Machine Coding: Candidates often struggle with implementation depth, scalability, or edge cases.\n- System Design: Lack of scalability awareness or trade-off discussions leads to rejections.\n- Behavioral: Poor alignment with Meesho\u2019s values (e.g., ownership, collaboration) can be a dealbreaker.", "SDE-1 / New Grad": "# SDE-1 / New Grad Role Structured Interview Briefing\n\n## Overview\nThe SDE-1 / New Grad role at Meesho is highly competitive, with a multi-stage process including an Online Assessment (OA), Technical Interviews, System Design, and HR Rounds. The process evaluates coding proficiency, problem-solving, system design fundamentals, and cultural fit. Candidates are expected to demonstrate strong DSA skills, clean code, and a willingness to learn.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nDuration: 75\u2013100 minutes\nFormat: Coding + MCQs\nPlatform: HackerRank, NextLevel, or similar\n\n#### Common Questions:\nCoding (3 questions, Easy/Medium/Hard):\n- Weighted Job Scheduling (Dynamic Programming, Binary Search)\n- Activity Selection Problem (Greedy Algorithms)\n- Water the Plants (Greedy Approach)\n- Reverse String with Substitutions (String manipulation)\n- Path Existence in 2D Matrix (BFS/DFS)\n- Minimum Degree of a Connected Trio in a Graph (Graph Theory)\n- Rectangle Area II (Coordinate Compression, Geometry)\n- Chocolate Distribution Problem (Greedy Algorithms)\n- LIS Revisited (Dynamic Programming)\n- Graph Colouring (Graph Theory)\n- Knapsack Problem (Dynamic Programming, Constraints: n \u2264 36)\n\nMCQs (10\u201330 questions):\n- Operating Systems (Processes, Threads, Memory Management)\n- Computer Networks (OSI Model, DNS, ARP)\n- DBMS (SQL vs. NoSQL, Normalization, ACID Properties)\n- OOPs (Inheritance, Polymorphism, Design Patterns)\n- DSA (Time Complexity, Space Complexity)\n- C/C++/Java (Output Questions, Language-Specific Concepts)\n\nKey Focus:\n- Time management (Prioritize easy/medium questions first).\n- Edge case handling (e.g., large inputs, empty arrays).\n- Clean code (Proper variable naming, comments, modularity).\n\n---\n\n### 2. Technical Interviews (2 Rounds)\nDuration: 1\u20131.5 hours per round\nFormat: Coding + Conceptual Questions\nPlatform: HackerRank CodePair, Virtual Whiteboard\n\n#### Common Questions:\nCoding (2 questions, Medium/Hard):\n- Number of Islands Extension (Graph Traversal, DFS/BFS)\n- Count Arrays with Rules (Divisibility Conditions)\n- Pair of Nodes Equal to Given Sum (BST, Two-Pointer Technique)\n- Kth Node from the Last (Linked List)\n- Add Two Numbers in Linked Lists (Stacks, Linked Lists)\n- Stock Price Optimization (Array Traversal, Max Profit)\n- Longest Substring with K Repeating Characters (Sliding Window)\n- Making a Large Island (Graph Theory, Union-Find)\n\nConceptual Questions:\n- Operating Systems (Semaphores vs. Mutex, Paging, Virtual Memory)\n- DBMS (SQL vs. NoSQL, ACID Properties, Normalization)\n- OOPs (Singleton Class, String Builders, Inheritance)\n- Computer Networks (ARP, DNS, OSI Model)\n- Java Internals (Garbage Collection, Threading)\n\nKey Focus:\n- Problem-solving approach (Explain thought process clearly).\n- Optimization (Time/space complexity analysis).\n- Debugging skills (Identify and fix bugs efficiently).\n\n---\n\n### 3. Machine Coding Round\nDuration: 1\u20132 hours\nFormat: Design and implement a small system.\nPlatform: HackerRank or Virtual IDE\n\n#### Common Problems:\n- Design a Cab Booking System (OOPs, State Management, Pricing Logic)\n- Inventory Management System (Add/Remove Products, Order Processing, Stock Updates)\n- Social Media System (Create/Delete Posts, Get Feeds, Follow/Unfollow Users)\n\nKey Focus:\n- Modular design (Separation of concerns).\n- Scalability (Handling concurrent users, database design).\n- Test case coverage (Unit tests, edge cases).\n\n---\n\n### 4. System Design Round\nDuration: 1 hour\nFormat: High-Level Design (HLD) discussion.\n\n#### Common Problems:\n- Design a Basic OTP System (Scalability, API Design, Security)\n- Design a Ranking and Review System (Requirements: Reviews, Ratings, Sorting, Filtering)\n\nKey Focus:\n- Database schema design (SQL vs. NoSQL).\n- API design (RESTful principles, pagination).\n- Caching strategies (Redis, Memcached).\n- Scalability considerations (Load balancing, microservices).\n\n---\n\n### 5. HR/Technical Round\nDuration: 1 hour\nFormat: Project deep dives, behavioral questions, and role-specific discussions.\n\n#### Common Topics:\n- Project Discussions (Tech stack, challenges, optimizations, trade-offs).\n- Behavioral Questions (e.g., Handling failures, teamwork, adaptability).\n- Real-World Scenarios (e.g., Handling sales with limited inventory).\n- Situational Questions (e.g., Restarting a flawed project).\n\nKey Focus:\n- Cultural fit (Alignment with Meesho\u2019s values).\n- Problem-solving approach (How candidates tackle ambiguity).\n- Past experiences (Lessons learned, impact on projects).\n\n---\n\n## Preparation Tips\n1. DSA: Focus on Dynamic Programming, Graphs, Trees, and String Manipulation. Practice on platforms like LeetCode (Easy/Medium/ Hard problems).\n2. Machine Coding: Implement OOPs concepts, design patterns, and scalability in your solutions.\n3. System Design: Study scalability patterns, database design, and caching strategies. Use resources like Grokking the System Design Interview.\n4. Behavioral: Prepare STAR (Situation, Task, Action, Result) stories for common behavioral questions.\n5. MCQs: Revise core CS subjects (OS, Networks, DBMS, OOPs).\n\n---\n\n## Rejection Patterns\n- OA: Candidates often fail to solve 2+ questions or struggle with time constraints.\n- Technical Rounds: Poor problem-solving approach or lack of conceptual clarity leads to rejections.\n- Machine Coding: Poor design or inability to handle edge cases is a common issue.\n- HR Round: Misalignment with Meesho\u2019s culture or lack of preparation can result in rejection.", "Intern": "# Intern Role Structured Interview Briefing\n\n## Overview\nThe Intern role at Meesho is highly selective, with a multi-stage process including an Online Assessment, Coding Test, Low-Level Design, and Hiring Manager Round. The process evaluates coding proficiency, problem-solving, design skills, and cultural fit. Candidates are expected to demonstrate strong DSA skills, clean code, and a willingness to learn.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nDuration: 30\u2013105 minutes\nFormat: MCQs + Coding\nPlatform: NextLevel, HackerRank, or similar\n\n#### Common Questions:\nMCQs (20\u201330 questions):\n- Operating Systems (Processes, Threads, Memory Management)\n- Data Structures and Algorithms (Time Complexity, Space Complexity)\n- Computer Networks (OSI Model, DNS, ARP)\n- Error Handling (Debugging, Exception Management)\n\nCoding (3 questions, Medium/Hard):\n- Binary Search (Array manipulation)\n- Dynamic Programming (Segment Tree, LIS Revisited)\n- Graph Theory (Graph Colouring, Pathfinding in 2D Matrix)\n\nKey Focus:\n- Time management (Prioritize easy/medium questions first).\n- Edge case handling (e.g., large inputs, empty arrays).\n- Clean code (Proper variable naming, comments, modularity).\n\n---\n\n### 2. Coding Test\nDuration: 90\u2013105 minutes\nFormat: 2\u20133 coding questions (Medium/Hard)\nPlatform: HackerRank\n\n#### Common Questions:\n- Binary Search (Array manipulation)\n- Dynamic Programming (Segment Tree, LIS Revisited)\n- Graph Theory (Graph Colouring, Pathfinding in 2D Matrix)\n- Stack-Based Problems (e.g., Asteroid Collision)\n- Hashmap and String-Based Problems\n\nKey Focus:\n- Problem-solving approach (Explain thought process clearly).\n- Optimization (Time/space complexity analysis).\n- Debugging skills (Identify and fix bugs efficiently).\n\n---\n\n### 3. Low-Level Design Round\nDuration: 1.5 hours\nFormat: Design and implement a small system.\nPlatform: Virtual Whiteboard or HackerRank\n\n#### Common Problems:\n- Design an Inventory Management System (OOPs, SOLID Principles, Design Patterns)\n- Implement a Chat Application (Database Schema, APIs, Application Flow)\n\nKey Focus:\n- Modular design (Separation of concerns).\n- Scalability (Handling concurrent users, database design).\n- Test case coverage (Unit tests, edge cases).\n\n---\n\n### 4. Hiring Manager Round\nDuration: 45 minutes\nFormat: Project discussions, situational questions, and behavioral assessments.\n\n#### Common Topics:\n- Project Discussions (Tech stack, challenges, optimizations, trade-offs).\n- Situational Questions (e.g., Handling high-traffic scenarios).\n- Behavioral Questions (e.g., Teamwork, adaptability).\n\nKey Focus:\n- Cultural fit (Alignment with Meesho\u2019s values).\n- Problem-solving approach (How candidates tackle ambiguity).\n- Past experiences (Lessons learned, impact on projects).\n\n---\n\n## Preparation Tips\n1. DSA: Focus on Binary Search, Dynamic Programming, Graphs, and String Manipulation. Practice on platforms like LeetCode (Easy/Medium problems).\n2. Machine Coding: Implement OOPs concepts, design patterns, and scalability in your solutions.\n3. System Design: Study scalability patterns, database design, and caching strategies. Use resources like Grokking the System Design Interview.\n4. Behavioral: Prepare STAR (Situation, Task, Action, Result) stories for common behavioral questions.\n5. MCQs: Revise core CS subjects (OS, Networks, DBMS, OOPs).\n\n---\n\n## Rejection Patterns\n- OA: Candidates often fail to solve 2+ questions or struggle with time constraints.\n- Technical Rounds: Poor problem-solving approach or lack of conceptual clarity leads to rejections.\n- Machine Coding: Poor design or inability to handle edge cases is a common issue.\n- HR Round: Misalignment with Meesho\u2019s culture or lack of preparation can result in rejection.", "SDE-3 / Senior": "# SDE-3 / Senior Role Structured Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho is designed for experienced engineers with a focus on system design, scalability, and leadership. The process includes multiple technical rounds, machine coding, system design, and a bar raiser round. Candidates are expected to demonstrate deep technical expertise, scalability awareness, and the ability to lead complex projects.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Machine Coding Round\nDuration: 2 hours\nFormat: Design and implement a scalable system.\nPlatform: HackerRank or Virtual IDE\n\n#### Common Problems:\n- N Elevator System (Thread Safety, OOPs, State Management)\n- Inventory/Order Management Service (Concurrency Handling, LLD, Java Implementation)\n\nKey Focus:\n- Modular design (Separation of concerns).\n- Concurrency handling (Thread safety, race conditions).\n- Scalability considerations (Database design, caching).\n- Clean code (Proper variable naming, comments, modularity).\n\n---\n\n### 2. System Design Round\nDuration: 1.5 hours\nFormat: High-Level Design (HLD) and Low-Level Design (LLD) discussion.\n\n#### Common Problems:\n- Design a Custom Ad Service (Scalability, Microservices Architecture)\n- Design a Trading Platform (Real-time data processing, API design)\n- Design a Rule Engine (Handling millions of rules, rule collisions, scheduling)\n\nKey Focus:\n- Database design (SQL vs. NoSQL, indexing strategies).\n- API design (RESTful principles, pagination).\n- Caching strategies (Redis, Memcached).\n- Scalability and load balancing (Microservices vs. Monolith).\n- Consistency models (Strong vs. Eventual Consistency).\n\n---\n\n### 3. Bar Raiser Round\nDuration: 1 hour\nFormat: Follow-up on weaker areas, scenario-based questions.\n\n#### Common Topics:\n- Distributed Systems Design (Scalability, Fault Tolerance)\n- Algorithms (Graph Theory, Dynamic Programming)\n- Scenario-Based Questions (e.g., Handling high-traffic scenarios)\n\nKey Focus:\n- Problem-solving approach (Explain thought process clearly).\n- Optimization (Time/space complexity analysis).\n- Leadership and collaboration (How candidates handle ambiguity).\n\n---\n\n### 4. Hiring Manager Round\nDuration: 1 hour\nFormat: Project discussions, leadership questions, and cultural fit assessment.\n\n#### Common Topics:\n- Project Discussions (Tech stack, challenges, optimizations, trade-offs).\n- Leadership Experiences (Handling teams, mentoring, conflict resolution).\n- Behavioral Questions (e.g., Handling failures, adaptability).\n\nKey Focus:\n- Cultural fit (Alignment with Meesho\u2019s values).\n- Problem-solving approach (How candidates tackle ambiguity).\n- Past experiences (Lessons learned, impact on projects).\n\n---\n\n## Preparation Tips\n1. Machine Coding: Focus on scalability, concurrency, and clean code. Practice implementing OOPs concepts, design patterns, and thread safety.\n2. System Design: Study scalability patterns, database design, and caching strategies. Use resources like Grokking the System Design Interview.\n3. Bar Raiser Round: Revise distributed systems, algorithms, and scenario-based questions.\n4. Behavioral: Prepare STAR (Situation, Task, Action, Result) stories for leadership and behavioral questions.\n\n---\n\n## Rejection Patterns\n- Machine Coding: Candidates often struggle with scalability or concurrency issues.\n- System Design: Lack of scalability awareness or trade-off discussions leads to rejections.\n- Bar Raiser Round: Poor problem-solving approach or lack of depth in distributed systems can be a dealbreaker.\n- HR Round: Misalignment with Meesho\u2019s culture or lack of leadership examples may result in rejection."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho\u2019s hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, system design, and practical implementation. Candidates across all roles\u2014from SDE-1 to SDE-3\u2014typically undergo multiple rounds of technical assessments, including coding, machine coding, system design, and managerial discussions. The process is designed to evaluate depth of technical knowledge, scalability thinking, and real-world problem-solving skills, with a notable focus on backend systems, algorithms, and low-level design for mid-to-senior roles. Rejections often stem from inconsistent performance in machine coding rounds or lack of preparation in system design, while successful candidates demonstrate strong debugging, optimization, and design pattern application skills.", "by_role": {"SDE-2": "# SDE-2 Role Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves 3-4 rounds of interviews, focusing on Data Structures and Algorithms (DSA), Machine Coding, System Design, and Hiring Manager discussions. Candidates are expected to demonstrate strong problem-solving skills, scalable design thinking, and practical implementation expertise. The process is highly selective, with rejections often occurring in machine coding or system design rounds due to incomplete implementations or scalability oversights.\n\n---\n\n## Round Breakdown and Long-Tail Questions\n\n### 1. Problem Solving and Data Structures (PS-DS) / Technical Round\nFormat: 1-hour round with 2 coding questions (LeetCode medium-hard difficulty).\nPlatform: HackerRank or LeetCode.\nSuccess Criteria: Solve both problems with optimal time and space complexity.\n\n#### Exact Questions Asked:\n1. Minimum Steps to Reach Target by a Knight (Coding Ninjas/LeetCode)\n - Problem: Find the minimum number of steps required for a knight to reach a target position on a chessboard.\n - Expected Approach: BFS (Breadth-First Search) for shortest path in unweighted grid.\n - Edge Cases: Boundary conditions, unreachable targets.\n\n2. Remove All Adjacent Duplicates in String II (LeetCode)\n - Problem: Remove adjacent duplicate characters from a string, reducing the string by k duplicates at a time.\n - Expected Approach: Stack-based solution for efficient removal and tracking.\n - Variations: Handle cases where k is dynamic or part of the input.\n\n3. Asteroid Collision (LeetCode)\n - Problem: Simulate the collision of asteroids in a row, where positive and negative values represent direction and size.\n - Expected Approach: Stack-based simulation to handle collisions and direction changes.\n\n4. Course Schedule II (LeetCode)\n - Problem: Find the order of courses to take given prerequisites (topological sorting).\n - Expected Approach: Kahn\u2019s algorithm or DFS-based topological sort.\n\n5. Container With Most Water (LeetCode)\n - Problem: Maximize the area of water contained between two vertical lines.\n - Expected Approach: Two-pointer technique for optimal solution.\n\n6. Number of Islands (LeetCode)\n - Problem: Count the number of connected components (islands) in a 2D grid.\n - Expected Approach: DFS/BFS to mark visited cells and count components.\n\n7. Infinite Grid Problem (Knight\u2019s Moves)\n - Problem: Calculate the number of ways a knight can move from (x, y) to (p, q) on an infinite grid.\n - Expected Approach: Dynamic Programming with memoization or BFS for state transitions.\n\n---\n\n### 2. Machine Coding Round\nFormat: 1.5\u20132-hour round focused on designing and implementing a system with specific functionalities.\nPlatform: HackerRank (remote coding environment).\nSuccess Criteria: Write clean, modular, and scalable code with proper error handling and test cases.\n\n#### Exact Problems Asked:\n1. Snake & Ladder Game Design\n - Requirements: Implement the classic Snake & Ladder game with dice rolls, snake/ladder jumps, and winner determination.\n - Expected Features:\n - Player movement based on dice rolls.\n - Snake and ladder logic (jump to specified positions).\n - Winner detection (first to reach 100).\n - Support for N players.\n - Evaluation Criteria:\n - Correctness of game logic.\n - Code modularity (separate classes for Board, Player, Dice).\n - Handling edge cases (e.g., invalid dice rolls, simultaneous wins).\n\n2. Ride-Sharing Application Features\n - Requirements: Implement two core features for a ride-sharing app:\n - Feature 1: Assign a ride to a driver based on proximity and availability.\n - Feature 2: Calculate the fare dynamically based on distance, time, and surge pricing.\n - Expected Features:\n - Driver and rider location tracking.\n - Real-time assignment logic.\n - Fare calculation with surge multipliers.\n - Evaluation Criteria:\n - Efficient data structures for proximity searches (e.g., KD-Tree, Quad-Tree).\n - Clean API design (e.g., assignRide(), calculateFare()).\n - Handling concurrent ride requests.\n\n3. Facebook-like Newsfeed System\n - Requirements: Design a system where users can post, follow others, and generate a paginated newsfeed.\n - Expected Features:\n - User registration and follow/unfollow functionality.\n - Post creation and storage.\n - Newsfeed generation (sorted by recency and relevance).\n - Pagination support for large datasets.\n - Evaluation Criteria:\n - Use of design patterns (e.g., Observer for follow notifications).\n - Database schema design (e.g., Users, Posts, Follows tables).\n - Efficient newsfeed generation (e.g., precomputed feeds or real-time aggregation).\n\n4. Inventory Management System\n - Requirements: Design a system for an e-commerce platform to manage inventory, orders, and product listings.\n - Expected Features:\n - Add/remove products with stock tracking.\n - Create and confirm orders (block inventory until confirmation).\n - Generate inventory reports (e.g., low-stock alerts).\n - Evaluation Criteria:\n - Thread-safe inventory updates (for concurrent orders).\n - Use of SOLID principles (e.g., InventoryService, OrderService).\n - Handling edge cases (e.g., overselling, race conditions).\n\n---\n\n### 3. System Design Round\nFormat: 1-hour round focused on high-level and low-level design of scalable systems.\nSuccess Criteria: Demonstrate depth in design trade-offs, scalability considerations, and practical implementation.\n\n#### Exact Problems Asked:\n1. Twitter News Feed System\n - Requirements: Design the backend for a Twitter-like news feed, including tweet creation, follow relationships, and feed generation.\n - Expected Discussion Points:\n - High-Level Design:\n - Data models for Users, Tweets, Follows.\n - Feed generation algorithms (e.g., fan-out-on-write vs. fan-out-on-read).\n - Low-Level Design:\n - Database schema (SQL vs. NoSQL trade-offs).\n - Caching strategies (e.g., Redis for trending tweets).\n - Handling celebrities with millions of followers (sharding strategies).\n - Scalability:\n - Load balancing for tweet creation and feed generation.\n - Database sharding based on user ID.\n\n2. Ranking and Review System for E-Commerce\n - Requirements: Design a system to rank products based on ratings, recency, and user engagement (e.g., likes/dislikes).\n - Expected Discussion Points:\n - High-Level Design:\n - Ranking algorithm (e.g., weighted scoring based on ratings and time decay).\n - Database design (e.g., Products, Reviews, Ratings tables).\n - Low-Level Design:\n - API endpoints (e.g., getProductList(), addReview()).\n - Handling duplicate reviews and spam detection.\n - Scalability:\n - Caching product rankings (e.g., Redis sorted sets).\n - Batch processing for ranking updates.\n\n3. Rule Engine System\n - Requirements: Design a system to manage rules that increment/decrement values from third-party APIs (e.g., time-based pricing rules).\n - Expected Discussion Points:\n - High-Level Design:\n - Rule scheduling (e.g., cron jobs, event-driven triggers).\n - Conflict resolution for overlapping rules.\n - Low-Level Design:\n - Rule representation (e.g., JSON-based DSL).\n - State management for rule execution (e.g., idempotency keys).\n - Scalability:\n - Handling millions of rules (e.g., sharding by rule ID).\n - Real-time rule evaluation for high-throughput systems.\n\n---\n\n### 4. Hiring Manager Round\nFormat: 1-hour round focused on project discussions, behavioral questions, and cultural fit.\nSuccess Criteria: Demonstrate clarity in past project contributions, problem-solving under constraints, and alignment with Meesho\u2019s values.\n\n#### Key Discussion Areas:\n1. Project Deep Dive:\n - Explain your role in the project, challenges faced, and solutions implemented.\n - Discuss tech stack choices (e.g., why Spring Boot over Node.js?).\n - Highlight scalability improvements (e.g., database optimizations, caching strategies).\n\n2. Behavioral Questions:\n - Describe a time you debugged a complex issue in production.\n - How do you handle conflicting priorities in a fast-paced environment?\n - Give an example of a failure and how you recovered.\n\n3. Java-Specific Questions (if applicable):\n - Explain garbage collection and its impact on performance.\n - Discuss thread safety in concurrent applications.\n - Compare SQL vs. NoSQL for a given use case.\n\n---\n\n## Common Pitfalls and How to Avoid Them\n| Pitfall | How to Avoid |\n|----------------------------------|-----------------------------------------------------------------------------------|\n| Incomplete machine coding solutions | Practice designing systems with time constraints (e.g., 90-minute sprints). |\n| Over-engineering in system design | Focus on scalability and trade-offs (e.g., "Why not use a monolith here?"). |\n| Weak DSA fundamentals | Revise Dynamic Programming, Graphs, and Trees for optimal solutions. |\n| Poor communication in HM round | Practice explaining technical decisions clearly and concisely to non-technical stakeholders. |", "SDE-1 / New Grad": "# SDE-1 / New Grad Role Structured Interview Briefing\n\n## Overview\nThe SDE-1 / New Grad hiring process at Meesho is highly competitive, with a strong emphasis on foundational DSA skills, problem-solving under time constraints, and system design basics. The process typically includes 4-5 rounds, starting with an Online Assessment (OA) followed by technical interviews, machine coding, and HR rounds. Candidates with strong CGPAs (7.0+) from circuit branches are often shortlisted, and success hinges on solving 2+ medium-hard problems in the OA and demonstrating clean coding practices in subsequent rounds.\n\n---\n\n## Round Breakdown and Long-Tail Questions\n\n### 1. Online Assessment (OA)\nFormat: 75\u2013100 minutes with 3 coding questions (medium-hard difficulty) and 10\u201320 MCQs (DSA, OS, CN, OOPs).\nPlatform: HackerRank or similar.\nSuccess Criteria: Solve 2+ coding problems and score well in MCQs.\n\n#### Exact Questions Asked:\n1. Weighted Job Scheduling (GeeksforGeeks/LeetCode)\n - Problem: Schedule jobs to maximize profit, given start time, end time, and weight.\n - Expected Approach: Dynamic Programming with binary search for optimization.\n - Variations: Handle overlapping jobs or dynamic weights.\n\n2. Minimum Number of Characters to Make Two Strings Anagram (LeetCode)\n - Problem: Find the minimum number of character changes required to make two strings anagrams.\n - Expected Approach: Frequency counting and comparison.\n\n3. Chocolate Distribution Problem (GeeksforGeeks)\n - Problem: Distribute chocolates to minimize the maximum difference between any two students.\n - Expected Approach: Sorting and greedy selection.\n\n4. Longest Increasing Subsequence (LIS) Revisited (LeetCode)\n - Problem: Find the length of the longest subsequence where elements are in increasing order.\n - Expected Approach: Dynamic Programming with O(n\u00b2) or O(n log n) optimization.\n\n5. Graph Colouring Problem (GeeksforGeeks)\n - Problem: Color a graph with the minimum number of colors such that no two adjacent nodes have the same color.\n - Expected Approach: Backtracking or greedy coloring with BFS/DFS.\n\n6. Number of Islands (Extension) (LeetCode)\n - Problem: Count islands in a grid where cells are connected horizontally or vertically.\n - Expected Approach: DFS/BFS to mark visited cells.\n\n7. Activity Selection Problem (GeeksforGeeks)\n - Problem: Select the maximum number of activities that don\u2019t overlap.\n - Expected Approach: Greedy algorithm (sort by finish time).\n\n8. Watering Plants (GeeksforGegeks)\n - Problem: Optimize the watering of plants arranged in a row with specific constraints.\n - Expected Approach: Greedy strategy with sliding window.\n\n---\n\n### 2. Technical Interview 1 (Coding Focus)\nFormat: 1.5-hour round with 2 coding questions (LeetCode medium-hard).\nPlatform: HackerRank CodePair.\nSuccess Criteria: Write bug-free, optimal code with all test cases passed.\n\n#### Exact Questions Asked:\n1. Activity Selection Problem (Variation)\n - Problem: Select the maximum number of non-overlapping activities with weighted profits.\n - Expected Approach: Greedy with dynamic programming for optimization.\n\n2. Watering Plants (Greedy Approach)\n - Problem: Optimize water distribution to plants in a row with constraints.\n - Expected Approach: Sliding window or two-pointer technique.\n\n---\n\n### 3. Technical Interview 2 (CS Fundamentals + DSA)\nFormat: 1-hour round focused on CS fundamentals, DSA, and project discussions.\nSuccess Criteria: Demonstrate depth in computer science concepts and ability to explain trade-offs.\n\n#### Exact Discussion Areas:\n1. Operating Systems:\n - Semaphores vs. Mutex.\n - Paging vs. Virtual Memory.\n - Threading in Java (e.g., Runnable vs. Thread).\n\n2. Databases:\n - SQL vs. NoSQL (use cases, trade-offs).\n - Normalization (1NF, 2NF, 3NF).\n - ACID properties.\n\n3. Computer Networks:\n - ARP vs. DNS.\n - OSI model layers.\n\n4. Data Structures:\n - Inner workings of vector in C++ (insert/delete complexities).\n - BST vs. Hash Table (search/insert complexities).\n\n5. Project Discussions:\n - Explain your tech stack choices and alternatives considered.\n - Discuss optimizations made in past projects.\n\n---\n\n### 4. System Design Round (for Selected Candidates)\nFormat: 1-hour round focused on basic system design principles.\nSuccess Criteria: Demonstrate understanding of scalability, database design, and API design.\n\n#### Exact Problems Asked:\n1. Design a Cab Booking System\n - Requirements: Implement a system for booking cabs with features like:\n - Driver and rider matching.\n - Ride status tracking (booked, in-progress, completed).\n - Fare calculation.\n - Expected Discussion Points:\n - High-Level Design:\n - Data models for Users, Drivers, Rides.\n - Real-time matching algorithms (e.g., proximity-based).\n - Low-Level Design:\n - Database schema (SQL for transactions, NoSQL for scalability).\n - API endpoints (e.g., bookRide(), trackRide()).\n - Scalability:\n - Load balancing for ride requests.\n - Caching for frequently accessed data (e.g., driver locations).\n\n2. Design an OTP System\n - Requirements: Design a system to generate, validate, and distribute OTPs for authentication.\n - Expected Discussion Points:\n - High-Level Design:\n - Components: OTP generator, storage, validator.\n - Integration with user registration/login flows.\n - Low-Level Design:\n - Database schema (e.g., OTPs table with TTL).\n - API design (e.g., generateOTP(), validateOTP()).\n - Scalability:\n - Handling high OTP generation rates (e.g., Redis for caching).\n - Rate-limiting to prevent abuse.\n\n---\n\n### 5. HR/Technical Round\nFormat: 1-hour round focused on project deep dives, real-world scenarios, and behavioral questions.\nSuccess Criteria: Demonstrate clarity in past work, problem-solving under constraints, and alignment with Meesho\u2019s culture.\n\n#### Key Discussion Areas:\n1. Project Deep Dive:\n - Explain your role in the project and challenges faced.\n - Discuss tech stack choices and optimizations.\n\n2. Real-World Scenarios:\n - Sale Scenario: How would you ensure exactly X purchases occur during a sale with high demand?\n - Project Reset: How would you handle a project where your approach is deemed wrong after 3\u20134 days?\n\n3. Behavioral Questions:\n - Describe a time you debugged a production issue.\n - How do you prioritize tasks in a fast-paced environment?\n\n---\n\n## Common Pitfalls and How to Avoid Them\n| Pitfall | How to Avoid |\n|----------------------------------|-----------------------------------------------------------------------------------|\n| Weak DSA fundamentals | Practice LeetCode medium-hard problems (e.g., DP, Graphs, Trees). |\n| Poor time management in OA | Simulate time-constrained coding environments (e.g., 45 minutes per problem).|\n| Over-engineering in system design | Focus on scalable but simple designs (e.g., avoid premature optimization). |\n| Weak CS fundamentals | Revise OS, DBMS, and Networks for Technical Interview 2. |\n| Unclear project explanations | Practice explaining projects succinctly with key contributions highlighted. |", "Intern": "# Intern Role Structured Interview Briefing\n\n## Overview\nThe Intern hiring process at Meesho is highly selective, with a multi-stage evaluation including online assessments, coding tests, low-level design, and hiring manager rounds. Candidates are expected to demonstrate strong foundational knowledge in DSA, problem-solving under time constraints, and basic system design skills. The process is designed to identify high-potential candidates who can contribute to Meesho\u2019s engineering teams, with a focus on backend systems, algorithms, and practical implementation.\n\n---\n\n## Round Breakdown and Long-Tail Questions\n\n### 1. Online Test (NextLevel Screening)\nFormat: 30-minute multiple-choice questions (MCQs) covering:\n- Operating Systems\n- Data Structures and Algorithms (DSA)\n- Computer Networks\n- Error Handling\nPlatform: NextLevel mobile app (AI-evaluated verbal questions).\nSuccess Criteria: Score well in DSA and OS sections.\n\n---\n\n### 2. Coding Test (HackerRank)\nFormat: 105 minutes with 3 coding problems (medium to hard difficulty).\nPlatform: HackerRank.\nSuccess Criteria: Solve all 3 problems or 2+ with optimal solutions.\n\n#### Exact Questions Asked:\n1. Binary Search Problem (GeeksforGeeks)\n - Problem: Implement binary search on a rotated sorted array.\n - Expected Approach: Modified binary search to handle rotation.\n\n2. Dynamic Programming (DP) Problem\n - Problem: Solve a classic DP problem (e.g., Longest Common Subsequence or Knapsack).\n - Expected Approach: Memoization or tabulation for optimal solution.\n\n3. Segment Tree Problem (GeeksforGeeks)\n - Problem: Implement a segment tree for range queries (e.g., sum, min, max).\n - Expected Approach: Build and query the segment tree efficiently.\n\n---\n\n### 3. Low-Level Design Round\nFormat: 90-minute virtual interview focusing on designing a system with specific requirements.\nPlatform: HackerRank CodePair.\nSuccess Criteria: Write modular, clean, and scalable code using SOLID principles and design patterns.\n\n#### Exact Problem Asked:\n1. Inventory Management System\n - Requirements: Design a system to manage inventory for an e-commerce platform with the following features:\n - Add/remove products with stock tracking.\n - Create orders and confirm them (block inventory until confirmation).\n - Generate inventory reports (e.g., low-stock alerts).\n - Expected Features:\n - Classes: Product, Inventory, Order, OrderService.\n - Methods: addProduct(), createOrder(), confirmOrder(), getInventory().\n - Design Patterns: Singleton for Inventory, Observer for low-stock alerts.\n - Evaluation Criteria:\n - Correctness of inventory logic.\n - Thread safety for concurrent orders.\n - Clean code with proper error handling.\n\n---\n\n### 4. Hiring Manager Round\nFormat: 45-minute virtual interview focused on situational questions, project discussions, and cultural fit.\nSuccess Criteria: Demonstrate clarity in past work, problem-solving under constraints, and alignment with Meesho\u2019s values.\n\n#### Key Discussion Areas:\n1. Project Deep Dive:\n - Explain your role in the project and challenges faced.\n - Discuss tech stack choices and optimizations.\n\n2. Situational Questions:\n - Design a chat application (discuss database schema, APIs, and flow).\n - How would you handle high-traffic scenarios?\n\n3. Behavioral Questions:\n - Describe a time you debugged a complex issue.\n - How do you handle feedback in a team environment?\n\n---\n\n## Common Pitfalls and How to Avoid Them\n| Pitfall | How to Avoid |\n|----------------------------------|-----------------------------------------------------------------------------------|\n| Weak DSA fundamentals | Practice LeetCode medium problems (e.g., Binary Search, DP, Segment Trees). |\n| Poor time management in coding | Simulate time-constrained environments (e.g., 30 minutes per problem). |\n| Incomplete LLD solutions | Focus on modularity and scalability (e.g., use design patterns). |\n| Unclear project explanations | Practice explaining projects succinctly with key contributions highlighted. |", "SDE-3 / Senior": "# SDE-3 / Senior Role Structured Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho targets experienced engineers (4+ years) with a strong focus on scalable system design, distributed systems, and leadership in technical decision-making. The interview process is rigorous, involving machine coding, system design, bar raiser rounds, and managerial discussions. Candidates are expected to demonstrate depth in algorithms, distributed systems, and practical implementation while showcasing ability to mentor junior engineers and drive architectural decisions.\n\n---\n\n## Round Breakdown and Long-Tail Questions\n\n### 1. Machine Coding Round\nFormat: 2-hour remote coding session focused on designing and implementing a complex system.\nPlatform: HackerRank.\nSuccess Criteria: Write clean, modular, thread-safe, and scalable code with comprehensive test cases.\n\n#### Exact Problems Asked:\n1. N Elevator System Design\n - Requirements: Implement a system for N elevators with the following features:\n - Handle multiple elevator requests efficiently.\n - Optimize for passenger wait time and energy efficiency.\n - Support emergency stops and maintenance modes.\n - Expected Features:\n - Classes: Elevator, ElevatorController, RequestQueue.\n - Methods: requestElevator(), moveElevator(), handleEmergency().\n - Thread Safety: Use locks/mutexes for concurrent requests.\n - Evaluation Criteria:\n - Correctness of elevator algorithm (e.g., SCAN, LOOK).\n - Clean OOP design with separation of concerns.\n - Handling edge cases (e.g., elevator breakdown, capacity limits).\n\n2. Inventory/Order Management Service\n - Requirements: Design a service to manage inventory and orders for an e-commerce platform with:\n - Real-time inventory tracking.\n - Order creation and confirmation (block inventory until confirmation).\n - Scalable handling of concurrent users and high throughput.\n - Expected Features:\n - APIs: addProduct(), createOrder(), confirmOrder(), getInventory().\n - Database: SQL for transactions, NoSQL for scalability.\n - Concurrency: Use optimistic/pessimistic locking for inventory updates.\n - Evaluation Criteria:\n - Thread-safe inventory management.\n - Scalable database design (e.g., sharding by product ID).\n - Clean code with proper error handling and logging.\n\n---\n\n### 2. System Design Round\nFormat: 1.5-hour design round focused on scalable, distributed systems.\nSuccess Criteria: Demonstrate depth in architecture trade-offs, scalability, and practical implementation.\n\n#### Exact Problems Asked:\n1. Trading Platform (Similar to Stock Exchange)\n - Requirements: Design a backend for a trading platform with:\n - Order matching (buy/sell).\n - Real-time price updates.\n - User portfolio management.\n - Expected Discussion Points:\n - High-Level Design:\n - Components: OrderBook, MatchingEngine, UserService.\n - Data models: Orders, Portfolios, Transactions.\n - Low-Level Design:\n - Distributed order matching (e.g., Kafka for event streaming).\n - Database design (SQL for transactions, NoSQL for scalability).\n - Scalability:\n - Sharding strategies (e.g., by user ID or stock symbol).\n - Caching for real-time price updates (e.g., Redis).\n - Trade-offs:\n - Consistency vs. availability (CAP theorem).\n - Eventual consistency for portfolio updates.\n\n2. Custom Ad Service\n - Requirements: Design an ad service for Meesho\u2019s e-commerce platform with:\n - Targeted ad delivery (user-based, context-based).\n - Budget management for advertisers.\n - Real-time analytics.\n - Expected Discussion Points:\n - High-Level Design:\n - Components: AdServer, TargetingEngine, AnalyticsService.\n - Data models: Ads, Campaigns, UserProfiles.\n - Low-Level Design:\n - Ad auction algorithm (e.g., Vickrey auction).\n - Database design (e.g., columnar storage for analytics).\n - Scalability:\n - Microservices architecture for ad delivery.\n - Batch processing for analytics (e.g., Spark).\n\n---\n\n### 3. Bar Raiser Round\nFormat: 1-hour follow-up round focused on weak areas from previous rounds.\nSuccess Criteria: Demonstrate depth in algorithms, distributed systems, and scenario-based problem-solving.\n\n#### Exact Discussion Areas:\n1. Distributed Systems Design:\n - Design a distributed cache (e.g., Redis cluster).\n - Discuss consistency models (e.g., strong vs. eventual consistency).\n\n2. Algorithms:\n - Solve a distributed system algorithm (e.g., leader election in a cluster).\n - Discuss time complexity and scalability implications.\n\n3. Scenario-Based Questions:\n - How would you handle a database outage in a distributed system?\n - Design a fault-tolerant payment system for an e-commerce platform.\n\n---\n\n### 4. Non-Technical / Managerial Round\nFormat: 1-hour HR and hiring manager round focused on leadership, cultural fit, and long-term vision.\nSuccess Criteria: Demonstrate clarity in career goals, ability to mentor, and alignment with Meesho\u2019s culture.\n\n#### Key Discussion Areas:\n1. Leadership and Mentorship:\n - Describe your experience mentoring junior engineers.\n - How do you handle disagreements in technical decisions?\n\n2. Project Deep Dive:\n - Discuss your most impactful project and lessons learned.\n - How did you drive architectural decisions in past roles?\n\n3. Cultural Fit:\n - What principles and values do you prioritize in a team?\n - How do you handle ambiguity in fast-paced environments?\n\n---\n\n## Common Pitfalls and How to Avoid Them\n| Pitfall | How to Avoid |\n|----------------------------------|-----------------------------------------------------------------------------------|\n| Weak system design fundamentals | Practice scalable architecture patterns (e.g., microservices, CQRS). |\n| Poor thread safety in machine coding | Focus on concurrency patterns (e.g., locks, semaphores, atomic operations). |\n| Over-engineering solutions | Prioritize simplicity and maintainability over premature optimization. |\n| Weak leadership examples | Prepare concrete examples of mentoring, conflict resolution, and decision-making. |", "Other": "# Miscellaneous Roles Structured Interview Briefing\n\n## Overview\nMeesho\u2019s interview process for non-standard roles (e.g., frontend, off-campus, or lateral hires) varies widely depending on the specific requirements of the role. However, all processes emphasize strong problem-solving skills, practical implementation, and cultural fit. For frontend roles, the focus is on JavaScript/React expertise and system design, while off-campus hires often undergo multiple technical rounds + managerial discussions to evaluate depth and adaptability.\n\n---\n\n## Round Breakdown and Long-Tail Questions\n\n### 1. Frontend Role (SDE-2 Frontend)\nFormat: 3 rounds (Technical, Technical, Managerial).\nSuccess Criteria: Demonstrate strong JavaScript/React skills, problem-solving, and system design basics.\n\n#### Exact Questions Asked:\n1. Technical Round 1 (JavaScript Focus):\n - Polyfill for groupBy (Lodash):\n - Problem: Implement a groupBy function that groups array elements by a key.\n - Expected Approach: Use object keys and Array.reduce().\n - Hoisting in JavaScript:\n - Explain hoisting with examples for var, let, and const.\n - Call/Apply/Bind:\n - Compare call, apply, and bind with code examples.\n - Responsive UI:\n - Discuss techniques for responsive design (e.g., media queries, Flexbox).\n - Service Workers:\n - Explain service workers and their use cases (e.g., offline caching).\n - Closures in JavaScript:\n - Explain closures with examples.\n\n2. Technical Round 2 (React Focus):\n - New Features in React 18:\n - Discuss concurrent rendering, Suspense, and useTransition.\n - localStorage vs. Cookies:\n - Compare localStorage and cookies for state management.\n - Var vs. Let vs. Const:\n - Explain scoping differences with code snippets.\n - Project Discussions:\n - Explain JWT Token and access token/refresh token architecture in past projects.\n - Code Predictions:\n - Predict outputs for setTimeout, promises, and useRef code snippets.\n - Pagination Component:\n - Convert a React component to a paginated version with previous/next buttons.\n\n---\n\n### 2. Off-Campus Hiring (General SDE-2)\nFormat: 5+ rounds (HR, Technical, Technical, Case Studies, On-Site, HR).\nSuccess Criteria: Demonstrate depth in DSA, system design, and real-world problem-solving.\n\n#### Expected Discussion Areas (No Exact Questions Provided):\n1. HR Round:\n - Initial screening for cultural fit and values.\n\n2. Technical Rounds:\n - Data Structures and Algorithms:\n - Focus on Dynamic Programming, Graphs, and Trees.\n - Low-Level Design:\n - Design patterns (e.g., Singleton, Factory) and OOP principles.\n - Case Studies/Projects:\n - Deep dive into past projects, tech stack choices, and optimizations.\n\n3. On-Site Rounds:\n - System Design:\n - Design scalable systems (e.g., cab booking, OTP system).\n - Behavioral Questions:\n - Discuss scenarios, principles, and values.\n\n---\n\n## Common Pitfalls and How to Avoid Them\n| Pitfall | How to Avoid |\n|----------------------------------|-----------------------------------------------------------------------------------|\n| Weak JavaScript fundamentals | Revise closures, hoisting, and this binding in JavaScript. |\n| Poor React project explanations | Practice explaining tech stack choices and optimizations in past projects.|\n| Incomplete system design | Focus on scalability and trade-offs (e.g., SQL vs. NoSQL). |\n| Weak behavioral examples | Prepare concrete examples of conflict resolution and teamwork. |"}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho's hiring process is structured to assess both technical depth and problem-solving ability, with a strong emphasis on Machine Coding, System Design, and DSA (Data Structures and Algorithms). The process varies by role, but consistently includes a technical screening, a machine coding round, and higher-level design discussions for mid-to-senior roles. Rejections often stem from gaps in implementation skills, scalability considerations, or behavioral fit, while offers are extended to candidates demonstrating clarity in thought, practical coding ability, and alignment with Meesho\u2019s fast-paced, collaborative culture.", "by_role": {"SDE-2": "# SDE-2 Role Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves three core rounds: a technical screening (DSA), a machine coding round, and a system design/hiring manager round. Candidates with 2-4 years of experience are expected to demonstrate proficiency in algorithms, system design, and real-world implementation.\n\n---\n\n## Round Breakdown\n\n### Round 1: Technical Screening (DSA)\n- Format: 1-hour round with 2 coding problems.\n- Platform: HackerRank or LeetCode.\n- Focus: Medium to hard-level DSA problems.\n- Topics: Dynamic Programming, Graphs, Trees, Arrays, Strings.\n- Example Questions:\n 1. Course Schedule II\n 2. Container With Most Water\n 3. Asteroid Collision\n 4. Matrix problems (e.g., connected components, Number of Islands variants).\n\n---\n\n### Round 2: Machine Coding\n- Format: 1.5\u20132-hour round focused on implementation and design. \n- Platform: HackerRank or virtual IDE.\n- Focus: Clean code, scalability, and adherence to requirements.\n- Example Problems:\n 1. Snake & Ladder Game Design\n 2. Facebook-like Newsfeed System (Posting, Following, Pagination)\n 3. Inventory Management System (Add/Remove Products, Order Processing)\n 4. Social Media System (Create Post, Delete Post, Get Feed, Follow/Unfollow).\n\n---\n\n### Round 3: System Design + Hiring Manager\n- Format: 1-hour round combining system design and behavioral/project discussion.\n- Focus: High-Level Design (HLD), Low-Level Design (LLD), and project deep dives.\n- Example Problems:\n 1. Design a Ranking and Review System (e-commerce):\n - Requirements: User reviews, ratings, sorting, filtering, likes/dislikes.\n - Deliverables: HLD, database design, getProductList() API.\n - Follow-ups: SQL vs. NoSQL, MongoDB vs. Redis, Consistency models.\n 2. Twitter News Feed System (HLD).\n 3. Rule Engine System (Increment/Decrement values via APIs, scheduling rules).\n\n---\n\n## Key Takeaways\n- Success Factors: Strong DSA fundamentals, ability to write clean, scalable code, and design trade-offs in system design.\n- Common Pitfalls: Struggles with time management in machine coding, scalability oversights in system design, or behavioral misalignment in HM rounds.\n- Preparation Tips:\n - Practice medium-hard DSA problems on HackerRank/LeetCode.\n - Focus on machine coding with design patterns (e.g., Singleton, Observer).\n - Study system design for e-commerce, social media, and real-time systems.", "SDE-1 / New Grad": "# SDE-1 / New Grad Interview Briefing\n\n## Overview\nThe SDE-1 / New Grad role at Meesho is highly competitive, with a rigorous multi-round process including an Online Assessment (OA), technical interviews, and HR rounds. Candidates are expected to demonstrate strong DSA skills, problem-solving ability, and fundamental system design knowledge.\n\n---\n\n## Round Breakdown\n\n### Round 1: Online Assessment (OA)\n- Format: 75\u2013105 minutes, 3 coding problems (easy to hard) + 10\u201330 MCQs.\n- Platform: HackerRank or NextLevel Screening Test.\n- Focus: DSA, Computer Science Fundamentals (OS, DBMS, Networking), and coding speed.\n- Example Questions:\n 1. Coding:\n - Weighted Job Scheduling (DP + Binary Search).\n - Minimum Degree of a Connected Trio in a Graph.\n - Rectangle Area II.\n 2. MCQs:\n - Operating Systems (Semaphores vs. Mutex, Paging).\n - DBMS (SQL vs. NoSQL, Normalization, ACID).\n - Networking (OSI Model, DNS, ARP).\n - Programming (C++/Java Outputs, OOPs).\n\n---\n\n### Round 2: Technical Interview 1 (DSA Focus)\n- Format: 1\u20131.5-hour round with 2 coding problems.\n- Platform: HackerRank CodePair.\n- Focus: DSA problems with time and space complexity considerations.\n- Example Questions:\n 1. Activity Selection Problem (Greedy).\n 2. Watering Plants (Greedy).\n 3. Extension of Number of Islands (Graph Traversal).\n 4. Stock Price Optimization (Array/HashMap).\n\n---\n\n### Round 3: Technical Interview 2 (CS Fundamentals + Projects)\n- Format: 1-hour round with CS fundamentals and project discussions.\n- Focus: Deep dive into Operating Systems, DBMS, Networking, and OOPs.\n- Example Topics:\n 1. Operating Systems:\n - Semaphores vs. Mutex.\n - Paging vs. Virtual Memory.\n - Threading in Java.\n 2. DBMS:\n - SQL vs. NoSQL.\n - Normalization.\n - ACID Properties.\n 3. Networking:\n - OSI Model.\n - DNS/ARP.\n 4. OOPs:\n - Inner workings of vector in C++.\n - Singleton Class.\n - String Builder/Buffer.\n\n---\n\n### Round 4: HR/Technical Round (Project Deep Dive)\n- Format: 1-hour round with situational questions and project optimization.\n- Focus: Real-world scenarios, optimization, and tech stack choices.\n- Example Questions:\n 1. Optimize solutions from the OA.\n 2. Tech Stack Choices: Why chose X over Y? Alternatives?\n 3. Real-World Scenarios:\n - Handling a sale with limited inventory and high demand.\n - Restarting a project from scratch after 3\u20134 days.\n 4. GitHub Review: Code walkthroughs and improvements.\n\n---\n\n## Key Takeaways\n- Success Factors: Strong DSA skills, CS fundamentals, and project depth.\n- Common Pitfalls: Time management in OA, lack of clarity in project discussions, or weak CS fundamentals.\n- Preparation Tips:\n - Practice DSA problems on HackerRank/LeetCode.\n - Study CS fundamentals (OS, DBMS, Networking).\n - Prepare project case studies with optimization plans.", "Intern": "# Intern Role Interview Briefing\n\n## Overview\nThe Intern role at Meesho is designed to identify early talent with a strong foundation in DSA and problem-solving. The process includes a screening test, coding rounds, low-level design (LLD), and a hiring manager round. Candidates must demonstrate adaptability and eagerness to learn.\n\n---\n\n## Round Breakdown\n\n### Round 1: Screening Test\n- Format: 30-minute online test (NextLevel Screening Test).\n- Platform: Mobile/Online App.\n- Focus: MCQs on Computer Science Fundamentals.\n- Topics:\n - Operating Systems.\n - Data Structures and Algorithms (DSA).\n - Networking.\n - Error Handling.\n- Example Questions:\n - Verbal questions evaluated by AI.\n - MCQs on OS, DSA, Networking, and Error Handling.\n\n---\n\n### Round 2: Coding Test\n- Format: 90\u2013105 minutes, 3 coding problems (medium to hard).\n- Platform: HackerRank.\n- Focus: Binary Search, Dynamic Programming, Segment Tree, and Greedy Algorithms.\n- Example Questions:\n 1. Binary Search: Search in a sorted array with duplicates.\n 2. Dynamic Programming: Classic DP problems (e.g., LIS variants).\n 3. Segment Tree: Range queries or updates.\n\n---\n\n### Round 3: Low-Level Design (LLD)\n- Format: 85\u201390 minutes, virtual interview.\n- Focus: Implementation using SOLID principles and design patterns.\n- Example Problem:\n - Inventory Management System:\n - Functions: addProduct, createOrder, confirmOrder, getInventory.\n - Bonus: Block inventory until order confirmation.\n\n---\n\n### Round 4: Hiring Manager Round\n- Format: 45-minute interview.\n- Focus: Situational questions, project deep dive, and system design (e.g., chat application).\n- Example Topics:\n 1. Chat Application Design:\n - Database schema, APIs, and application flow.\n 2. Follow-up Questions: Scalability, real-time updates, and fault tolerance.\n\n---\n\n## Key Takeaways\n- Success Factors: Strong DSA basics, clean coding practices, and eagerness to learn.\n- Common Pitfalls: Time management in coding rounds or lack of clarity in design discussions.\n- Preparation Tips:\n - Practice DSA problems on HackerRank/LeetCode.\n - Study LLD principles (SOLID, design patterns).\n - Prepare project case studies for HM rounds.", "SDE-3 / Senior": "# SDE-3 / Senior Role Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho targets experienced engineers (4+ years) with strong system design skills, scalability expertise, and leadership potential. The process includes machine coding, system design, and bar raiser rounds, focusing on real-world implementation and trade-off analysis.\n\n---\n\n## Round Breakdown\n\n### Round 1: Machine Coding\n- Format: 2-hour round on HackerRank or virtual IDE.\n- Focus: Concurrent systems, thread safety, and OOPs principles.\n- Example Problems:\n 1. N Elevator System:\n - Requirements: Handle threads, OOPs design, and scalability.\n 2. Inventory/Order Management Service:\n - Requirements: Concurrent users, thread safety, and Java implementation.\n\n---\n\n### Round 2: System Design\n- Format: 1.5-hour round.\n- Focus: Scalability, microservices architecture, and trade-off analysis.\n- Example Problems:\n 1. Trading Platform:\n - Requirements: Design a system similar to a trading platform with unique use cases.\n 2. Custom Ad Service:\n - Requirements: Scalability, microservices, and real-time updates.\n\n---\n\n### Round 3: Bar Raiser Round\n- Format: 1-hour round.\n- Focus: Follow-up on weaker areas, distributed systems, and algorithms.\n- Example Topics:\n 1. Distributed Systems Design:\n - Scenario-based questions (e.g., handling failures, load balancing).\n 2. Advanced Algorithms:\n - Problems involving graph algorithms, optimization, or distributed systems.\n\n---\n\n## Key Takeaways\n- Success Factors: Strong system design skills, scalability mindset, and ability to lead technical discussions.\n- Common Pitfalls: Overlooking edge cases in design or lack of clarity in trade-offs.\n- Preparation Tips:\n - Study system design for scalable systems (e.g., e-commerce, social media).\n - Practice machine coding with thread safety and OOPs principles.\n - Prepare for bar raiser rounds with distributed systems and algorithms.", "Other": "# Other Roles Interview Briefing\n\n## Overview\nMeesho\u2019s Other Roles (e.g., non-standard or hybrid roles) typically involve a multi-round process with a focus on technical assessments, system design, and behavioral fit. The process is tailored to the specific role but often includes coding rounds, project discussions, and HR rounds.\n\n---\n\n## Round Breakdown\n\n### Round 1: Coding Assessment\n- Format: 1\u20132 hours, 2\u20133 coding problems.\n- Focus: DSA problems (e.g., DP, Graphs, DSU).\n- Example Topics:\n - Dynamic Programming (DP).\n - Graphs (e.g., disjoint-set union).\n - Trees and Arrays.\n\n---\n\n### Round 2: System Design\n- Format: 1.5-hour round.\n- Focus: Low-Level Design (LLD) or High-Level Design (HLD).\n- Example Problems:\n 1. Design an Uber-like System:\n - Requirements: Ride matching, pricing, and real-time updates.\n 2. Custom Rule Engine:\n - Requirements: Schedule rules, handle collisions, and manage API integrations.\n\n---\n\n### Round 3: Project Discussion and HR\n- Format: 1-hour round.\n- Focus: Project deep dive, originality verification, and behavioral fit.\n- Example Topics:\n 1. Project Verification:\n - React hooks, system calls, Express handling, database schema.\n 2. Behavioral Questions:\n - Situational scenarios, principles, and values alignment.\n\n---\n\n## Key Takeaways\n- Success Factors: Strong DSA skills, clear project ownership, and alignment with Meesho\u2019s culture.\n- Common Pitfalls: Lack of originality in projects or weak behavioral fit.\n- Preparation Tips:\n - Practice DSA problems relevant to the role.\n - Study system design for real-world systems (e.g., ride-sharing, rule engines).\n - Prepare project case studies with verifiable contributions."}}

Migrated to JSONB

Migrated to JSONB

Migrated to JSONB

{"overview": "Meesho's hiring process is highly structured, with a strong emphasis on problem-solving, system design, and practical implementation across all roles. Candidates are evaluated through a mix of online assessments (OAs), technical rounds, machine coding, and system design, with a notable focus on scalability, optimization, and real-world problem-solving. The process is rigorous but rewarding, often concluding within a week, and is tailored to assess both technical depth and cultural fit.", "by_role": {"SDE-2": "# SDE-2 Role Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho emphasizes problem-solving, system design, and practical implementation through a multi-round interview process. Candidates are expected to demonstrate proficiency in data structures, algorithms, low-level design (LLD), and high-level design (HLD) while addressing real-world scenarios. The process is challenging but structured to evaluate both technical depth and problem-solving skills.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Problem Solving and Data Structures (PS-DS) / Technical Round\n- Duration: 1 hour\n- Format: 2 coding questions, often on platforms like HackerRank or LeetCode.\n- Key Topics: Dynamic Programming, Graphs, Trees, Hashing, and String Manipulation.\n- Sample Questions:\n - Minimum Steps to Reach Target by a Knight\n - Remove All Adjacent Duplicates in String II\n - Course Schedule II\n - Container With Most Water\n - Asteroid Collision\n - Matrix Problem: Connected components of 1s (similar to Number of Islands)\n\n---\n\n### 2. Machine Coding Round\n- Duration: 1.5\u20132 hours\n- Format: Design and implement a working system with specific functionalities.\n- Key Topics: Object-Oriented Design (OOP), SOLID Principles, Design Patterns, and Thread Safety.\n- Sample Problems:\n - Snake & Ladder Game Design\n - Ride-Sharing Application Features (e.g., ride booking, payment processing)\n - Facebook-like Newsfeed System (Posting, Following, Pagination)\n - Inventory Management System (addProduct, createOrder, confirmOrder, getInventory)\n - N Elevator System (Thread handling, OOP principles)\n\n---\n\n### 3. System Design Round\n- Duration: 1\u20131.5 hours\n- Format: High-level design (HLD) and low-level design (LLD) discussions.\n- Key Topics: Scalability, Microservices, Database Design, API Design, and Trade-offs.\n- Sample Problems:\n - Twitter News Feed Design\n - Ranking and Review System for E-commerce (Sorting, Filtering, Ratings)\n - Trading Platform (Scalability, Microservices)\n - OTP System Design\n\n---\n\n### 4. Hiring Manager Round\n- Duration: 1 hour\n- Format: Project discussion, behavioral questions, and scenario-based problem-solving.\n- Key Topics:\n - Deep dive into past projects and technologies used.\n - Behavioral questions (e.g., handling failures, teamwork).\n - Scenario-based questions (e.g., handling high-traffic scenarios).\n\n---\n\n## Common Pitfalls and Tips\n- Machine Coding: Focus on clean code, modularity, and edge cases. Interviewers often evaluate your approach as much as the final output.\n- System Design: Practice designing scalable systems and discussing trade-offs (e.g., SQL vs. NoSQL, consistency models).\n- Behavioral: Be prepared to discuss past projects in detail and justify design decisions.\n\n---\n\n## Resources\n- Practice Platforms: LeetCode (Medium/Hard), HackerRank, GeeksforGeeks.\n- Books: Designing Data-Intensive Applications (Martin Kleppmann), Clean Code (Robert C. Martin).\n- Mock Interviews: Practice system design and machine coding with peers.", "SDE-1 / New Grad": "# SDE-1 / New Grad Role Structured Interview Briefing\n\n## Overview\nThe SDE-1 role at Meesho is designed for entry-level engineers and focuses on assessing fundamental problem-solving skills, coding proficiency, and basic system design. The process includes an online assessment (OA), technical rounds, and HR interviews, with a strong emphasis on algorithms, data structures, and practical implementation. Candidates are expected to demonstrate a solid grasp of computer science fundamentals and the ability to write clean, efficient code.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Online Assessment (OA)\n- Duration: 75\u2013105 minutes\n- Format: 3 coding questions (Easy/Medium/Hard) + 10\u201325 MCQs (CS Fundamentals).\n- Key Topics: Arrays, Strings, Dynamic Programming, Graphs, Trees, SQL, and OS/Networking Basics.\n- Sample Questions:\n - Coding:\n - Find common elements in two arrays\n - Make two strings anagrams\n - Weighted Job Scheduling\n - Number of Islands\n - Activity Selection Problem\n - Water the Plants\n - Chocolate Distribution Problem\n - Longest Increasing Subsequence (LIS)\n - Graph Colouring\n - Minimum Degree of a Connected Trio in a Graph\n - Rectangle Area II\n - MCQs:\n - Operating Systems (Semaphores vs. Mutex, Paging)\n - Computer Networks (ARP, DNS, OSI Model)\n - DBMS (SQL vs. NoSQL, Normalization, ACID Properties)\n - Programming (C++, Java, OOP Concepts)\n\n---\n\n### 2. Technical Interview Round 1\n- Duration: 1\u20131.5 hours\n- Format: 2 coding questions (Medium/Hard) + Discussion on CS Fundamentals.\n- Key Topics: Data Structures (Trees, Graphs, Linked Lists), Algorithms (Greedy, DP), and Problem-Solving.\n- Sample Questions:\n - Pair of Nodes Equal to Given Sum (BST)\n - Kth Node from the Last (Linked List)\n - Add Two Numbers Represented by Linked Lists (Stack)\n - Longest Substring with At Least K Repeating Characters (Variation)\n - Making a Large Island\n\n---\n\n### 3. Technical Interview Round 2\n- Duration: 1 hour\n- Format: Deep dive into projects, CS Fundamentals, and Problem Optimization.\n- Key Topics:\n - Projects: Tech stack choices, alternatives, use cases, and optimization.\n - CS Fundamentals: SQL/NoSQL, Networking, OS (Threading, Memory Management), OOP.\n - Real-World Scenarios: Handling high-traffic situations, sale scenarios with limited inventory.\n\n---\n\n### 4. System Design Round (for some candidates)\n- Duration: 1 hour\n- Format: Basic system design questions (e.g., OTP System, Chat Application).\n- Key Topics: API Design, Database Schema, Scalability, and Trade-offs.\n\n---\n\n### 5. HR / Managerial Round\n- Duration: 1 hour\n- Format: Behavioral questions, situational scenarios, and cultural fit assessment.\n- Key Topics:\n - Situational questions (e.g., handling project failures, restarting projects).\n - Discussion on values, principles, and past experiences.\n\n---\n\n## Common Pitfalls and Tips\n- Online Assessment: Focus on time management and optimizing solutions to avoid TLE (Time Limit Exceeded).\n- Technical Rounds: Practice writing clean code and explaining your thought process.\n- System Design: For entry-level roles, expect basic design questions (e.g., OTP system, chat app).\n- HR Round: Be prepared to discuss past projects in detail and justify your choices.\n\n---\n\n## Resources\n- Practice Platforms: LeetCode (Easy/Medium), HackerRank, GeeksforGeeks.\n- Books: Cracking the Coding Interview (Gayle Laakmann McDowell), Introduction to Algorithms (CLRS).\n- Mock Interviews: Practice with peers or platforms like Pramp.", "Intern": "# Intern Role Structured Interview Briefing\n\n## Overview\nThe Intern role at Meesho is highly competitive, with a focus on assessing fundamental programming skills, problem-solving ability, and basic system design. The process includes online assessments, coding rounds, low-level design (LLD), and hiring manager rounds, designed to evaluate both technical proficiency and learning agility. Candidates are expected to demonstrate a strong grasp of data structures, algorithms, and practical implementation.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Online Assessment (OA)\n- Duration: 30\u2013105 minutes\n- Format: MCQs (CS Fundamentals) + Coding Questions (Medium/Hard).\n- Key Topics:\n - MCQs: Operating Systems, Data Structures and Algorithms (DSA), Computer Networks, Error Handling.\n - Coding: Binary Search, Dynamic Programming, Segment Trees, Graphs.\n- Sample Questions:\n - MCQs:\n - Operating Systems (Processes, Threads, Memory Management)\n - Computer Networks (OSI Model, ARP, DNS)\n - DSA (Arrays, Strings, Graphs, Trees)\n - Coding:\n - Binary Search Problems\n - Dynamic Programming (DP) Problems\n - Segment Tree Problems\n - Graph Traversal (BFS/DFS)\n\n---\n\n### 2. Coding Round\n- Duration: 90\u2013105 minutes\n- Format: 2\u20133 coding questions (Medium/Hard).\n- Key Topics: Arrays, Strings, Graphs, Dynamic Programming, and Optimization.\n- Sample Questions:\n - Chocolate Distribution Problem\n - LIS Revisited\n - Graph Colouring\n - Knapsack Problem (0-1)\n - Stock Price Optimization\n\n---\n\n### 3. Low-Level Design (LLD) Round\n- Duration: 85\u201390 minutes\n- Format: Design and implement a system with specific functionalities.\n- Key Topics: OOP Principles, SOLID Principles, Design Patterns, and Thread Safety.\n- Sample Problems:\n - Inventory Management System:\n - addProduct(productId, productDetail, quantity)\n - createOrder(productIds, quantities, orderId)\n - confirmOrder(orderId)\n - getInventory(productId)\n - Bonus Functionality: Add features like blocking inventory until order confirmation.\n\n---\n\n### 4. Hiring Manager Round\n- Duration: 45 minutes\n- Format: Project discussion, situational questions, and behavioral assessment.\n- Key Topics:\n - Deep dive into past projects (tech stack, challenges, optimizations).\n - Situational questions (e.g., handling failures, teamwork).\n - Design a chat application (database schema, APIs, flow).\n\n---\n\n## Common Pitfalls and Tips\n- Online Assessment: Focus on time management and optimizing solutions to avoid TLE.\n- Coding Round: Practice writing clean, modular code and handling edge cases.\n- LLD Round: Understand OOP principles and design patterns (e.g., Singleton, Factory).\n- Hiring Manager Round: Be prepared to discuss projects in detail and justify your design choices.\n\n---\n\n## Resources\n- Practice Platforms: LeetCode (Easy/Medium), HackerRank, Codeforces.\n- Books: Head First Design Patterns, Cracking the Coding Interview.\n- Mock Interviews: Practice LLD problems with peers or mentors.", "SDE-3 / Senior": "# SDE-3 / Senior Role Structured Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho targets experienced engineers with a strong focus on system design, scalability, and leadership in technical decisions. The interview process is rigorous, involving machine coding, system design, and bar raiser rounds, designed to assess deep technical expertise, architectural skills, and problem-solving in complex scenarios. Candidates are expected to demonstrate strong design principles, optimization skills, and the ability to lead technical discussions.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Machine Coding Round\n- Duration: 2 hours\n- Format: Design and implement a complex system with a focus on threads, OOP principles, and scalability.\n- Key Topics:\n - Multi-threading and concurrency.\n - Object-Oriented Design (OOP) and SOLID Principles.\n - Real-world systems (e.g., Elevator System, Inventory Management).\n- Sample Problems:\n - N Elevator System:\n - Handle thread safety and concurrent user requests.\n - Implement OOPs principles (e.g., inheritance, polymorphism).\n - Inventory/Order Management Service:\n - Design for high scalability and thread safety.\n - Implement concurrent order processing.\n\n---\n\n### 2. System Design Round\n- Duration: 1\u20131.5 hours\n- Format: Design scalable, distributed systems with a focus on microservices, databases, and trade-offs.\n- Key Topics:\n - Scalability and performance optimization.\n - Database Design (SQL vs. NoSQL, indexing, sharding).\n - Microservices Architecture and API Design.\n - Real-world systems (e.g., Trading Platform, Ad Service, Rule Engine).\n- Sample Problems:\n - Trading Platform:\n - Design a system to handle millions of transactions per second.\n - Discuss trade-offs between consistency and availability.\n - Custom Ad Service:\n - Design for scalability and real-time bidding.\n - Handle rule collisions and scheduling millions of rules.\n - Rule Engine:\n - Design a system to schedule and execute rules (e.g., increment/decrement values from APIs).\n - Handle rule failures and edge cases.\n\n---\n\n### 3. Bar Raiser Round\n- Duration: 1 hour\n- Format: Focus on weak areas from previous rounds, including distributed systems, algorithms, and scenario-based questions.\n- Key Topics:\n - Distributed Systems: Consensus algorithms, CAP theorem, eventual consistency.\n - Algorithms: Advanced problems (e.g., graph algorithms, dynamic programming).\n - Scenario-Based Questions: Handle high-traffic scenarios, fault tolerance, and scalability challenges.\n\n---\n\n### 4. Hiring Manager Round\n- Duration: 1 hour\n- Format: Discussion on past projects, design decisions, and leadership experiences.\n- Key Topics:\n - Project Deep Dives: Challenges faced, solutions implemented, and optimizations.\n - Technical Leadership: How you mentored teams, drove architectural decisions.\n - Behavioral Questions: Handling failures, teamwork, and cultural fit.\n\n---\n\n## Common Pitfalls and Tips\n- Machine Coding: Focus on clean, modular, and thread-safe code. Interviewers evaluate your approach as much as the output.\n- System Design: Practice designing scalable systems and discussing trade-offs (e.g., SQL vs. NoSQL, consistency models).\n- Bar Raiser Round: Be prepared for advanced algorithms and distributed systems questions. Show your ability to think critically under pressure.\n- Hiring Manager Round: Highlight your leadership experiences and impact on past projects.\n\n---\n\n## Resources\n- Practice Platforms: LeetCode (Hard), System Design Primer (GitHub), Grokking the System Design Interview.\n- Books: Designing Data-Intensive Applications (Martin Kleppmann), Clean Architecture (Robert C. Martin).\n- Mock Interviews: Practice system design with peers or mentors.", "Data Science / ML": "# Data Science / ML Role Structured Interview Briefing\n\n## Overview\nThe Data Science / ML role at Meesho focuses on assessing technical proficiency in SQL, Spark, data modeling, and machine learning. The interview process includes multiple technical rounds conducted by external agencies and Meesho\u2019s panel, with a strong emphasis on practical implementation, scalability, and problem-solving. Candidates are expected to demonstrate deep knowledge of data engineering, distributed systems, and ML fundamentals.\n\n---\n\n## Round Breakdown and Key Questions\n\n### 1. Technical Round (SQL, Spark, Data Modeling)\n- Duration: 1 hour per round\n- Format: Mix of SQL queries, Spark coding, and data modeling questions.\n- Key Topics:\n - SQL: Joins, Subqueries, Window Functions, Aggregations.\n - Spark: RDDs, DataFrames, Spark SQL, Performance Optimization.\n - Data Modeling: Schema design, Normalization, Denormalization.\n- Sample Questions:\n - SQL:\n - Write queries using ROW_NUMBER(), RANK(), and DENSE_RANK().\n - Optimize slow-running queries.\n - Design a database schema for an e-commerce platform.\n - Spark:\n - Implement a word count program using Spark RDDs.\n - Optimize a Spark job to avoid OOM errors.\n - Explain Spark internals (e.g., partitioning, shuffling).\n - Data Modeling:\n - Design a schema for a recommendation system.\n - Discuss denormalization vs. normalization trade-offs.\n\n---\n\n### 2. Technical Round (Spark Internals, Distributed Systems)\n- Duration: 1 hour\n- Format: Deep dive into Spark internals, distributed systems, and optimization.\n- Key Topics:\n - Spark Internals: Catalyst Optimizer, Tungsten Engine, Shuffling.\n - Distributed Systems: Partitioning, Fault Tolerance, Consistency Models.\n - Performance Optimization: Caching, Broadcast Variables, Partition Tuning.\n- Sample Questions:\n - Explain how Spark executes a job from submission to completion.\n - How would you optimize a slow Spark job?\n - Discuss consistency models in distributed systems (e.g., CAP theorem).\n\n---\n\n### 3. Managerial Round (Hiring Manager)\n- Duration: 1 hour\n- Format: Discussion on past projects, ML models, and leadership experiences.\n- Key Topics:\n - Project Deep Dives: Challenges, solutions, and impact.\n - ML Models: Model selection, hyperparameter tuning, deployment strategies.\n - Behavioral Questions: Handling failures, teamwork, and cultural fit.\n- Sample Questions:\n - Walk through a past ML project and explain your contributions.\n - How would you deploy a model in production?\n - Discuss a time you optimized a slow ML pipeline.\n\n---\n\n## Common Pitfalls and Tips\n- SQL: Practice complex queries and optimization techniques.\n- Spark: Understand RDD lineage, partitioning strategies, and performance tuning.\n- Data Modeling: Focus on scalability and trade-offs between normalization and denormalization.\n- Managerial Round: Be prepared to discuss projects in detail and justify your design choices.\n\n---\n\n## Resources\n- Practice Platforms: LeetCode (SQL), HackerRank (Spark), Kaggle (ML).\n- Books: Designing Data-Intensive Applications (Martin Kleppmann), Spark: The Definitive Guide (Bill Chambers, Matei Zaharia).\n- Mock Interviews: Practice SQL and Spark problems with peers or mentors."}}

{"overview": "Meesho\u2019s hiring process is rigorous and multi-staged, emphasizing strong problem-solving skills, practical implementation, and system design abilities. The process varies significantly by role, with SDE-1/New Grad candidates facing a structured online assessment (OA) followed by technical and HR rounds, while SDE-2/Senior roles emphasize machine coding, system design, and behavioral evaluations. Rejections often stem from gaps in preparation, especially in machine coding and system design, while successful candidates demonstrate consistency in solving medium-to-hard DSA problems and articulating scalable solutions.", "by_role": {"SDE-2": "# SDE-2 Role-Structured Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves three core rounds: a technical round (DSA), a machine coding round, and a system design/hiring manager round. The process is designed to assess problem-solving, coding efficiency, and architectural thinking. Candidates with 2+ years of experience are expected to demonstrate proficiency in medium-to-hard DSA problems, scalable system design, and clean code implementation under time constraints. Rejections often occur due to time mismanagement in machine coding or inability to justify design choices during system design rounds.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Technical Round (DSA)\nFormat: 1-hour session with 2 coding questions (LeetCode medium/hard).\nPlatform: HackerRank or similar.\nEvaluation Criteria: Problem-solving approach, code efficiency, and test case coverage.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Minimum Steps to Reach Target by a Knight (Coding Ninjas)\n - Remove All Adjacent Duplicates in String II\n\n- Candidate 2:\n - Dynamic Programming question with 14 test cases (10 solved independently, 4 with assistance).\n\n- Candidate 3:\n - Course Schedule II\n - Container With Most Water\n\n- Candidate 4:\n - Asteroid Collision\n - Matrix problem involving connected components of 1s (similar to Number of Islands).\n\n- Candidate 5:\n - Number of Islands problem\n - Infinite grid problem: Number of possible ways for a knight to reach from (x,y) to (p,q).\n\n- Candidate 6:\n - 1 LeetCode medium and 1 LeetCode hard problem (exact questions not specified).\n\n- Candidate 7:\n - Hashing-related LeetCode medium problem.\n - Dynamic programming problem on palindromic strings (LeetCode hard).\n\n- Candidate 8:\n - Two simple questions (exact nature not specified).\n\n\n### 2. Machine Coding Round\nFormat: 1.5\u20132 hour session focused on designing and implementing a functional system.\nEvaluation Criteria: Code structure, adherence to requirements, scalability, and clean implementation.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Design a Snake & Ladder game.\n\n- Candidate 2:\n - Build two main features for a ride-sharing application (exact features not specified).\n\n- Candidate 3:\n - Machine coding round similar to this problem.\n\n- Candidate 4:\n - Problem identical to a referenced LeetCode discussion (exact nature not specified).\n\n- Candidate 6:\n - Design Facebook APIs (Create Post, Delete Post, Get Feed, Get Feed Paginated, Follow, Unfollow).\n\n- Candidate 7:\n - Design a Facebook-like newsfeed system with posting, following users, and newsfeed generation with pagination support.\n\n- Candidate 10:\n - Coding an elevator system.\n\n\n### 3. System Design + Hiring Manager Round\nFormat: 1-hour session combining system design and behavioral evaluation.\nEvaluation Criteria: Architectural thinking, scalability, and communication skills.\n\n#### Exact Questions Asked:\n- Candidate 3:\n - Design a Twitter news feed (High-Level Design).\n - 1 LeetCode medium question on Binary Trees.\n\n- Candidate 4:\n - Design a ranking and review system for an e-commerce website (requirements included user reviews, ratings, sorting, filtering, and handling likes/dislikes).\n - Discuss HLD, database design, and write a getProductList() API.\n - Follow-up questions: SQL vs NoSQL, MongoDB vs Redis, Consistency vs Eventual Consistency.\n\n- Candidate 6:\n - Design a rating and review system (HLD and LLD discussion).\n\n- Candidate 7:\n - Project-related questions, Java optimization techniques, garbage collection, system monitoring, and debugging Java systems.\n\n---\n\n## Key Takeaways\n- DSA: Focus on dynamic programming, graph algorithms, and matrix problems.\n- Machine Coding: Practice designing scalable systems (e.g., newsfeed, APIs, games) with clean code.\n- System Design: Be prepared to discuss scalability, database design, and trade-offs in architectural decisions.\n- Behavioral: Expect questions on project deep dives, optimization, and real-world scenarios.\n\nRejection Triggers:\n- Poor time management in machine coding.\n- Inability to justify design choices in system design.\n- Lack of preparation in Java/SQL (for backend roles).", "SDE-1 / New Grad": "# SDE-1 / New Grad Role-Structured Interview Briefing\n\n## Overview\nThe SDE-1 / New Grad hiring process at Meesho is highly competitive and structured, starting with an online assessment (OA) followed by 2\u20133 technical rounds and an HR round. The OA typically includes 3 coding questions (medium-hard) and 20\u201330 MCQs covering DSA, OS, CN, and OOPs. Shortlisted candidates proceed to technical interviews focusing on DSA, system design, and OOPs, with a final HR round. Success depends on strong fundamentals, problem-solving speed, and adaptability to real-world scenarios.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Online Assessment (OA)\nFormat: 75\u2013100 minutes with 3 coding questions (medium-hard) and 20\u201330 MCQs.\nPlatform: HackerRank or similar.\nEvaluation Criteria: Correctness, efficiency, and time management.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Find common elements in two arrays in ascending order.\n - Minimum number of modifications to make two strings anagrams.\n - Weighted Job Scheduling (solved using DP and binary search).\n\n- Candidate 2:\n - 3 coding questions of medium-hard difficulty (exact nature not specified).\n\n- Candidate 5:\n - Easy array manipulation question.\n - Max Sum of M Non-Overlapping Subarrays of Size K.\n - Dynamic Programming problem (LeetCode hard).\n\n- Candidate 6:\n - Chocolate Distribution Problem.\n - LIS Revisited.\n - Graph Colouring.\n - Unremembered very hard problem.\n\n- Candidate 7:\n - Reverse a string from the set {A, C, G, T} with A<->G and C<->T substitutions.\n - Determine if a path exists from the top-left to the bottom-right corner of a 2D matrix (with obstacles) within a time limit using BFS.\n - Weighted job scheduling problem.\n\n- Candidate 8:\n - 3 DSA problems (Hard, Medium, Medium) on HackerRank.\n\n- Candidate 10:\n - Minimum Degree of a Connected Trio in a Graph.\n - Rectangle Area II.\n - Dynamic programming problem (LeetCode hard).\n\n- Candidate 12:\n - Maximize sum of i*(arr2[i]-arr1[i]) by swapping elements in two arrays.\n - Supercomputer efficiency problem.\n - CountGoodSubsequences problem.\n\n\n### 2. Technical Interview 1 (Coding)\nFormat: 1\u20131.5 hour session with 2 coding questions (LeetCode medium/hard).\nPlatform: HackerRank CodePair.\nEvaluation Criteria: Problem-solving approach, code efficiency, and test case coverage.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Activity Selection Problem.\n - Water the Plants.\n\n- Candidate 5:\n - Extension of the Number of Islands problem.\n - Count arrays of size n with values 1..n where each element follows specific divisibility rules.\n\n- Candidate 10:\n - Longest Substring with At Least K Repeating Characters (slight variation).\n - Making A Large Island.\n\n- Candidate 11:\n - Stack-based balls collision problem (similar to Asteroid Collision).\n - Hashmap and string-based problem (medium).\n\n\n### 3. Technical Interview 2 (System Design/OOPs)\nFormat: 1-hour session focusing on system design, OOPs, and CS fundamentals.\nEvaluation Criteria: Architectural thinking, design patterns, and conceptual clarity.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - SQL queries and database tables from projects.\n - Differences between semaphore and mutex, paging vs virtual memory, threading in Java.\n - SQL vs NoSQL, Normalization, ACID properties.\n - Inner implementation of vectors in C++.\n\n- Candidate 4:\n - Computer Networks: ARP, DNS, OSI model.\n - Operating Systems: Semaphores vs mutex, paging, virtual vs physical memory.\n\n- Candidate 7:\n - System Design: Design a basic OTP system.\n\n\n### 4. HR/Technical Round\nFormat: 1-hour session combining HR questions and project deep dives.\nEvaluation Criteria: Communication, project experience, and cultural fit.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Formal HR round (no significant questions).\n\n- Candidate 2:\n - Explain tech stack choices and alternatives for projects.\n - Optimize solutions from the OA.\n - Real-world scenario: Handling a sale with limited product availability.\n - Situational question: Restarting a flawed project.\n\n- Candidate 5:\n - Computer Networks and DBMS deep dive.\n\n- Candidate 11:\n - Discussion on internship and self-made projects.\n - Questions about problems faced, solutions, tech stack, and optimization plans.\n\n---\n\n## Key Takeaways\n- OA: Focus on DSA, OS, CN, and OOPs. Practice time-bound problem-solving.\n- Technical Interviews: Strengthen dynamic programming, graph algorithms, and system design.\n- HR Round: Prepare for project deep dives, optimization, and situational questions.\n\nRejection Triggers:\n- Inability to solve medium-hard DSA problems in OA.\n- Poor system design fundamentals or lack of project depth.\n- Weak communication skills during HR rounds.", "Intern": "# Intern Role-Structured Interview Briefing\n\n## Overview\nMeesho\u2019s intern hiring process is highly selective, with four rigorous rounds: a screening test, a coding test, a low-level design round, and a hiring manager round. The process is designed to evaluate fundamental DSA skills, system design aptitude, and problem-solving under pressure. Candidates are expected to demonstrate strong basics in OS, CN, and OOPs, along with the ability to design scalable systems. Rejections often occur due to time mismanagement or lack of depth in project discussions.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Screening Test\nFormat: 30-minute online test with 20 MCQs covering OS, DSA, CN, and error handling.\nPlatform: NextLevel mobile app.\nEvaluation Criteria: Conceptual clarity and quick problem-solving.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - 20 MCQs covering Operating Systems, Data Structures and Algorithms (DSA), Networking, and Error Handling.\n\n- Candidate 3:\n - 20 MCQs (OS, DSA, Algorithms, Networking, Error Handling) + verbal questions evaluated by AI.\n\n\n### 2. Coding Test\nFormat: 90\u2013105 minutes with 3 coding problems (medium to hard).\nPlatform: HackerRank.\nEvaluation Criteria: Correctness, efficiency, and time management.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Binary Search problem.\n - Dynamic Programming (DP) problem.\n - Segment Tree problem.\n\n- Candidate 3:\n - Binary Search problem.\n - Dynamic Programming (DP) problem.\n - Segment Tree problem.\n\n\n### 3. Low-Level Design Round\nFormat: 85\u201390 minute virtual interview focused on designing a scalable system.\nEvaluation Criteria: Adherence to requirements, clean code, and scalability.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Implement an Inventory Management System using SOLID principles and design patterns.\n\n- Candidate 3:\n - Implement an Inventory Management System with four mandatory functions and one bonus functionality.\n\n\n### 4. Hiring Manager Round\nFormat: 45-minute interview focusing on project deep dives, situational questions, and system design.\nEvaluation Criteria: Communication, architectural thinking, and cultural fit.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Design a chat application (database schema, APIs, and flow).\n - Follow-up questions on the design.\n\n- Candidate 3:\n - Design a chat application (database schema, APIs, and flow).\n - Follow-up questions on the design.\n\n---\n\n## Key Takeaways\n- Screening Test: Focus on OS, CN, and DSA fundamentals.\n- Coding Test: Practice Binary Search, DP, and Segment Tree problems.\n- Low-Level Design: Be prepared to design scalable systems (e.g., inventory management, chat apps).\n- Hiring Manager Round: Prepare for project deep dives, situational questions, and system design.\n\nRejection Triggers:\n- Poor time management in coding tests.\n- Inability to justify design choices in LLD rounds.\n- Weak project depth during the hiring manager round.", "SDE-3 / Senior": "# SDE-3 / Senior Role-Structured Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho targets candidates with 4+ years of experience and emphasizes scalable system design, machine coding, and leadership in architectural decisions. The process includes multiple technical rounds: a machine coding round, a design round, and a bar raiser round. Candidates are expected to demonstrate expertise in distributed systems, microservices, and real-world problem-solving. Rejections often stem from inability to articulate trade-offs or lack of depth in system design.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Machine Coding Round\nFormat: 2-hour session focused on designing and implementing a complex system.\nPlatform: HackerRank or similar.\nEvaluation Criteria: Code quality, scalability, thread safety, and adherence to requirements.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Implement an N Elevator system with emphasis on handling threads and OOPs principles.\n\n- Candidate 2:\n - Design an inventory/order management service with concurrent user handling and thread safety.\n\n- Candidate 3:\n - Design a restaurant rating system with multiple branches, rating functionalities, and average rating calculations.\n\n\n### 2. System Design Round\nFormat: 1\u20131.5 hour session focusing on scalable architectures.\nEvaluation Criteria: Architectural thinking, scalability, and communication skills.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Design a system similar to a trading platform with a slightly different use case.\n\n- Candidate 2:\n - Design a custom ad service with emphasis on scalability and microservices architecture.\n\n- Candidate 3:\n - Design a rule engine system with support for millions of rules, rule collisions, and failure handling.\n\n\n### 3. Bar Raiser Round\nFormat: 1-hour session focusing on weak areas from previous rounds.\nEvaluation Criteria: Depth of knowledge, problem-solving, and adaptability.\n\n#### Exact Questions Asked:\n- Candidate 2:\n - Follow-up questions on distributed systems design and algorithms.\n - Scenario-based questions to assess scalability and trade-offs.\n\n\n### 4. Non-Technical Round\nFormat: 1-hour session combining HR and hiring manager discussions.\nEvaluation Criteria: Cultural fit, values alignment, and leadership potential.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Discussion on personal projects, scenarios, principles, and values.\n\n\n---\n\n## Key Takeaways\n- Machine Coding: Focus on thread safety, scalability, and clean code.\n- System Design: Be prepared to discuss distributed systems, microservices, and real-world trade-offs.\n- Bar Raiser Round: Expect deep dives into weak areas and scenario-based questions.\n- Non-Technical Round: Prepare for project discussions, principles, and values alignment.\n\nRejection Triggers:\n- Inability to articulate trade-offs in system design.\n- Poor thread safety or scalability in machine coding.\n- Weak leadership or cultural fit during non-technical rounds.", "Data Science / ML": "# Data Science / ML Role-Structured Interview Briefing\n\n## Overview\nThe Data Science / ML role at Meesho focuses on SQL, Spark, data modeling, and system design for large-scale data processing. The process includes 3\u20134 technical rounds covering SQL, Spark internals, and data engineering concepts, followed by a hiring manager round. Candidates are expected to demonstrate proficiency in distributed computing, optimization, and real-world data scenarios. Rejections often occur due to lack of depth in Spark internals or inability to optimize queries.\n\n---\n\n## Round Breakdown and Questions\n\n### 1. Technical Round 1 (SQL + Spark)\nFormat: 1-hour session focused on SQL and Spark coding.\nPlatform: External agency or Meesho panel.\nEvaluation Criteria: Query optimization, Spark fundamentals, and problem-solving.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - SQL and Spark coding questions (exact nature not specified).\n\n\n### 2. Technical Round 2 (SQL + Data Modeling)\nFormat: 1-hour session covering SQL, data modeling, and Spark fundamentals. Platform: External agency or Meesho panel.\nEvaluation Criteria: Data modeling skills, Spark internals, and conceptual clarity.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - SQL, data modeling, and Spark fundamentals/internals (exact nature not specified).\n\n\n### 3. Technical Round 3 (Spark Coding + Internals)\nFormat: 1-hour session focused on Spark coding and internals.\nPlatform: Meesho panel.\nEvaluation Criteria: Spark proficiency, optimization, and real-world data scenarios.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Spark coding and internals (exact nature not specified).\n\n\n### 4. Managerial Round\nFormat: 1-hour session focusing on project experience, deep dives, and behavioral questions.\nEvaluation Criteria: Communication, project depth, and cultural fit.\n\n#### Exact Questions Asked:\n- Candidate 1:\n - Project experience deep dive.\n - Technologies used and behavioral questions.\n\n---\n\n## Key Takeaways\n- SQL: Focus on query optimization, joins, and window functions.\n- Spark: Strengthen Spark internals, RDDs, DataFrames, and optimization techniques.\n- Data Modeling: Practice schema design, normalization, and real-world data scenarios.\n- Managerial Round: Prepare for project deep dives and behavioral questions.\n\nRejection Triggers:\n- Poor Spark internals knowledge.\n- Inability to optimize SQL queries.\n- Weak project depth or communication skills."}}

Migrated to JSONB

{"overview": "Amazon\u2019s hiring process for technical roles, including interns and new graduates, emphasizes a rigorous multi-stage evaluation. Candidates are tested on Data Structures and Algorithms (DSA), core computer science fundamentals (e.g., OS, DBMS, Networking), and behavioral alignment with Amazon\u2019s Leadership Principles. The Online Assessment (OA) often includes a mix of MCQs and coding problems, while technical interviews focus on problem-solving, system design, and project discussions.", "by_role": {"Intern": "# Amazon Intern Hiring: Role-Structured Interview Briefing\n\n---\n\n## Overview\nAmazon\u2019s intern hiring process for technical roles (e.g., SDE, Support Engineer) is highly structured and rigorous. The process typically includes an Online Assessment (OA) with a mix of MCQs and coding problems, followed by 2\u20134 technical interviews. These interviews evaluate DSA skills, CS fundamentals (e.g., OS, DBMS, Networking), and project depth. Behavioral alignment with Amazon\u2019s Leadership Principles is also assessed, particularly in later rounds.\n\n---\n\n## Round Breakdown & Question Analysis\n\n### 1. Online Assessment (OA)\n- Format: \n - Support Engineer Intern: 14 sections covering DBMS, OOPS, Programming, Networking, Error Handling, Software Engineering, and Data Visualization. Includes 1 easy DSA problem and MCQs.\n - SDE Intern (Amazon India): Coding Assessment (70 mins), Workstyles Assessment (15 mins), Feedback Survey (5 mins).\n - SDE Intern (General): 30 technical MCQs + 3 coding problems (easy to moderate).\n - SDE Intern (Off-Campus): Two rounds on Mettl platform: \n 1. 90-minute test covering OS, Networking, DBMS, Linux, Software Development, and DSA (MCQs).\n 2. Two medium-to-hard coding problems + behavioral questions (Leadership Principles) + feedback section.\n - SDE Intern (LeetCode): 105-minute OA with 3 questions: \n 1. Sliding window maximum (Basic).\n 2. Graph problem (Medium, e.g., LeetCode 207).\n 3. Dynamic Programming on a grid with blocked cells (Advanced).\n\n- Key Topics:\n - DSA: Sliding window, graphs (topological sort), DP (grid-based).\n - CS Fundamentals: OS (deadlock, scheduling), DBMS (ACID, normalization), Networking, Linux commands.\n - Behavioral: Leadership Principles (e.g., customer obsession, invent and simplify).\n\n---\n\n### 2. Technical Interviews\n\n#### Round 1: Support Engineer Intern\n- Focus: Projects (ML, Full Stack, Front-End), DSA, DBMS, scenario-based problem-solving.\n- Questions Asked:\n 1. OOPs/DBMS: \n - How do you apply a condition in a query?\n - Which keyword fetches unique values from a column?\n 2. DSA:\n - Occurrence of a Character in a String (hash map + two-pointer optimization).\n - Odd- and Even-Indexed Array Elements (O(N) solution).\n - Modify logic to handle case-insensitivity.\n 3. Projects: Discussion on ML project (Android Malware Detection System).\n\n- Platform: AWS Chime (virtual interview with two interviewers).\n\n---\n\n#### Round 2: Support Engineer Intern\n- Focus: DSA, Linux commands, Operating Systems concepts.\n- Questions Asked:\n 1. DSA:\n - Missing Number.\n - Loop in a Linked List.\n 2. Linux Commands:\n - Find a specific word in a text file (grep).\n - Command to edit a text file (vim/nano).\n 3. OS:\n - Define deadlock and its necessary conditions.\n - CPU scheduling algorithms (SJF, SRJF, RR, PS, FCFS) with examples.\n 4. Projects: Discussion on tech stack and JavaScript-based passion project.\n\n---\n\n#### Round 1: SDE Intern (Amazon India)\n- Focus: Project discussion (Mental Health Prediction App, Chat Application, Music Web App) + coding.\n- Questions Asked:\n 1. DSA: Find the index of a specified element in a sorted array (binary search).\n 2. Projects: Detailed discussion on 2\u20133 projects.\n\n---\n\n#### Round 2: SDE Intern (General)\n- Focus: Operating Systems, CS fundamentals, arrays, code optimization.\n- Format: Face-to-face interview.\n\n---\n\n#### Round 3: SDE Intern (General)\n- Focus: Data Structures (B Trees, sorting), project discussion.\n- Format: Face-to-face interview.\n\n---\n\n#### Round 1: SDE Intern (Off-Campus)\n- Focus: Dynamic Programming, Graphs.\n- Questions Asked:\n 1. DP: Best Time to Buy and Sell Stock with Transaction Fee (discussed 4 approaches: recursion, memoization, tabulation, space optimization).\n 2. Graph: Reorder Routes to Make All Paths Lead to the City Zero.\n\n---\n\n#### Round 2: SDE Intern (Off-Campus)\n- Focus: Verbal CS questions, SQL queries, OOP pseudocode, LRU cache.\n- Questions Asked:\n 1. DBMS: ACID properties, normalization, SQL joins.\n 2. OS: Deadlock, LRU, disk scheduling, paging.\n 3. OOP: Overloading, overriding, inheritance.\n 4. DSA: LRU Cache discussion.\n\n---\n\n### 3. HR / Managerial Round\n- Focus: Behavioral questions, high-level project discussion, internship plans.\n- Platform: Virtual (e.g., Amazon Chime).\n\n---\n\n## Key Takeaways for Candidates\n- DSA: Master arrays, strings, graphs, DP, and tree traversals. Practice edge cases and optimizations.\n- CS Fundamentals: Prioritize OS, DBMS, and Linux commands.\n- Projects: Be ready to explain technical depth and impact.\n- Behavioral: Align responses with Amazon\u2019s Leadership Principles (e.g., "Customer Obsession", "Invent and Simplify").", "Data Science / ML": "# Amazon Data Science / ML Hiring: Role-Structured Interview Briefing\n\n---\n\n## Overview\nAmazon\u2019s Data Science and ML hiring process for internships and full-time roles combines technical rigor with domain-specific expertise. The process includes a multi-part Online Assessment (OA) testing ML concepts, programming fundamentals, and mathematics, followed by technical interviews and project discussions. Candidates are evaluated on their ability to apply theoretical knowledge to practical problems.\n\n---\n\n## Round Breakdown & Question Analysis\n\n### 1. Online Assessment (OA)\n- Format:\n - Part 1: Multiple-Choice Questions (MCQs) covering:\n - ML Concepts (e.g., supervised/unsupervised learning, model evaluation).\n - Programming Fundamentals (e.g., Python, data structures).\n - Mathematics for ML (e.g., linear algebra, probability, calculus).\n - Part 2: Two medium-level DSA problems.\n - Duration: 75 minutes.\n\n---\n\n### 2. Technical Interviews\n- Focus: In-depth discussion on ML concepts, project work, and problem-solving.\n- Format: Doubt-clearing sessions and mentorship as part of the Amazon ML Summer School 2024. Topics include:\n - ML modules (e.g., neural networks, feature engineering).\n - DSA revisited for ML applications.\n - Behavioral alignment with Amazon\u2019s Leadership Principles.\n\n---\n\n### 3. Internship Application Rounds\n- Format: May include additional technical tests, interviews, and final selection rounds.\n\n---\n\n## Key Takeaways for Candidates\n- ML Fundamentals: Strong grasp of ML concepts and their applications.\n- Mathematics: Proficiency in linear algebra, probability, and calculus.\n- Programming: Comfort with Python and DSA.\n- Projects: Highlight impactful ML projects and problem-solving approaches.\n- Behavioral: Emphasize collaboration, innovation, and customer-centricity.", "SDE-1 / New Grad": "# Amazon SDE-1 / New Grad Hiring: Role-Structured Interview Briefing\n\n---\n\n## Overview\nAmazon\u2019s hiring process for SDE-1 (New Grad) roles is designed to assess technical depth, problem-solving skills, and behavioral alignment. The process typically includes an Online Assessment (OA) followed by 3\u20134 technical interviews. These interviews focus on DSA, CS fundamentals, and system design, with an emphasis on optimization and edge-case handling. Behavioral rounds evaluate alignment with Amazon\u2019s Leadership Principles.\n\n---\n\n## Round Breakdown & Question Analysis\n\n### 1. Online Assessment (OA)\n- Format:\n - Candidates must clear the OA to proceed to technical interviews.\n - Exact question patterns vary but often include medium-to-hard DSA problems.\n\n---\n\n### 2. Technical Interviews\n\n#### Round 1\n- Focus: Dynamic Programming, Stack-based problems.\n- Questions Asked:\n 1. Medium-level 2D DP question.\n 2. Stack question: Find the nearest greater element.\n\n---\n\n#### Round 2\n- Focus: Heaps, Maps, Binary Trees.\n- Questions Asked:\n 1. Non-standard competitive programming question (Heaps + Maps).\n 2. Longest zigzag path in a binary tree.\n\n---\n\n#### Round 3\n- Focus: Binary Search, Array Manipulation, Logic-based problems.\n- Questions Asked:\n 1. Binary search to find an element with frequency two in a sorted array (all other elements unique).\n 2. Logic-based question: Median of two sorted arrays.\n\n---\n\n### 3. Managerial / Leadership Principles Round\n- Focus: Behavioral questions aligned with Amazon\u2019s Leadership Principles.\n- Outcome: Candidates must demonstrate alignment with principles like "Customer Obsession" and "Invent and Simplify.""}}

Migrated to JSONB

{"overview": "Meesho's hiring process is highly structured and rigorous, with a strong emphasis on problem-solving, system design, and practical implementation. The process typically includes multiple rounds such as Online Assessments (OA), technical interviews focused on Data Structures and Algorithms (DSA), machine coding, system design, and managerial or HR rounds. Candidates with prior experience in competitive coding, scalable system design, and real-world project implementations tend to perform better. The company values clarity in thought, clean code, and the ability to handle ambiguity in problem statements.", "by_role": {"SDE-2": "# Meesho SDE-2 Interview Briefing\n\n## Overview\nThe SDE-2 role at Meesho typically involves three to four rounds, including a technical screening, machine coding, system design, and a hiring manager round. The process emphasizes problem-solving in DSA, practical implementation of scalable systems, and deep dives into past projects. Candidates are expected to demonstrate expertise in algorithms, data structures, and system design principles, with a focus on writing clean, optimized, and thread-safe code. The hiring bar is high, and rejections often stem from gaps in implementation or design trade-offs.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Technical Screening (DSA Focus)\nDuration: 1 hour\nPlatform: HackerRank or similar\nFormat: 2 LeetCode-style problems (Medium to Hard)\n\n#### Common Question Patterns:\n- Graphs: Course Schedule II, Number of Islands, Connected Components\n- Dynamic Programming: Palindromic Strings, Weighted Job Scheduling, Minimum Cost for Tickets\n- Greedy Algorithms: Activity Selection Problem, Watering Plants\n- Matrix Problems: Asteroid Collision, Infinite Grid (Knight Moves)\n- Tree-Based: Binary Trees, Low-Level Design (e.g., LLD for an Elevator System)\n\n#### Example Questions:\n- Course Schedule II\n- Container with Most Water\n- Asteroid Collision\n- Minimum Cost for Tickets\n- Number of Islands\n\n---\n\n### 2. Machine Coding Round\nDuration: 1.5 to 2 hours\nPlatform: HackerRank or similar\nFormat: Design and implement a scalable system with specific functionalities\n\n#### Common Problem Statements:\n1. Snake & Ladder Game Design:\n - Implement the game with customizable board sizes, snakes, and ladders.\n - Focus on OOPs principles, thread safety, and clean code.\n\n2. Social Media System (e.g., Facebook-like News Feed):\n - Functionalities: Create Post, Delete Post, Get Feed (Latest of User & Followers), Get Feed Paginated, Follow/Unfollow Users.\n - Emphasis on database design, API design, and pagination.\n\n3. Elevator System Design:\n - Implement an N-Elevator system with thread handling and OOPs principles.\n - Focus on scalability, concurrency, and efficiency.\n\n4. Inventory Management System:\n - Functionalities: addProduct, createOrder, confirmOrder, getInventory.\n - Block inventory until order confirmation and handle concurrent users.\n\n5. Restaurant Rating System:\n - Allow customers to rate food items for branches matching their location.\n - Display average ratings, list ratings for a specific area, and handle multiple branches.\n\n#### Example Problem Statement:\n> Design a Facebook-like News Feed System\n> - Users should be able to post, follow other users, and generate a news feed with pagination support.\n> - Implement APIs for createPost, deletePost, getFeed, followUser, and unfollowUser.\n> - Ensure the system is scalable and handles high traffic.\n\n---\n\n### 3. System Design Round\nDuration: 1 to 1.5 hours\nFormat: High-Level Design (HLD) and Low-Level Design (LLD) discussions\n\n#### Common Problem Statements:\n1. Design a Twitter News Feed:\n - Discuss HLD for a news feed system, including database schema, APIs, and caching strategies.\n - Dive into LLD for components like Post, User, Feed, and Follow relationships.\n\n2. Design a Rating and Review System for E-Commerce:\n - Requirements: User reviews, ratings, sorting by rating/recentness, filtering by ratings, like/dislike reviews.\n - Discuss database design, consistency models (SQL vs. NoSQL), and caching strategies (Redis vs. MongoDB).\n\n3. Design a Rule Engine:\n - Handle rules that increment/decrement values from third-party APIs.\n - Schedule millions of rules, handle rule collisions, and manage failures.\n\n4. Design a Cab Booking System:\n - Implement functionalities like bookRide, cancelRide, getRideStatus, and assignDriver.\n - Focus on scalability, real-time updates, and geospatial indexing.\n\n#### Example Problem Statement:\n> Design a Twitter News Feed System\n> - Discuss the High-Level Design for a news feed system.\n> - Dive into Low-Level Design for components like Post, User, and Feed.\n> - Explain how you would handle caching, database sharding, and feed generation algorithms.\n\n---\n\n### 4. Hiring Manager Round\nDuration: 1 hour\nFormat: Project discussion, behavioral questions, and scenario-based problem-solving\n\n#### Common Topics:\n- Deep dive into projects mentioned in the resume (tech stack choices, alternatives, optimizations).\n- Behavioral questions (e.g., handling failures, working in teams, prioritizing tasks).\n- Scenario-based questions (e.g., designing a system for a sale with limited inventory).\n- Java-specific questions (e.g., garbage collection, threading, JVM optimizations).\n\n#### Example Questions:\n- Explain the tech stack used in your projects and why you chose it over alternatives.\n- How would you handle a sale scenario where only x products are available but y people want them?\n- Discuss your approach to optimizing a Java-based system for performance.\n- Explain garbage collection and its impact on system performance.\n\n---\n\n## Key Takeaways for Candidates\n- Practice DSA: Focus on graphs, DP, greedy algorithms, and tree-based problems.\n- Master System Design: Be comfortable designing scalable systems like news feeds, cab booking, or inventory management.\n- Write Clean Code: Emphasize thread safety, OOPs principles, and clean code practices in machine coding rounds.\n- Prepare Projects: Be ready for deep dives into your projects, including trade-offs, optimizations, and tech stack choices.\n- Mock Interviews: Simulate pressure scenarios (e.g., debugging under time constraints, handling ambiguous problem statements).", "SDE-1 / New Grad": "# Meesho SDE-1 / New Grad Interview Briefing\n\n## Overview\nThe SDE-1 (New Grad) role at Meesho is designed to assess fundamental problem-solving skills, coding proficiency, and basic system design understanding. The process includes an Online Assessment (OA), technical interviews, and HR rounds. The OA typically consists of DSA problems and MCQs, while technical rounds focus on algorithms, data structures, and low-level design. Candidates are expected to demonstrate clarity in thought, clean code practices, and eagerness to learn. The process is rigorous but rewarding for those who prepare systematically.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Online Assessment (OA)\nDuration: 75 to 105 minutes\nPlatform: HackerRank or similar\nFormat: Mix of DSA problems and MCQs\n\n#### Common MCQ Topics:\n- Operating Systems: Semaphores vs. Mutex, Paging, Virtual vs. Physical Memory\n- Computer Networks: ARP, DNS, OSI Model\n- Databases: SQL vs. NoSQL, Normalization, ACID Properties\n- Programming Concepts: C++/Java Output Questions, OOPs Principles\n\n#### Common DSA Problems:\n- Arrays/Strings: Anagram Problems, String Manipulation, Weighted Job Scheduling\n- Graphs: Number of Islands, BFS/DFS Traversals\n- Dynamic Programming: LIS (Longest Increasing Subsequence), Palindromic Substrings\n- Greedy Algorithms: Activity Selection Problem, Watering Plants\n- Miscellaneous: Binary Search, Bit Manipulation\n\n#### Example Questions:\nMCQs:\n- Explain the difference between semaphore and mutex.\n- What are the ACID properties in databases?\n- Describe the OSI model and its layers.\n\nDSA Problems:\n1. Activity Selection Problem\n2. Weighted Job Scheduling\n3. Number of Islands\n4. Reverse a String with A<->G and C<->T Substitutions\n5. Minimum Degree of a Connected Trio in a Graph\n\n---\n\n### 2. Technical Interviews\nDuration: 1 to 1.5 hours per round\nPlatform: HackerRank CodePair or similar\nFormat: Problem-solving and discussion\n\n#### Round 1: DSA Focus\n- Format: 2 to 3 LeetCode-style problems (Medium to Hard)\n- Topics: Arrays, Strings, Graphs, DP, Greedy Algorithms\n\n#### Round 2: Low-Level Design (LLD) or System Design\n- Format: Design a small-scale system or implement OOPs concepts\n- Topics: Singleton Class, Factory Pattern, Observer Pattern, Basic APIs\n\n#### Example Questions:\nDSA Problems:\n1. Longest Substring with At Least K Repeating Characters\n2. Making a Large Island\n3. Pair of Nodes Equal to Given Sum (BST)\n4. Kth Node from the Last (Linked List)\n5. Add Two Numbers Represented by Linked Lists (Stack-Based)\n\nLLD/System Design:\n1. Design a Cab Booking System\n - Implement bookRide, cancelRide, getRideStatus, and assignDriver.\n - Focus on OOPs principles and basic error handling.\n2. Design a Facebook-like News Feed System\n - Implement APIs for createPost, deletePost, getFeed, followUser, and unfollowUser.\n - Discuss database schema and pagination.\n\n---\n\n### 3. HR/Technical Round\nDuration: 1 hour\nFormat: Project discussion, conceptual questions, and situational scenarios\n\n#### Common Topics:\n- Project Deep Dives: Tech stack choices, trade-offs, optimizations\n- Conceptual Questions:\n - Computer Networks: ARP, DNS, OSI Model\n - Databases: SQL vs. NoSQL, Normalization, Indexing\n - OOPs: Inheritance, Polymorphism, Encapsulation\n- Situational Questions:\n - How would you handle a project that needs to be restarted after 3-4 days?\n - How would you ensure exactly x purchases occur during a sale with high demand?\n\n#### Example Questions:\n- Explain the tech stack used in your projects and why you chose it.\n- Discuss real-world scenarios like handling a sale with limited inventory.\n- What are the differences between SQL and NoSQL databases?\n\n---\n\n## Key Takeaways for Candidates\n- Practice DSA: Focus on arrays, strings, graphs, DP, and greedy algorithms.\n- Master MCQs: Revise OS, CN, DBMS, and OOPs concepts.\n- Mock Interviews: Simulate pressure scenarios with time constraints.\n- Prepare Projects: Be ready for deep dives into your projects, including trade-offs and optimizations.\n- System Design Basics: Understand basic APIs, database design, and OOPs principles for LLD rounds.", "Intern": "# Meesho Intern Interview Briefing\n\n## Overview\nThe Intern role at Meesho is highly competitive, with a selection rate of less than 0.01% due to the sheer volume of applicants. The process includes multiple rounds such as screening tests, coding assessments, low-level design (LLD), and hiring manager rounds. The focus is on fundamental DSA skills, basic system design understanding, and problem-solving under pressure. Candidates who demonstrate clarity in thought, clean code practices, and eagerness to learn tend to stand out. The process is rigorous but provides valuable learning opportunities.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Screening Test\nDuration: 30 minutes\nPlatform: NextLevel mobile app or similar\nFormat: MCQs and verbal questions\n\n#### Common MCQ Topics:\n- Operating Systems: Process Management, Memory Management\n- Data Structures and Algorithms: Arrays, Strings, Graph Traversals\n- Computer Networks: ARP, DNS, OSI Model\n- Error Handling: Debugging, Exception Handling\n\n#### Verbal Questions:\n- Evaluated by AI for clarity of thought and communication skills.\n\n---\n\n### 2. Coding Assessment\nDuration: 90 to 105 minutes\nPlatform: HackerRank or similar\nFormat: 3 DSA problems (Medium to Hard)\n\n#### Common Problem Topics:\n- Binary Search\n- Dynamic Programming (DP)\n- Segment Tree\n- Graph Algorithms (BFS/DFS)\n- Greedy Algorithms\n\n#### Example Questions:\n1. Binary Search: Search in a sorted array with rotations.\n2. Dynamic Programming: Longest Increasing Subsequence (LIS).\n3. Segment Tree: Range sum queries or update operations.\n4. Graph Algorithms: BFS-based pathfinding in a 2D matrix.\n\n---\n\n### 3. Low-Level Design (LLD) Round\nDuration: 85 to 90 minutes\nFormat: Design and implement a small-scale system\n\n#### Common Problem Statements:\n1. Inventory Management System:\n - Functionalities: addProduct, createOrder, confirmOrder, getInventory.\n - Focus on SOLID principles, design patterns, and thread safety.\n\n2. Chat Application:\n - Design a basic chat system with functionalities like sendMessage, createGroup, and addUser.\n - Discuss database schema, APIs, and real-time updates.\n\n#### Example Problem Statement:\n> Design an Inventory Management System\n> - Implement addProduct, createOrder, confirmOrder, and getInventory.\n> - Ensure inventory quantities are blocked until order confirmation.\n> - Use SOLID principles and design patterns (e.g., Singleton, Factory).\n\n---\n\n### 4. Hiring Manager Round\nDuration: 45 minutes\nFormat: Project discussion, situational questions, and behavioral assessment\n\n#### Common Topics:\n- Project Deep Dives: Tech stack choices, challenges faced, and optimizations.\n- Situational Questions:\n - How would you handle a project that needs to be restarted after 3-4 days?\n - How would you design a system for high-traffic scenarios?\n- Behavioral Questions: Teamwork, problem-solving under pressure.\n\n#### Example Questions:\n- Explain the design choices in your projects.\n- How would you handle a situation where your approach is deemed flawed?\n- Discuss your understanding of transactional concepts in Spring Boot.\n\n---\n\n## Key Takeaways for Candidates\n- Practice DSA: Focus on binary search, DP, segment trees, and graph algorithms.\n- Revise MCQs: Brush up on OS, CN, DBMS, and error handling concepts.\n- Mock Interviews: Simulate pressure scenarios with time constraints.\n- Prepare Projects: Be ready for deep dives into your projects, including trade-offs and optimizations.\n- System Design Basics: Understand basic APIs, database design, and OOPs principles for LLD rounds.", "SDE-3 / Senior": "# Meesho SDE-3 / Senior Interview Briefing\n\n## Overview\nThe SDE-3 / Senior role at Meesho targets candidates with 4+ years of experience and a strong focus on scalable system design, distributed systems, and leadership in implementation. The process includes machine coding, system design, and bar raiser rounds, with an emphasis on practical problem-solving, trade-off analysis, and mentorship potential. Candidates are expected to demonstrate deep expertise in algorithms, architecture design, and ability to handle ambiguity. The hiring bar is exceptionally high, and rejections often stem from gaps in scalability considerations or design trade-offs.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Machine Coding Round\nDuration: 2 hours\nPlatform: HackerRank or similar\nFormat: Design and implement a scalable system with a focus on concurrency and OOPs principles\n\n#### Common Problem Statements:\n1. N Elevator System:\n - Implement an N-Elevator system with thread handling and OOPs principles.\n - Focus on scalability, efficiency, and thread safety.\n\n2. Inventory/Order Management Service:\n - Design a service to handle concurrent users, thread safety, and real-time updates.\n - Implement functionalities like addProduct, createOrder, confirmOrder, and getInventory.\n\n3. Custom Ad Service:\n - Design a scalable ad service with a focus on microservices architecture and high availability.\n\n#### Example Problem Statement:\n> Design an N-Elevator System\n> - Implement the system with a focus on thread handling, OOPs principles, and scalability.\n> - Ensure the system can handle concurrent requests and real-time updates.\n\n---\n\n### 2. System Design Round\nDuration: 1 to 1.5 hours\nFormat: High-Level Design (HLD) and Low-Level Design (LLD) discussions\n\n#### Common Problem Statements:\n1. Design a Trading Platform:\n - Discuss HLD for a trading platform with a focus on scalability, real-time updates, and data consistency.\n - Dive into LLD for components like Order Matching Engine, User Management, and Transaction Processing.\n\n2. Design a Rule Engine:\n - Handle millions of rules with scheduling, collision handling, and failure management.\n - Discuss database design, caching strategies, and API design.\n\n3. Design a Restaurant Rating System:\n - Allow customers to rate food items for branches matching their location.\n - Implement average rating calculations, filtering, and scalability considerations.\n\n#### Example Problem Statement:\n> Design a Trading Platform\n> - Discuss the High-Level Design for a trading platform.\n> - Dive into Low-Level Design for components like Order Matching Engine and User Management.\n> - Explain how you would handle real-time updates, data consistency, and scalability.\n\n---\n\n### 3. Bar Raiser Round\nDuration: 1 hour\nFormat: Follow-up on weaker areas, scenario-based questions, and distributed systems design\n\n#### Common Topics:\n- Distributed Systems Design: CAP Theorem, Consistency Models, Sharding Strategies\n- Algorithms: Complex DSA problems, trade-off analysis\n- Scenario-Based Questions:\n - How would you design a system for a high-traffic scenario?\n - How would you handle rule collisions in a rule engine?\n- Leadership and Mentorship: Discuss your experience in mentoring junior engineers or leading projects.\n\n#### Example Questions:\n- Explain the CAP Theorem and its implications on system design.\n- How would you design a system to handle millions of concurrent users?\n- Discuss your experience in mentoring junior engineers or leading technical projects.\n\n---\n\n### 4. Non-Technical Round\nDuration: 1 hour\nFormat: HR and hiring manager discussion\n\n#### Common Topics:\n- Project Deep Dives: Discuss your most challenging projects, design decisions, and trade-offs.\n- Behavioral Questions:\n - How do you handle conflicts in a team?\n - How do you prioritize tasks in a high-pressure environment?\n- Values and Principles: Discuss your alignment with Meesho's culture and values.\n\n#### Example Questions:\n- Describe a challenging project you led and the lessons learned.\n- How do you handle a situation where your approach is deemed flawed?\n- What values do you bring to a team?\n\n---\n\n## Key Takeaways for Candidates\n- Master System Design: Focus on scalable architectures, distributed systems, and trade-off analysis.\n- Practice DSA: Be comfortable solving complex DSA problems under time constraints.\n- Mock Interviews: Simulate real-world scenarios with ambiguous problem statements.\n- Prepare Projects: Be ready for deep dives into your most challenging projects.\n- Leadership Skills: Highlight your experience in mentoring, leading projects, and handling conflicts.\n- Culture Fit: Understand Meesho's values and principles and align them with your experiences.", "Data Science / ML": "# Meesho Data Science / ML Interview Briefing\n\n## Overview\nThe Data Science / ML role at Meesho focuses on SQL, Spark, data modeling, and distributed computing. The process includes multiple technical rounds covering SQL queries, Spark internals, data modeling, and managerial discussions. Candidates are expected to demonstrate strong problem-solving skills, proficiency in big data tools, and ability to optimize queries and pipelines. The hiring bar is high, and rejections often stem from gaps in practical implementation or scalability considerations.\n\n---\n\n## Round Breakdown & Questions\n\n### 1. Technical Round (SQL and Spark Coding)\nDuration: 1 hour\nPlatform: External agency or Meesho panel\nFormat: SQL queries and Spark coding problems\n\n#### Common SQL Topics:\n- Joins: Inner, Left, Right, Full Outer Joins\n- Subqueries: Correlated and Non-Correlated Subqueries\n- Window Functions: ROW_NUMBER(), RANK(), DENSE_RANK(), PARTITION BY\n- Aggregations: GROUP BY, HAVING, COUNT, SUM, AVG\n- Complex Queries: Self-joins, CTEs (Common Table Expressions)\n\n#### Common Spark Topics:\n- RDDs vs. DataFrames: Pros and Cons\n- Transformations vs. Actions: Lazy Evaluation\n- Optimizations: Partitioning, Caching, Broadcast Variables\n- Internals: Spark Architecture, Executors, Drivers\n\n#### Example Questions:\nSQL Problems:\n1. Write a query to find the second-highest salary in a table.\n2. Find the number of orders placed by each customer and filter for customers with more than 5 orders.\n3. Use window functions to rank employees by salary within each department.\n\nSpark Problems:\n1. Optimize a slow-running Spark job by identifying bottlenecks.\n2. Explain the difference between RDDs and DataFrames and when to use each.\n3. How would you handle skewed data in a Spark job?\n\n---\n\n### 2. Technical Round (Data Modeling and Spark Internals)\nDuration: 1 hour\nPlatform: Meesho panel\nFormat: Data modeling and Spark internals discussion\n\n#### Common Data Modeling Topics:\n- Star Schema vs. Snowflake Schema: Pros and Cons\n- Normalization vs. Denormalization: Trade-offs\n- Indexing Strategies: B-Tree, Hash, Bitmap Indexes\n- Partitioning Strategies: Range, Hash, List Partitioning\n\n#### Common Spark Internals Topics:\n- Spark Architecture: Drivers, Executors, Cluster Managers\n- Shuffling: How it works and how to minimize it\n- Caching: When and how to cache RDDs/DataFrames\n- Broadcast Variables: Use cases and limitations\n\n#### Example Questions:\n1. Design a star schema for an e-commerce platform.\n2. Explain the difference between partitioning and bucketing in Spark.\n3. How would you optimize a Spark job that is experiencing frequent shuffles?\n4. Discuss the trade-offs between normalization and denormalization in a data warehouse.\n\n---\n\n### 3. Managerial Round\nDuration: 1 hour\nPlatform: Meesho panel\nFormat: Project discussion, behavioral questions, and scenario-based problem-solving\n\n#### Common Topics:\n- Project Deep Dives: Discuss your most challenging data science projects, tech stack choices, and trade-offs.\n- Behavioral Questions:\n - How do you handle conflicts in a team?\n - How do you prioritize tasks in a high-pressure environment?\n- Scenario-Based Questions:\n - How would you design a recommendation system for Meesho\u2019s e-commerce platform?\n - How would you optimize a slow-running Spark job for large-scale data?\n\n#### Example Questions:\n1. Describe a challenging data science project you led and the lessons learned.\n2. How would you handle a situation where your model\u2019s predictions are inaccurate?\n3. Discuss your experience with A/B testing and experimentation frameworks.\n\n---\n\n## Key Takeaways for Candidates\n- Master SQL: Focus on joins, window functions, aggregations, and complex queries.\n- Understand Spark Internals: Be comfortable discussing RDDs, DataFrames, partitioning, caching, and optimizations.\n- Practice Data Modeling: Understand star schema, snowflake schema, normalization, and indexing strategies.\n- Prepare Projects: Be ready for deep dives into your most challenging data science projects.\n- Mock Interviews: Simulate real-world scenarios with ambiguous problem statements.\n- Behavioral Preparation: Highlight your leadership skills, conflict resolution, and prioritization strategies."}}