Snapdeal Software Engineer Interview Questions, Process, and Tips

Q1. Level order tree traversal
Add your answer
Q2. Find the pair element from the array
Ans. 
Find the pair element from the array
• Iterate through the array and use a hashmap to store elements and their counts

• Check if the current element's complement exists in the hashmap

• Return the pair if found, otherwise return null
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

There were 22 MCQ questions of aptitude and technical based while 3 questions were of coding type.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.

Q1. Check for balanced parentheses in an expression.
You're given string ‘STR’ consisting solely of “{“, “}”, “(“, “)”, “[“ and “]” . Determine whether the parentheses are balanced.
Input Format:
The f...read more
Ans. 
A stack can be used to solve this question. 
We traverse the given string s and if we:
1. see open bracket we put it to stack
2. see closed bracket, then it must be equal to bracket in the top of our stack, so we check it and if it is true, we remove this pair of brackets.
3. In the end, if and only if we have empty stack, we have valid string.

Complexity: Time complexity is O(n): we put and pop each element of string ...read more
Answered by CodingNinjas
View 1 more answer
Q2. Find next greater number with same set of digits
You are given a string S which represents a number. You have to find the smallest number strictly greater than the given number which contains the same set ...read more
Ans. 
Observations:
1. If all digits are sorted in descending order, then output is always “Not Possible”. 
2. If all digits are sorted in ascending order, then we need to swap last two digits. 
3. For other cases, we need to process the number from rightmost side to find the smallest of all greater numbers. 

Steps:
1. Traverse the given number from rightmost digit, keep traversing till you find a digit which is sm...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 60 minutes
Round difficulty - Medium

My experience was very awesome , I answered all the questions , although in starting I was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.

Q1. Find maximum level sum in Binary Tree
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, your task is to find the maximum sum for a level in t...read more
Ans. 
The idea is to do a level order traversal of the tree. While doing traversal, process nodes of different levels separately. For every level being processed, compute the sum of nodes in the level and keep track of the maximum sum.
Answered by CodingNinjas
View 2 more answers
Q2. Find top k (or most frequent) numbers in a stream
You are given an Integer array ‘ARR’ and an Integer ‘K’. Your task is to find the ‘K’ most frequent elements in ‘ARR’. Return the elements sorted in ascend...read more
Ans. 
The idea is to store the top k elements with maximum frequency. To store them a vector or an array can be used. To keep the track of frequencies of elements creates a HashMap to store element-frequency pairs. Given a stream of numbers, when a new element appears in the stream update the frequency of that element in HashMap and put that element at the end of the list of K numbers (total k+1 elements) now compare adjacen...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 60 minutes
Round difficulty - Easy

This round was based on DSA and questions on core subjects that I had studied throughout college.

Q1. Vertical Sum in a given Binary Tree
Given a binary tree having a positive integer written on each of its nodes. Your task is to find the vertical sum of node values i.e. the sum of nodes that can be connec...read more
Ans. 
We need to check the Horizontal Distances from the root for all nodes. If two nodes have the same Horizontal Distance (HD), then they are on the same vertical line. The idea of HD is simple. HD for root is 0, a right edge (edge connecting to right subtree) is considered as +1 horizontal distance and a left edge is considered as -1 horizontal distance.
We can do an in-order traversal of the given Binary Tree. While trave...read more
Answered by CodingNinjas
View 2 more answers
Q2. Computer Network Question
What is TCP/IP?
Ans. 
TCP/IP stands for Transmission Control Protocol/Internet Protocol and is a suite of communication protocols used to interconnect network devices on the internet. TCP/IP is also used as a communications protocol in a private computer network (an intranet or extranet). The entire IP suite -- a set of rules and procedures -- is commonly referred to as TCP/IP. TCP and IP are the two main protocols, though others are includ...read more
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Experience : Keep confidence and show them good communication skills. Previous round's performance also matters in this rounds

Q1. Basic HR Questions
1. Tell About Yourself
2. Family Background
3. Why Snapdeal?
Ans. 
Tip 1 : The cross questioning can go intense some time, think before you speak.

Tip 2 : Be open minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.

Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these round, like what are the projects currently the company is investing, which team you are mentoring. How all is the
Answered by CodingNinjas
Add your answer