Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Meesho Team. If you also belong to the team, you can get access from here

Meesho Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Meesho Software Developer Intern Interview Questions and Answers

Updated 11 Apr 2024

Meesho Software Developer Intern Interview Experiences

2 interviews found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. It was based on dynamic programming

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA very well
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via LinkedIn and was interviewed in Dec 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. System design, coding and debugging

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

Interview questions from similar companies

I appeared for an interview before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

The test had 3 questions which had to solved in 75 minutes.The test was of medium difficulty.

  • Q1. 

    Meeting Rooms Allocation Problem Statement

    Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...

  • Ans. 

    Determine the minimum number of conference rooms needed to schedule meetings without overlap.

    • Sort the meetings by start time.

    • Iterate through the meetings and keep track of the rooms in use.

    • If a meeting starts after another ends, it can reuse the same room.

    • If a meeting starts before another ends, a new room is needed.

    • Return the maximum number of rooms in use at any point.

  • Answered by AI
  • Q2. 

    Maximize XOR Value

    You are provided with an integer X and are tasked with identifying an integer Y such that the bitwise XOR operation between X and Y yields the maximum possible value. The condition is t...

  • Ans. 

    Find an integer Y such that XOR operation with X yields maximum value within given constraints.

    • Iterate from the most significant bit to find the highest bit that can be toggled to maximize XOR value.

    • To maximize XOR value, toggle the highest bit of X to 0 and all lower bits to 1.

    • Ensure the final Y does not exceed (2^61) - 1.

    • Example: For X = 3, the highest bit to toggle is at position 61, so Y = 2305843009213693950.

    • Examp...

  • Answered by AI
  • Q3. 

    Minimize Maximum Difference Between Adjacent Elements

    You are provided with a non-decreasing array and an integer K. Your task is to remove exactly K elements from this array so that the maximum differenc...

  • Ans. 

    Remove K elements from a non-decreasing array to minimize the maximum difference between adjacent elements.

    • Sort the array in non-decreasing order.

    • Iterate through the array and calculate the difference between adjacent elements.

    • Remove elements to minimize the maximum difference.

    • Return the minimized maximum difference.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interview was taken by SDE2 and she was very friendly. All the questions asked were related to DS and algo. The first 10 minutes were used for introductions and the last 5 minutes were reserved for any questions that I have. Always try to ask meaningful questions at the end of the interview.

  • Q1. 

    Frequency in a Sorted Array Problem Statement

    Given a sorted array ARR and a number X, your task is to determine the count of occurrences of X within ARR.

    Note:

    • If X is not found in the array, return...
  • Ans. 

    Count occurrences of a number in a sorted array efficiently.

    • Use binary search to find the first and last occurrence of the target number in the array.

    • Calculate the count of occurrences by subtracting the indices of the last and first occurrences.

    • Handle cases where the target number is not found in the array.

    • Time complexity: O(log(N)), Space complexity: O(1).

  • Answered by AI
  • Q2. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases such as no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process neighboring oranges

  • Answered by AI
  • Q3. 

    Clone Linked List with Random Pointer Problem Statement

    Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...

  • Ans. 

    Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.

    • Use a hashmap to store the mapping between original nodes and cloned nodes.

    • Iterate through the original linked list to create the cloned linked list by mapping the random pointers using the hashmap.

    • Time complexity of this approach is O(N) where N is the number of nodes in the linked list.

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 minutes
Round difficulty - Medium

The focus of this round was mainly on my projects and internships. It was taken by a Senior SDE and it more of a technical interaction. I was asked in-depth about my projects and most of the questions asked around OS/DBMS were based on my projects.
The interviewer wanted to judge whether I have core knowledge about subjects like OS and DBMS and also about the projects that I had done.

Round 4 - HR 

Round duration - 60 minutes
Round difficulty - Easy

It was the culture fit round taken by the Director of Engineering.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in GurgaonEligibility criteriaNoneUrban Clap interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Dynamic programming, Algorithms, DBMS, OSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Learn the concepts, not the solutions.
Tip 2 : You should have deep knowledge about the projects mentioned in your resume.

Application resume tips for other job seekers

Tip 1 : Resume should be only 1 page.
Tip 2 : Try to tell a story through your resume. For eg - always mention the impact or scale of your projects/internship.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Stock buy and sell with at most 2 transaction
  • Ans. 

    Implement a solution to find the maximum profit from buying and selling stocks with at most 2 transactions.

    • Use dynamic programming to keep track of maximum profit at each day with 0, 1, or 2 transactions.

    • Consider the possibility of splitting the transactions into two separate parts.

    • Calculate the maximum profit by iterating through the prices array and updating the maximum profit accordingly.

  • Answered by AI
  • Q2. Binary search to find target
  • Ans. 

    Binary search is a divide and conquer algorithm that efficiently finds a target value in a sorted array.

    • Divide the array in half and compare the target value with the middle element

    • If the target is less than the middle element, search the left half. If greater, search the right half

    • Repeat the process until the target is found or the subarray is empty

  • Answered by AI
Round 2 - System Design 

(2 Questions)

  • Q1. General about project
  • Q2. Design paytm wallet
  • Ans. 

    Design a digital wallet system similar to Paytm.

    • Allow users to add money to their wallet using various payment methods like credit/debit cards, net banking, UPI, etc.

    • Enable users to make payments for various services like mobile recharge, bill payments, online shopping, etc.

    • Implement security measures like two-factor authentication, encryption of sensitive data, and regular security audits.

    • Provide features like transac...

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. What is thread ?
  • Ans. 

    A thread is a lightweight process that can run concurrently with other threads within the same process.

    • Threads allow for parallel execution of tasks within a single process.

    • Threads share the same memory space and resources of the process they belong to.

    • Threads can communicate with each other through shared memory or message passing.

    • Examples: Java threads, POSIX threads (pthreads) in C/C++.

  • Answered by AI
  • Q2. Inter process communication and project?

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Seat reservation system
bit manipulation
binary tree related

Round 3 - Technical 

(1 Question)

  • Q1. Bfs / dfs traversal question
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Hackerrank LeetCode 2 Hard questions and 1 medium

Interview Preparation Tips

Interview preparation tips for other job seekers - Hackerrank questions are so absurd I had to write input and output stuff more than core logic
Interview experience
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.

Round 1 - Coding Test 

1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

HAckerrank based test

Meesho Interview FAQs

How many rounds are there in Meesho Software Developer Intern interview?
Meesho interview process usually has 1 rounds. The most common rounds in the Meesho interview process are Technical.
What are the top questions asked in Meesho Software Developer Intern interview?

Some of the top questions asked at the Meesho Software Developer Intern interview -

  1. It was based on dynamic programm...read more
  2. system design, coding and debugg...read more

Tell us how to improve this page.

Meesho Software Developer Intern Interview Process

based on 3 interviews

Interview experience

3.3
  
Average
View more
Key Account Manager
756 salaries
unlock blur

₹2.8 L/yr - ₹6.9 L/yr

City Manager
205 salaries
unlock blur

₹4 L/yr - ₹10 L/yr

Business Analyst
194 salaries
unlock blur

₹8 L/yr - ₹22.8 L/yr

Business Development Manager
169 salaries
unlock blur

₹3.5 L/yr - ₹7.5 L/yr

Team Lead
164 salaries
unlock blur

₹1.6 L/yr - ₹9 L/yr

Explore more salaries
Compare Meesho with

Amazon

4.1
Compare

Flipkart

3.9
Compare

Myntra

4.0
Compare

GlowRoad

4.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview