BigBasket Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

Q1. Tree Traversals
You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to find the ln-Order, Pre-Order, and Post-Order traversals of the given binary tree...read more
Ans. 
Iterative Inorder Traversal (Using Stack ) :
1) Create an empty stack S.
2) Initialize current node as root.
3) Push the current node to S and set root=root->left until root is NULL
4) If root is NULL and stack is not empty then 
a) Pop the top item from stack.
b) Print the popped item, set root = root->right 
c) Go to step 3.
5) If root is NULL and stack is empty then we are done.

Time Complexity : O(n)
Space Co...read more
Answered Anonymously
Add your answer
Q2. Reverse Linked List
You are given a Singly Linked List of integers. You need to reverse the Linked List by changing the links between nodes.
Input Format :
The first line of input contains a single integ...read more
Ans. 
Iterative(Without using stack):
1) Initialize three pointers prev as NULL, curr as head and next as NULL.

2) Iterate through the linked list. In loop, do following. 
// Before changing next of current, 
// store next node 
next = curr->next
// Now change next of current 
// This is where actual reversing happens 
curr->next = prev 
// Move prev and curr one step forward 
prev = curr 
...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

Q1. Intersection Of Two Arrays
You are given two arrays 'A' and 'B' of size 'N' and 'M' respectively. Both these arrays are sorted in non-decreasing order. You have to find the ...read more
Ans. 
Union : 
1) Initialize an empty hash set or hash map mp;
2) Iterate through the first array and put every element of the first array in the set mp.
3) Repeat the process for the second array.
4) Print the set mp.

Intersection:
1) Initialize an empty set mp.
2) Iterate through the first array and put every element of the first array in the set mp.
3) For every element x of the second array, do the following :
Search x in th...read more
Answered Anonymously
Add your answer