Meesho | SDE-2 | Interview Experice

meesho logo
meesho
SDE-22.2 yearsOffer
December 16, 202226 reads

Summary

I recently interviewed at Meesho for the SDE-2 role and received an offer. The interview process consisted of three distinct rounds: a Problem Solving & Data Structures round with two specific coding problems, a Machine Coding round focused on designing the Snake & Ladder game, and a final Hiring Manager round covering project discussions and behavioral questions.

Full Experience

I'm a B.E. (IEE - 2020 Graduate) from a Tier 1 college with 2.2 years of experience as an SDE 1 - Backend at a product-based company. Recently, I interviewed at Meesho for the SDE-2 position. The interview process comprised three rounds.

The first was a Problem Solving & Data Structures Round lasting an hour. I was given two coding questions to solve. The first problem was 'Minimum steps to reach target by a knight', and the second was 'Remove All Adjacent Duplicates in String II'. I was able to approach both effectively.

Next was the Machine Coding Round, which lasted 1 hour and 30 minutes. This round involved designing the classic Snake & Ladder game. I focused on designing a robust and extensible solution for this challenge.

Finally, I had the Hiring Manager Round, which was an hour long. This round primarily revolved around discussions about my past projects and a series of behavioral questions to assess my fit within the team and company culture.

Ultimately, I received an offer and was selected for the SDE-2 role.

Interview Questions (3)

Q1
Minimum Steps to Reach Target by a Knight
Data Structures & AlgorithmsMedium

Given a knight on a standard chessboard and a target position, find the minimum number of steps required for the knight to reach the target from its starting position. You need to account for the unique 'L' shaped movement of a knight.

Q2
Remove All Adjacent Duplicates in String II
Data Structures & AlgorithmsMedium

You are given a string s and an integer k. A k-duplicate removal consists of choosing k adjacent and identical letters from s and removing them, causing the left and right sides of the deleted substring to concatenate. We repeatedly make k-duplicate removals on s until we no longer can. Return the final string after all such duplicate removals have been made. The task is to implement this logic efficiently.

Q3
Snake & Ladder Game Design
System DesignHard

Design a functional and extensible Snake & Ladder game. The design should cover core game mechanics such as player turns, dice rolls, board representation (including snakes and ladders positions), and win conditions. Additionally, consider aspects like object-oriented design principles, extensibility for future features (e.g., multiple players, different board sizes), and error handling.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!