Big Basket interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
3 rounds | 3 Coding problems
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, Operating Systems, Aptitude, OOPS
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date12 Oct 2016
Coding problem0

This was mainly an aptitude round where the questions ranged from easy to medium . More than 20 correct questions was sufficient to pass this round .

02
Round
Medium
Face to Face
Duration60 Minutes
Interview date13 Oct 2016
Coding problem2

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.

1. Tree Traversals
Easy
15m average time
85% success
0/40

#### You have been given a Binary Tree of 'N'

nodes, where the nodes have integer values.

#### Your task is to return the ln-Order, Pre-Order, and Post-Order traversals of the given binary tree....

View more
Problem approach

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...

View more
Easy
15m average time
85% success
0/40

#### Example:

View more
Problem approach

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 ...

View more
03
Round
Medium
Face to Face
Duration45 Minutes
Interview date14 Oct 2016
Coding problem1

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

1. Intersection Of Two Arrays
Easy
10m average time
90% success
0/40

#### 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 intersection of these two arrays.

View more
Problem approach

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 el...

View more
Start a Discussion
Similar interview experiences
Product Intern
6 rounds | 9 problems
0 views
SDE - 1
3 rounds | 5 problems
0 views
4 rounds | 5 problems
1559 views
Product Engineer
3 rounds | 5 problems
755 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
97236 views