10+ Snapdeal Software Engineer Interview Questions and Answers

The task is to find the smallest number greater than the given number with the same set of digits.

• Sort the digits of the number in descending order.

• Find the first digit from the right that is smaller than the digit to its right.

• Swap this digit with the smallest digit to its right that is greater than it.

• Sort all the digits to the right of the swapped digit in ascending order to get the smallest number greater than the original number.

Compute the vertical sum of nodes in a binary tree aligned along the same vertical line.

• Traverse the binary tree in a level order manner to calculate the vertical sum.

• Use a hashmap to store the vertical sum at each vertical level.

• Recursively traverse the tree and update the vertical sum in the hashmap.

• Output the vertical sums in the required format for each test case.

Implement a function to check if parentheses in a string are balanced.

• Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.

• If the stack is empty when a closing parenthesis is encountered or if there are unmatched parentheses at the end, return 'NO'.

• Ensure that all opening parentheses have a corresponding closing parenthesis in the correct order.

• Return 'YES' if all parentheses are balanced.

• Example: Input: {[()]}, Output: YES

Find the maximum sum for any level in a binary tree.

• Traverse the binary tree level by level and calculate the sum for each level.

• Keep track of the maximum sum encountered so far.

• Return the maximum sum found.

• Example: For the input tree, the maximum level sum is 13 (5+6+2).

Find the K most frequent elements in an integer array and return them sorted in ascending order.

• Use a hashmap to store the frequency of each element in the array.

• Use a min heap to keep track of the K most frequent elements.

• Return the elements from the min heap in ascending order.

Calculate top 10 frequently used words on Facebook in 1 hour dynamically.

• Use Facebook API to fetch data

• Implement a script to count word frequency

• Sort the words based on frequency and return top 10

Calculate the level sum of a binary tree.

• Traverse the tree level by level using BFS

• Add the values of nodes at each level

• Store the level sum in an array

• Return the array of level sums

There are 204 squares and 1296 rectangles on a standard 8x8 chess board.

• The number of squares can be calculated using the formula n(n+1)(2n+1)/6, where n is the number of rows/columns.

• The number of rectangles can be calculated using the formula n(n+1)m(m+1)/4, where n and m are the number of rows and columns respectively.

• For an 8x8 chess board, there are 64 squares of size 1x1, 49 squares of size 2x2, 36 squares of size 3x3, 25 squares of size 4x4, 16 squares of size 5x5, 9 s...read more

TCP/IP is a set of protocols that governs the way data is transmitted over the internet.

• TCP/IP stands for Transmission Control Protocol/Internet Protocol.

• It is a suite of communication protocols used to connect devices on the internet.

• TCP ensures that data is reliably transmitted between devices.

• IP is responsible for addressing and routing data packets across networks.

• Examples of TCP/IP protocols include HTTP, FTP, and SMTP.

Vertical sum of binary tree is the sum of all nodes in each vertical line of the tree.

• Traverse the tree in-order and keep track of the horizontal distance of each node from the root.

• Use a hash table to store the sum of nodes at each horizontal distance.

• Recursively traverse the left and right subtrees and update the hash table accordingly.

Defective ball puzzle involves finding the odd ball out of a group of identical balls using a balance scale.

• Divide the balls into groups and weigh them on the balance scale.

• If the scale tips, the odd ball is in the heavier group.

• If the scale doesn't tip, the odd ball is in the remaining group.

• Repeat the process until the odd ball is found.

• Example: 8 identical balls, one is heavier. Divide into groups of 3 and weigh. If the scale tips, weigh two of the three balls to find the ...read more