Meesho Web Developer Interview Questions and Answers

Question are very tough and faad

Question like trees linked list and graphs

Aptitude is generally ask some MCQ choice questions like time, speed, distance etc

Front end developer have some knowledge in HTML CSS javascript php so ask this language

GD is nothing but it's testing our community and quality of thought in your opinion

Q1. Max sum path in tree
Ans. 
Find the maximum sum path in a tree from root to leaf node.
• Start from the root node and traverse down to leaf nodes, keeping track of the sum at each node.

• At each node, compare the sum of the current path with the maximum sum found so far.

• Choose the path with the maximum sum as the final result.
Answered by AI
Add your answer
Q2. Array 2 sum problem
Add your answer

Q1. React: Create a Timer
Ans. 
Create a simple timer using React
• Use state to store the timer value

• Use setInterval to update the timer every second

• Display the timer value in the component's render method
Answered by AI
Add your answer
Q2. Javascript: implement Debounce
Add your answer

Q1. What do you know about the company + common behaviour question
Add your answer
Q2. About roles in previous org
Add your answer

Coding test in javascript

Q1. React js questions
Add your answer
Q2. Angular js questions
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Mostly focused on Data Structure & Algorithm

Q1. 
Rotate Linked List Problem Statement
Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.
Example:
Input:
Li...read more
Ans. Brute Force
Find the length of the Linked List to check whether the ‘K’ is greater than the Length of the Linked List or not. Take a modulo of ‘K’ with its length if it is greater than the length. Reach the (‘K’+1)th node from last and change the pointers of nodes to get a rotated Linked List.
 
Here is the algorithm:
 
1. Base Condition : If ‘HEAD’ is equal to ‘NULL’ or ‘K’ is equal to 0, then return ‘HEAD’ of the L...read more
Answered Anonymously
Add your answer
Q2. 
Reverse Words in a String
Given a string STR consisting of words separated by spaces, reverse the order of words in STR.
Note:
A word is defined as a sequence of non-space characters. Attempt to perform...read more
Ans. Convert to an array of words
Use an array ‘ARR’ to store the words in ‘STR’. Traverse the string ‘STR’ and append each word at the end of ‘ARR’. Use the string ‘RES’ to store the answer. Traverse the array ‘ARR’ in reverse and append the words in ‘ARR’ to ‘RES’ followed by a whitespace character.
 
• Create an empty array of string ‘ARR’.
• Initialize an empty string ‘CUR_STR’. Use it to store a single word from ‘STR’.
• Run...read more
Answered Anonymously
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

JavaScript core concepts with some examples and problem discussion

Round duration - 30 Minutes
Round difficulty - Easy