Snapdeal Interview Questions, Process, and Tips

The Lowest Common Ancestor (LCA) of a binary tree can be found in place using a recursive approach.

• Start from the root node and recursively check if both nodes are present in the left and right subtrees.

• If one node is found in the left subtree and the other in the right subtree, then the current node is the LCA.

• If both nodes are found in the left subtree, recursively search for the LCA in the left subtree.

• If both nodes...read more

Knapsack and coin change problems are classic dynamic programming problems.

• Knapsack problem involves maximizing the value of items in a knapsack without exceeding its capacity.

• Coin change problem involves finding the minimum number of coins needed to make a certain amount of change.

• Both problems can be solved using dynamic programming techniques.

• Examples: 0/1 Knapsack, Fractional Knapsack, Coin Change with limited coin

Find the maximum product of three numbers in an array.

• Sort the array in ascending order.

• Multiply the last three numbers in the sorted array to get the maximum product.

• If there are negative numbers in the array, consider multiplying the two smallest negative numbers with the largest positive number.

I am a highly motivated and experienced professional with a strong background in project management and team leadership.

• Over 10 years of experience in managing complex projects and leading cross-functional teams

• Proven track record of delivering projects on time and within budget

• Strong communication and interpersonal skills, able to effectively collaborate with stakeholders at all levels

• Expertise in implementing project...read more

I would address the situation by communicating with my manager and finding a solution together.

• Initiate a conversation with the manager to understand their expectations and concerns

• Express your own concerns and feelings respectfully

• Propose alternative approaches or suggestions

• Seek a compromise or find common ground

• Maintain open and honest communication throughout the process

Balancing academics, extracurricular activities, and part-time job

• Juggling multiple responsibilities

• Time management challenges

• Prioritizing tasks effectively

Circular linked list meeting point and proof

• To find the meeting point in a circular linked list, use Floyd's Tortoise and Hare algorithm

• Start with two pointers, one moving at twice the speed of the other

• When they meet, reset one pointer to the head and move both at the same speed until they meet again

• The meeting point is the start of the loop in the linked list

Reverse a linked list in chunks of k nodes

• Break the linked list into chunks of size k

• Reverse each chunk individually

• Connect the reversed chunks back together

Printing the left view of a tree involves printing the leftmost nodes at each level of the tree.

• Traverse the tree level by level using BFS or DFS

• At each level, print the first node encountered

• Continue this process until all levels are covered

Check if the decimal of a dynamically generated number is divisible by 3 based on the left side of the previous number.

• Generate new number by adding 0 or 1 to the left side of previous number

• Check if the decimal of the new number is divisible by 3

• Print 'YES' if divisible by 3, 'NO' otherwise

Binary search in rotated sorted array involves finding a target element efficiently.

• Identify the pivot point where the array is rotated

• Determine which half of the array the target element lies in

• Apply binary search in the appropriate half

Binary search in a biotonic sorted array involves finding a target value in an array that first increases and then decreases.

• Start by finding the peak element in the array to determine the increasing and decreasing halves.

• Perform binary search on both halves separately to find the target value.

• Example: Array 12345XXXXX2, target value 2. Peak element is 5, search left half (12345) and then right half (5432) for the targ

Find the distinct pair in two arrays where all elements are same except one.

• Iterate through both arrays and compare elements at each index.

• If elements are not equal, those are the distinct pair.

• Handle edge cases like empty arrays or arrays with different lengths.

The coin change problem in dynamic programming involves finding the minimum number of coins needed to make a certain amount of change.

• Start by defining the problem - given a set of coin denominations and a target amount, find the minimum number of coins needed to make the target amount.

• Use dynamic programming to build up solutions for smaller subproblems and eventually solve the main problem.

• Consider the base case wher...read more

Group by is used to group rows that have the same values into summary rows. Having is used to filter groups based on a specified condition.

• Group by is used with aggregate functions like COUNT, SUM, AVG, etc.

• Having is used to filter groups based on conditions after the grouping has been done.

• Example: SELECT department, COUNT(*) FROM employees GROUP BY department HAVING COUNT(*) > 5;