Snapdeal Interview Questions, Process, and Tips

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...read more
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
Add your answer
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...read more
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
Add your answer
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...read more
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
Add your answer

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
Add your answer
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
Add your answer
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...read more
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
Add your answer

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...read more
Add your answer
Q2. How can you measure 45 minutes using two identical wires?
Add your answer
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...read more
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
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with 2 DSA based questions.

Q1. 
Find Pair with Given Sum in BST
You are provided with a Binary Search Tree (BST) and a target value 'K'. Your task is to determine if there exist two unique elements in the BST such that their sum equals ...read more
Ans. 
Given a Binary Search Tree and a target value, determine if there exist two unique elements in the BST such that their sum equals the target.
• Traverse the BST in-order to get a sorted array of elements.

• Use two pointers approach to find the pair with the given sum.

• Consider edge cases like null nodes and duplicate elements.
Answered by AI
Add your answer
Q2. 
Zig Zag Tree Traversal Problem Statement
Given a binary tree, compute the zigzag level order traversal of the nodes' values. In a zigzag traversal, start at the root node and traverse from left to right a...read more
Ans. 
Zig Zag Tree Traversal involves alternating directions while traversing a binary tree level by level.
• Implement a level order traversal of the binary tree.

• Alternate the direction of traversal for each level.

• Use a queue data structure to keep track of nodes at each level.

• Handle null nodes appropriately to maintain the zigzag pattern.

• Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1 3 2 4 5
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on OS and DSA.

Q1. 
Subtree Check in Binary Trees
You are given two binary trees, T and S. Your task is to determine whether tree S is a subtree of tree T, meaning S must match the structure and node values of some subtree i...read more
Ans. 
The task is to determine whether tree S is a subtree of tree T, matching structure and node values.
• Parse the input level order traversal of both trees T and S

• Check if tree S is a subtree of tree T by comparing their structures and node values

• Output 'true' if S is a subtree of T, otherwise 'false'
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Round duration - 60 minutes
Round difficulty - Medium

It’ll range from the very very basics of programming to the toughest of DPs. In between questions were being popped up on your projects. If you’ve some worth-discussing development projects in your resume(like I’ve my BTP and an Android game), substantial amount of time goes in discussing that.

Q1. 
Nth Fibonacci Problem Statement
Calculate the Nth term of the Fibonacci series, denoted as F(n), using the formula: F(n) = F(n-1) + F(n-2) where F(1) = 1 and F(2) = 1.
Input:
The first line of each test...read more
Ans. 
Calculate the Nth term of the Fibonacci series using a recursive formula.
• Use the formula F(n) = F(n-1) + F(n-2) to calculate the Nth Fibonacci number.

• Start with base cases F(1) = 1 and F(2) = 1.

• Continue recursively calculating Fibonacci numbers until reaching the desired N.

• Ensure to handle edge cases and constraints such as 1 ≤ N ≤ 10000.
Answered by AI
Add your answer
Q2. 
Inorder Traversal of Binary Tree Without Recursion
Given a Binary Tree consisting of 'N' nodes with integer values, your task is to perform an In-Order traversal of the tree without using recursion.
Inpu...read more
Ans. 
Perform in-order traversal of a binary tree without recursion.
• Use a stack to simulate the recursive process of in-order traversal

• Start with the root node and keep traversing left until reaching a null node, then pop from stack and move to right node

• Keep track of visited nodes to avoid revisiting them

• Return the in-order traversal list
Answered by AI
Add your answer
Q3. 
Largest Rectangular Area In A Histogram
Given an array HEIGHTS of length N, where each element represents the height of a histogram bar and the width of each bar is 1, determine the area of the largest rec...read more
Ans. 
Find the largest rectangular area in a histogram given the heights of the bars.
• Use a stack to keep track of the indices of the bars in non-decreasing order of heights.

• Calculate the area of the rectangle with each bar as the smallest bar and update the maximum area.

• Handle the case when the stack is not empty after processing all bars to calculate the remaining areas.

• Example: For HEIGHTS = [2, 1, 5, 6, 2, 3], the largest
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

Director (search) had come along with the recruitment team this time. So, he was only taking the rounds for all the candidates in this round. Summary, two questions were asked.
After these two, he asked me if I’d any questions for him. I asked about the work culture and what kind of people he was looking for. It’ll give you an idea whether you’re selected or not. Be eager to hear the answer he gives and feel attracted to the prospects he puts forward about the company! AGAIN IMPORTANT, DON’T GIVE UP ANY QUESTION. UNTIL HE DECIDES TO MOVE ON TO THE NEXT. If you’re not able to come up with a solution. Don’t panic. Show your fighting spirit.

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted N * N matrix, find the position of a target integer 'X'.
• Start from the top-right corner of the matrix and compare the target with the current element.

• Based on the comparison, move left or down in the matrix to narrow down the search.

• Repeat the process until the target is found or the search goes out of bounds.

• Return the position of the target if found, else return {-1, -1}.
Answered by AI
Add your answer
Q2. 
Closest Pair of Points Problem Statement
Given an array containing 'N' points in a plane, your task is to find the distance between the closest pair of points.
Explanation:
The distance between two poin...read more
Ans. 
Find the distance between the closest pair of points in a plane given an array of points.
• Calculate the distance between each pair of points using the formula provided.

• Keep track of the minimum distance found so far.

• Optimize the solution to avoid unnecessary calculations by considering only relevant pairs.

• Consider using a data structure like a priority queue or sorting to improve efficiency.

• Handle edge cases like when t
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Most Important here is do not fake your personality here. They’re HR guys, they’re trained to catch the fake ones. So, be genuine.