Snapdeal Interview Questions, Process, and Tips for Freshers

Find the row with maximum number of 1's in a matrix of 0's and 1's.

• Start from the top right corner of the matrix

• If the current element is 1, move left in the same row

• If the current element is 0, move down to the next row

• Repeat until you reach the bottom left corner of the matrix

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

• Convert the number to a string

• Reverse the string

• Compare the reversed string with the original string

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

Tree traversals are methods used to visit each node in a tree data structure.

• Inorder traversal: Visit left subtree, then root, then right subtree. Example: 1. Left -> Root -> Right

• Preorder traversal: Visit root, then left subtree, then right subtree. Example: 1. Root -> Left -> Right

• Postorder traversal: Visit left subtree, then right subtree, then root. Example: 1. Left -> Right -> Root

Codes for Post-Order, In-Order, and Level-Order Traversal of a binary tree.

• Post-Order Traversal: Left subtree, Right subtree, Root

• In-Order Traversal: Left subtree, Root, Right subtree

• Level-Order Traversal: Visit nodes level by level, from left to right

Intersection of 2 linked lists

• Traverse both lists and compare each node to find the intersection

• Use a hash set to store visited nodes and check for intersection

• Calculate the length of both lists and adjust the starting point for comparison

To check if a linked list has a loop, we can use the Floyd's cycle-finding algorithm.

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

• If there is a loop, the fast pointer will eventually catch up with the slow pointer

• If the fast pointer reaches the end of the list, there is no loop

Left view of a tree shows the nodes visible when viewed from the left side.

• Left view of a tree is the nodes that are visible when looking at the tree from the left side.

• It includes the leftmost node at each level of the tree.

• Example: For a tree with root node A and left child B, the left view would be [A, B].

To find the Kth element from the end of a linked list, we can use the two-pointer approach.

• Initialize two pointers, 'fast' and 'slow', pointing to the head of the linked list.

• Move the 'fast' pointer K steps ahead.

• Move both 'fast' and 'slow' pointers one step at a time until 'fast' reaches the end of the linked list.

• The 'slow' pointer will be pointing to the Kth element from the end.

The answer describes how to check if a linked list is a palindrome or not.

• Traverse the linked list and store the values in an array

• Compare the elements of the array from both ends to check for palindrome

• Alternatively, use two pointers to traverse the linked list, one slow and one fast, and reverse the first half of the list while traversing

The boundary of a tree refers to the outermost edges of the tree canopy or the perimeter of the tree's root system.

• The boundary of a tree is defined by the outermost branches and leaves of the tree canopy.

• The root system of a tree also contributes to its boundary, with roots extending outward from the trunk.

• The boundary of a tree can be influenced by factors such as soil type, available nutrients, and competition from ...read more

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