Upload Button Icon Add office photos
Premium Employer

i

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

Myntra

Compare button icon Compare button icon Compare

Filter interviews by

Myntra Mern Stack Developer Interview Questions, Process, and Tips

Updated 5 Nov 2021

Myntra Mern Stack Developer Interview Experiences

1 interview found

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Given the head node of a singly linked list, return a pointer to the middle node. If there are an odd number of elements, return the middle element. If there are even elements, return the one farther from the head node.

    • Traverse the linked list using two pointers, one moving one node at a time and the other moving two nodes at a time.

    • When the fast pointer reaches the end of the list, the slow pointer will be at the midd...

  • Answered by AI
  • Q2. 

    Huffman Coding Challenge

    Given an array ARR of integers containing 'N' elements where each element denotes the frequency of a character in a message composed of 'N' alphabets of an alien language, your ta...

  • Ans. 

    The task is to find the Huffman codes for each alphabet in an encoded message based on their frequencies.

    • The Huffman code is a binary string that uniquely represents each character in the message.

    • The total number of bits used to represent the message should be minimized.

    • If there are multiple valid Huffman codes, any of them can be printed.

    • The input consists of multiple test cases, each with an array of frequencies.

    • Impl...

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    The question asks to find the total amount of rainwater that can be trapped in the given elevation map.

    • Iterate through the array and find the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by subtracting its height from the minimum of the maximum heights on the left and right.

    • Sum up the amount of water trapped at each bar to get the total amount of rainwat

  • Answered by AI
  • Q2. 

    Path Reversals Problem Statement

    You are provided with a directed graph and two nodes, 'S' and 'D'. Your objective is to determine the minimum number of edges that need to be reversed to establish a path ...

  • Ans. 

    The task is to find the minimum number of edges that need to be reversed in a directed graph to find the path from a start node to an end node.

    • The problem can be solved using graph traversal algorithms like Breadth First Search (BFS) or Depth First Search (DFS).

    • Start by creating an adjacency list representation of the directed graph.

    • Perform a BFS or DFS from the start node to the end node, keeping track of the number o...

  • Answered by AI
  • Q3. 

    Triplets with Given Sum Problem

    Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.

    Explanation:

    A t...

  • Ans. 

    The task is to find all distinct triplets in an array that add up to a given sum.

    • Iterate through the array and fix the first element of the triplet.

    • Use two pointers approach to find the other two elements that sum up to the remaining target.

    • Handle duplicates by skipping duplicate elements while iterating.

    • Return the list of valid triplets.

  • Answered by AI
Round 3 - HR 

Round duration - 25 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as MERN Stack Developer in GurgaonEligibility criteriaNo criteriaMyntra interview preparation:Topics to prepare for the interview - DSA, OOPS, React Fundamentals, OS, JavascriptTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Emphasizing on the importance of proficiency in data structures and algorithms for acing the interviews, which is true in any case.
Tip 2 : Do some good projects. (3 projects are more than sufficient)
Tip 3 : Create your resume of only one page.

Application resume tips for other job seekers

Tip 1 : Mention Projects
Tip 2 : Highlight Ranks in Competitive Programming

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

Software Developer Interview Questions & Answers

Snapdeal user image Adithya H K Upadhya

posted on 3 Dec 2015

Interview Preparation Tips

Round: Test
Experience: An aptitude test which was followed by three rounds of technical interviews and finally the HR interview.

Round: HR Interview
Experience: Snapdeal offered placements for 5 students (3 from CS and 2 from IT).

General Tips: Be extremely well prepared for any company. Research about the company's profile extensively before the company's interview. HR panel always looks for candidates who are well aware of the company in order to measure the candidate's interest. Data structures are absolutely necessary for any company. Improve coding skills through frequent participation in competitive programming arena such as codeForces, codeChef, HackerEarth etc. "Software development job profile was offered to me.
Unnecessary and irrelevant questions are to be avoided. We should raise questions only if we have some genuine questions. However any question related to job profile or location preference could be raised. "
"It was very grueling and tiring at first but the sweet taste of placement makes it all worth it.
Placements are a turning point in everybody's career."
Skill Tips: Snapdeal is more focussed on Data structures and object oriented technology.
For data structures, online materials such as GeeksforGeeks are excellent and in case of OOPS concepts, stronghold in either C++ or java programming language is necessary.
Skills:
College Name: NIT Surathkal

Interview Questionnaire 

1 Question

  • Q1. Questions based on tree

Interview Preparation Tips

Round: Test
Experience: Keep your Calm
Tips: Practice matters
Duration: 90 minutes
Total Questions: 30

Round: Interview
Tips: They are not going to eat you.. they will help you out only...
So just go inside the interview room as some of your friends called you to ask some question..relax

Skills: Thinking Process
College Name: IIT GUWHATI

Interview Questionnaire 

7 Questions

  • Q1. Discussion on internship at IBM' Cloud Unit
  • Q2. Find LCM of all numbers from 1 to n. Give an algorithm, then correctly estimate the time complexity
  • Ans. 

    Algorithm to find LCM of all numbers from 1 to n and its time complexity

    • Find prime factors of all numbers from 1 to n

    • For each prime factor, find the highest power it appears in any number from 1 to n

    • Multiply all prime factors raised to their highest power to get LCM

    • Time complexity: O(n*log(log(n)))

  • Answered by AI
  • Q3. SQL vs NoSQL. Why NoSQL
  • Ans. 

    NoSQL databases are flexible, scalable, and can handle large amounts of unstructured data.

    • NoSQL databases are schema-less, allowing for easy and flexible data modeling.

    • They can handle large amounts of unstructured data, making them suitable for big data applications.

    • NoSQL databases are highly scalable and can easily handle high traffic and large user bases.

    • They provide horizontal scalability by distributing data across...

  • Answered by AI
  • Q4. Some DBMS designing question relating to Snapdeal website
  • Q5. JAVA-Spring and Hibernate
  • Q6. Variation of -----/ Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n
  • Ans. 

    The question asks to find the count of words in a dictionary that can be formed by a given number.

    • Iterate through each word in the dictionary

    • Check if the characters in the word can be formed using the given number

    • Increment the count if the word can be formed

  • Answered by AI
  • Q7. Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H...

Interview Preparation Tips

Round: Test
Experience: I did both coding question ( 1 full and 2nd partial ) and 5 MCQ only and was shortlisted
Tips: Refer to interview sets on Geeksforgeeks.
Do solve both the coding questions first. Not necessary to pass all test cases for both.
Then go for C based o/p questions. At last aptitude.
Duration: 60 minutes
Total Questions: 23

Round: Technical Interview
Experience: I did not know JAVA and DBMS so could not answer any of the last 2 questions. I told him directly thati had no experience in JAVA / DBMS and justified. I had proficiency in Data Structure and Algorithms and I beleive the interviewer liked my internship work on Cloud / Virtualization
Tips: Focus on Data Strucure-Algorithms, JAVA, DBMS, Puzzles

Round: Test
Experience: All repeated questions from previous interviews.
Tips: Refer interview set from geeksforgeeks.org
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: For the first question, I started by exponential solution and reduced it to polynomial. We
discussed various approaches and tried a variety of methods and after
1-1.5 hrs of discussion finally ended up with an O(1) solution with some
pre-processing overhead. After achiveing O(1) time complexity, he asked
to further optimize the space complexity.

Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.
Tips: Focus on Tree, Stacks, Queue, Linked List, Hash Maps, Trie, Hashing, String Algorithms, Ternary Search Tree

Round: HR Interview
Experience: Typical HR

General Tips: Practice programming
Skill Tips: Focus on Data Structure-Algorithms and programming in either C++ / JAVA
Skills: Data Structure, Algorithms, Programing, JAVA, DBMS
College Name: Indian Institute of Information Technology, Design and Manufacturing, Jabalpur
Motivation: -
Funny Moments: -

Skills evaluated in this interview

Interview Questionnaire 

16 Questions

  • Q1. Lowest Common Ancestor of two nodes in binary tree.I wrote code for this.Then interviewer drew a tree and asked to print stacktrace on it
  • Ans. 

    Finding lowest common ancestor of two nodes in binary tree

    • Traverse the tree from root to both nodes and store the paths in separate arrays

    • Compare the paths to find the last common node

    • Return the last common node as the lowest common ancestor

    • Use recursion to traverse the tree efficiently

  • Answered by AI
  • Q2. You are given two ropes.Each rope takes exactly 1 hour to burn. How will you measure period of 45 minutes
  • Q3. Singleton Design pattern
  • Q4. Two linked list are merging at a point.Find merging point
  • Ans. 

    To find the merging point of two linked lists

    • Traverse both linked lists and find their lengths

    • Move the pointer of the longer list by the difference in lengths

    • Traverse both lists simultaneously until they meet at the merging point

  • Answered by AI
  • Q5. Reverse linked list without recursion
  • Ans. 

    Reverse a linked list iteratively

    • Create three pointers: prev, curr, and next

    • Initialize prev to null and curr to head

    • Loop through the list and set next to curr's next node

    • Set curr's next node to prev

    • Move prev and curr one step forward

    • Return prev as the new head

  • Answered by AI
  • Q6. Number of rectangles in MxN matrix
  • Ans. 

    The number of rectangles in an MxN matrix can be calculated using a formula.

    • The formula is (M * (M + 1) * N * (N + 1)) / 4

    • The matrix can be divided into smaller sub-matrices to count the rectangles

    • The number of rectangles can also be calculated by counting all possible pairs of rows and columns

  • Answered by AI
  • Q7. All anagrams of a string.He called it anagram but i think he wanted to ask all possible substrings of a string
  • Q8. Which Design patterns you have used.I said Decorator,Factory,Singleton.Then he asked about Decorator design pattern
  • Q9. Tell me about yourself.Then by looking at my resume he said you don’t have hands on experience in Java as i was working in php.I said though i don’t have hands on experience but i am good in programming an...
  • Q10. There is four digit number in aabb form and it is a perfect square.Find out the number
  • Ans. 

    The number is 7744.

    • The number must end in 00 or 44.

    • The square root of the number must be a whole number.

    • The only possible number is 7744.

  • Answered by AI
  • Q11. You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,...
  • Q12. Same tell me about yourself
  • Ans. 

    I am a software developer with experience in multiple programming languages and a passion for problem-solving.

    • Proficient in Java, Python, and C++

    • Experience with web development using HTML, CSS, and JavaScript

    • Familiarity with agile development methodologies

    • Strong problem-solving and analytical skills

    • Passionate about learning new technologies and staying up-to-date with industry trends

  • Answered by AI
  • Q13. There is a file which contains ip addresses and corresponding url. Example 192.168.1.15 www.abc.com 10.255.255.40 ----- You have to return the subnet mask of the ip and the url after “www.” Output 192.1...
  • Ans. 

    Java function to return subnet mask of IP and URL after www.

    • Read the file and store IP addresses and URLs in separate arrays

    • Use regex to extract subnet mask from IP address

    • Use substring to extract URL after www.

    • Return subnet mask and URL as separate strings

  • Answered by AI
  • Q14. 3 mislabeled jar puzzle.Since i had heard this puzzle many times,i answered it in 2-3 minutes.He said i can make out that you have heard this puzzle already ;)
  • Q15. What are inner join and outer join in sql
  • Ans. 

    Inner join returns only the matching rows between two tables, while outer join returns all rows from one table and matching rows from the other.

    • Inner join combines rows from two tables based on a matching column.

    • Outer join returns all rows from one table and matching rows from the other.

    • Left outer join returns all rows from the left table and matching rows from the right table.

    • Right outer join returns all rows from the...

  • Answered by AI
  • Q16. A linked list contains loop.Find the length of non looped linked list
  • Ans. 

    To find the length of non-looped linked list, we need to traverse the list and count the number of nodes.

    • Traverse the linked list using a pointer and count the number of nodes until the end of the list is reached.

    • If a loop is encountered, break out of the loop and continue counting until the end of the list.

    • Return the count as the length of the non-looped linked list.

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: 3.You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,5…10. What was the original sequence of card.After doing some exercise i answered 1,6,2,10,3,7,4,9,5,8.Then he asked me to write a function for this which takes a number and return the array.

Skills: Algorithm, Java, OOP, data structure
College Name: NA

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Online Test-21 (MCQ) +2 (Coding) in 1 hr. Test conducted on hackerrank21 MCQ had almost 10 aptitude and 11 C output based questions.



Give preference to coding questions. Try to solve both questions ( Pass all test cases for one of the questions and do attempt the other question ( even brute force would pass many test cases )



Aptitude can’t be solved just within a minute. Solve C o/p based questions first.Questions-



1. Overlapping paintings, find no. of paintings that can be seen distinctly, extreme co-ordinates of paintings are given. Ordering of paintings matter. ( Assume heights of all paintings are same, start and end coordinates are given )E.g.



5
1 4
2 6
3 4
8 10
7 10


XXXX
XXXXXX
XX
XXX <- This painting is hidden completely
XXXX Simple O(N^2) solution. Starting from rightmost painting, check if it completely hides any painting or not based on start and end coordinates. ( modification of interval selection problem )2- Given points of two lines segments A(x1,y1 x2,y2) & B(x3,y3 x4,y4) find whether the 2 segments intersect or not.



Simpler approach ( short code )-



-----?module=Static&d1=tutorials&d2=geometry2#line_line_intersectionLength / complicated soln-



----- cut-off -



I solved 2nd question and passed 1 test case for first question ( misunderstood the question during online round !! :p ) and solved 4 MCQ's only ( all fluke )



So my advice, do solve both coding questions for sure and solve C o/p questions in last 15 min
Duration: 60 minutes

Round: Technical Interview
Experience: Avg 20-30 mins. 22 shortlisted



My went on for 1 hr to 1hr 15 minsInternship based dicussion (20-30 mins ). Based on Cloud, Virtualization, Networking



Q1- Given N, find LCM from of all numbers from 2 to N. Give the complexity expressed in the form of Number of prime numbers <= N. Had to be really precise in terms of complexity ( in terms of prime factors, maximum recurrences, each recurrence complexity ). Long dicussion on complexity. Don't say any method whose complexity you cannot prove. (E.g saying that i can use Sieve of Eratosthenes for prime pre-processing will lead to question of complexity of Sieve which is O( Log LogN), that cannot be proved trivally. ) So avoid using any such termsQ3- Spring / Hibernate in JAVA



Told him i work in C/C++ only. No experience in JAVAQ2- Types of SQL- NoSQL and SQL(Relational DBMS ). Why the need of NoSQL- Big Data AnalyticsQ3- How would you design DBMS for Snapdeal's website's shoe section.



Now if you want to further break it into Sports and Casual Shoe would you break the DB into two or add another entity ? Full justificdation



I initially answered with a multi-level indexed structure for DBMS storage. Could not answer on the second part of the question. He asked if i knew DBMS and i told him I do not know DBMS. He skipped the question and ended the interview. Told him i had advanced DBMS lab in my course currenlty and would learn it before graduating.

Round: Puzzle Interview
Experience: Q1- -----/



Q2- -----/



Q3- ----- was the first one to solve all 3 in 45 mins roughly and went for next interview. Shortlisting criteria- 2 questions in 1 hr – 1hr 15 mins even though they said that we had 2 hrs to solve all 3 questions !!

Round: Technical Interview
Experience: 4 shortlisted. This round went for almost 1hr 45 min - 2 hrs for me since I solved the Round 2 question earliest. Other 3 had almost 45 mins interview.Q1- Variation of



-----/



Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n.



I started by exponential solution and reduced it to polynomial. We discussed various approaches and tried a variety of methods and after 1-1.5 hrs of discussion finally ended up with an O(1) solution with some pre-processing overhead. After achiveing O(1) time complexity, he asked to further optimize the space complexity.



Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.Q2- Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H ( not necessarily consecutive ) elements of array equal with minimum cost.E.g.



N=6, H=4



2 3 5 6 4 4changes to -> 4 4 5 6 4 4



Cost is ( 4-2 + 4-3 = 3 )N=6, H=3



2 3 5 6 4 4changes to -> 2 4 5 6 4 4



Cost is ( 4-3 = 1 )



Optimal complexity- O(N)

Round: HR Interview
Experience: 3 shortlistedTypical HR round.I would like to thank geeksforgeeks for a exhaustive set of interview questions and study material on data structures-algorithms.

College Name: NA

Interview Preparation Tips

Round: Test
Experience: It was a test of speed as well as accuracy. There were very basic questions of maths and aptitude. Anyone with some practice could clear the test.
Duration: 12 minutes
Total Questions: 50

Round: Test
Experience: The second round was a test of your coding ability, again basic C++ questions, which could be solved easily with some practice of competitive coding.
Tips: Do practice coding on online platforms(hacker-rank, co-cubes, etc) before, as the test was held on these platforms only.

Round: interview 1
Experience: Most of the puzzles asked were of standard type, that can be practiced by following any standard text book or any site.
Tips: Keep discussing puzzles among your group, that would benefit you and the group at the same time.

Round: interview 2
Experience: It was a test of my approach to any question rather than the exact solution. It was kind of a very interactive session rather than a formal one. They asked questions related to the courses that I had undergone and not anything from some other planet.
Tips: Feel free to ask the interviewer for some hints or if your approach is correct or not.

General Tips: Be confident and just try to tackle every problem in a very organised manner (as you would have practiced before in your group or during practice).
Skill Tips: You need to have a strong grip on DS and Algo as this is the most important aspect that they wanted any student to have.
Skills: Data structures, Parallel computing, algorithms
College Name: IIT GUWHATI

Interview Questionnaire 

7 Questions

  • Q1. Little discussion on Final Year Project and the summer training
  • Q2. Basics of DBMS, difference between RDBMS and DBMS, Keys and its types, indices, joins and its types with example, normalization and denormalization
  • Q3. A simple program to check whether a number is palindrome or not
  • Ans. 

    A program to check if a number is a palindrome or not.

    • Convert the number to a string

    • Reverse the string

    • Compare the original and reversed string

    • If they are the same, the number is a palindrome

  • Answered by AI
  • Q4. How would you design DBMS for Snapdeal’s website’s shoe section. Now if you want to further break it into Sports and Casual Shoe would you break the DB into two or add another entity?
  • Ans. 

    For Snapdeal's shoe section, I would design a DBMS with separate entities for Sports and Casual Shoes.

    • Create a main entity for shoes with attributes like brand, size, color, etc.

    • Create separate entities for Sports and Casual Shoes with attributes specific to each category.

    • Link the Sports and Casual Shoe entities to the main Shoe entity using a foreign key.

    • Use indexing and normalization techniques to optimize performanc...

  • Answered by AI
  • Q5. DNS – Domain name servers : what are they , how do they operate?
  • Ans. 

    DNS servers translate domain names into IP addresses to enable communication between devices on the internet.

    • DNS servers act as a phone book for the internet, translating domain names into IP addresses.

    • When a user types a domain name into their browser, the browser sends a request to a DNS server to resolve the domain name into an IP address.

    • DNS servers operate in a hierarchical system, with root servers at the top, fo...

  • Answered by AI
  • Q6. There are two sorted arrays. First one is of size m+n containing only ‘first’ m elements. Another one is of size n and contains n elements. Merge these two arrays into the first array of size m+n such that...
  • Ans. 

    Merge two sorted arrays into one sorted array of larger size

    • Create a new array of size m+n

    • Compare the last elements of both arrays and insert the larger one at the end of the new array

    • Repeat until all elements are merged

    • If any elements are left in the smaller array, insert them at the beginning of the new array

    • Time complexity: O(m+n)

    • Example: arr1=[1,3,5,7,0,0,0], arr2=[2,4,6], output=[1,2,3,4,5,6,7]

  • Answered by AI
  • Q7. Find square root of a number
  • Ans. 

    To find square root of a number, use Math.sqrt() function in JavaScript.

    • Use Math.sqrt() function in JavaScript to find square root of a number.

    • For example, Math.sqrt(16) will return 4.

    • If the number is negative, Math.sqrt() will return NaN.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 22 (MCQ) +2 (Coding) in 1 hr. Test conducted on hackerrank
Duration: 60 minutes

Round: Technical Interview
Experience: 2.Find square root of a number
I gave an iterative O(n) solution , He told me to optimize : I did it in O(logn) with binary search.
Further optimize to O(1) : I got stuck ,after a lot of discussion on different techiniques he gave me a hint that he would be using my function a lot of times then I immediately told him to use hash maps and save the previous results.

Skills: OOP, Data structure, DBMS, C++
College Name: NA
Motivation: If you have made till here that means you are selected.The HR guy in snapdeal is the coolest HR I have met .He asked me name of the campanies that have hired me till now&#44;I gave him their names.

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: The first one was an aptitude round. It had 22 MCQs and 3 Coding Questions.Total time given was an hour. A total of 33 students were shortlisted for the next round.

Round: Technical Interview
Experience: The second round was a technical one. 19 students were asked to leave i.e. they were rejected.

Round: coding round
Experience: Then there was the pen and paper round where the rest of the 14 students were given 3 questions each and an hours time to write a fully functional code for as many questions possible.

Round: Technical Interview
Experience: 10 students went through to the final technical round. All the 10 students had to undergo both the technical as well as the HR round. After the technical round was done, the student was immediately sent to the HR round wherein after the interview his/her result was announced to him/her by the HR A total of 5 students were hired and I was glad to be one among them.

General Tips: "It was challenging, rewarding as well as exhausting.
This was a super dream company and because I was already placed, I didn't have the pressure of not getting the job.
I guess it was my day and hence everything went on smoothly"
Skill Tips: Stay calm and focused. All you need to do is believe in yourself and keep telling yourself that the job is yours to take and you are going to bag it.
Be thorough with the algorithmic concepts. Do not panic during the interview; the interviewer will help you if you stuck at some problem.
"I was offered a position of a software developer.
You can always ask them questions about how they find it working at the particular company."

Skills:
College Name: NIT Surathkal

I was interviewed before Apr 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Reverse a Linked List Problem Statement

    You are given a Singly Linked List of integers. Your task is to reverse the Linked List by changing the links between nodes.

    Input:

    The first line of input contai...
  • Ans. 

    Reverse a given singly linked list by changing the links between nodes.

    • Iterate through the linked list and reverse the links between nodes.

    • Keep track of the previous, current, and next nodes while reversing the links.

    • Update the head of the linked list to point to the last node after reversal.

  • Answered by AI
  • Q3. 

    Linked List Cycle Detection

    Determine if a given singly linked list of integers forms a cycle.

    Explanation:

    A cycle in a linked list occurs when a node's next reference points back to a previous node in...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next reference points back to a previous node.

    • Use two pointers, one moving at double the speed of the other, to detect a cycle.

    • If the two pointers meet at any point, there is a cycle in the linked list.

    • If one of the pointers reaches the end of the list (null), there is no cycle.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 45 minutes
Round difficulty - Medium

Technical round with questions on DSA and DBMS.

  • Q1. What is an Inner Join?
  • Ans. 

    Inner Join is a SQL operation that combines rows from two tables based on a related column between them.

    • Inner Join returns only the rows that have matching values in both tables.

    • It is used to retrieve data that exists in both tables.

    • Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column;

  • Answered by AI
  • Q2. What is an outer join?
  • Ans. 

    An outer join combines rows from two tables even if there is no match between the columns being joined.

    • Returns all rows from both tables, filling in missing values with NULL

    • Useful for finding unmatched rows between two tables

    • Types of outer joins include LEFT OUTER JOIN, RIGHT OUTER JOIN, and FULL OUTER JOIN

  • Answered by AI
  • Q3. 

    Count Unique Rectangles in Grid

    Given a grid with 'M' rows and 'N' columns, calculate the total number of unique rectangles that can be formed within the grid using its rows and columns.

    Input:

    The firs...
  • Ans. 

    Calculate the total number of unique rectangles that can be formed within a grid using its rows and columns.

    • Iterate through all possible combinations of rows and columns to calculate the number of unique rectangles

    • Use the formula (M * (M + 1) / 2) * (N * (N + 1) / 2) to find the total number of rectangles

    • Return the total number of unique rectangles for each test case

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 40 minutes
Round difficulty - Easy

Technical round with questions on DSA and Puzzles.

  • Q1. You have three jars, each mislabeled. One jar contains only apples, another contains only oranges, and the third contains both apples and oranges. You can pick one fruit from one jar to determine its conte...
  • Q2. How can you measure 45 minutes using two identical wires?
  • Q3. 

    Find All Anagrams in a String

    Given a string STR and a non-empty string PTR, your task is to identify all starting indices of PTR’s anagrams in STR.

    Explanation:

    An anagram of a string is another string...

  • Ans. 

    Identify all starting indices of anagrams of a given string in another string.

    • Iterate through the main string using a sliding window approach.

    • Use a hashmap to keep track of characters in the anagram string.

    • Compare the hashmap of the anagram string with the current window of characters in the main string.

    • If the hashmaps match, add the starting index of the window to the result array.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASnapdeal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5.1k Interviews
Flipkart Interview Questions
4.0
 • 1.4k Interviews
Swiggy Interview Questions
3.8
 • 439 Interviews
Udaan Interview Questions
4.0
 • 335 Interviews
Meesho Interview Questions
3.7
 • 329 Interviews
Blinkit Interview Questions
3.7
 • 182 Interviews
BlackBuck Interview Questions
3.8
 • 174 Interviews
Spinny Interview Questions
3.7
 • 168 Interviews
FirstCry Interview Questions
3.7
 • 167 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
View all
Data Analyst
209 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Manager
207 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Assistant
193 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Officer
184 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Manager
178 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Myntra with

Flipkart

4.0
Compare

Amazon

4.1
Compare

Meesho

3.7
Compare

LimeRoad

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