BigBasket SDE-2 Interview Questions and Answers

That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.

Round duration - 60 minutes
Round difficulty - Medium

It was a telephonic interview at 10 in the morning. Interviewer seemed cool.

Q1. 
Best Insert Position for a Target in a Sorted Array
You are provided with a sorted array A of length N consisting of distinct integers and a target integer M. Your task is to determine the position where ...read more
Ans. Brute Force
• Iterate through the given array.
  • If at any position i, we get A[i] ≥ M, return i.
• If there is no such position i, return N.
Space Complexity: O(1)Explanation:
O(1).
 
As there is no extra space required.
Time Complexity: O(n)Explanation:
O(N), where ‘N’ is the length of the given array.
 
We are traversing the array only once. Hence, the overall complexity is O(N).
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was in the morning at 10 AM in the office meeting room.

Q1. 
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...read more
Ans. 
Didn't get enough time to code the solution but explained the approach
We can do this using DP
We can maintain 2 arrays - one represents the ans if we start from first house and the other represents the answer if we start. from the second house.Then simply looping over the array and calculating these array's elements.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 11 AM in the meeting office.

Q1. 
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5  
Stre...read more
Ans. 
Started with the brute force solution of insertion sort
Interviewer asked to optimize.
Gave the solution which uses two heaps - max heap and min heap. the difference in size of both heaps cannot be more than 1. And we might need to remove elements from one heap to other heap as more input numbers are added
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 1 AM.

Round duration - 60 minutes
Round difficulty - Easy

The meeting was at 2 PM in the office meeting room.

Round duration - 60 minutes
Round difficulty - Easy

10 AM

Q1. Can you provide a deeper discussion about all the projects you completed in your previous company?
Ans. 
Tip 1: Know well about the projects that you have done in the past

 
Answered Anonymously
Add your answer

Amazon Online assessment which consisted of 2 coding DSA medium question

Q1. Question related to TreeMap
Add your answer
Q2. Question related BFS
Add your answer
Q3. System Design - Design Feed system
Add your answer

2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question

A simple feed platform, which supports some basic functionality. The main point of this round was to see how well a candidate architect the application.

Q1. Basic discussion around the project & past experience.
Add your answer
Q2. Design a 2/3rd Winning game.
Ans. 
Design a 2/3rd Winning game.
• The game should have a clear win condition

• The win condition should be achievable in 2/3rd of the total game time

• The game should have a balanced difficulty level

• The game should have a clear feedback system for the player

• Examples: Chess, Tic Tac Toe, Connect Four
Answered by AI
Add your answer
Q3. Discussion around how would you scale a application.
Add your answer
Q4. NoSQL vs SQL difference
Ans. 
NoSQL is non-relational and schema-less while SQL is relational and has a fixed schema.
• NoSQL databases are horizontally scalable and can handle large amounts of unstructured data.

• SQL databases are vertically scalable and are better suited for structured data with complex relationships.

• NoSQL databases are often used in web applications, while SQL databases are commonly used in enterprise applications.

• Examples of NoSQL d...read more
Answered by AI
Add your answer

Q1. Hiring Manager round
Add your answer
Q2. Basic discussions around past work, past processes, what are your future aspirations etc.
Add your answer
Q3. This round was mainly for seeing the culture fitment of a candidate.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing: evening
Environment: Online round took at home

Q1. 
Smallest Subarray with K Distinct Elements Problem
Given an array A consisting of N integers, find the smallest subarray of A that contains exactly K distinct integers.
Input:
The first line contains tw...read more
Ans. 
At first sight this can be solved easily by using two loops to iterate over contiguous subarrays in O(n^2) and counting number of arrays and breaking the outer loop if number of odds exceed 'k'.

Optimised solution is to take two pointer approach where right pointer is incremented till num of odds not exceed 'k'. If limit is reached, increment left pointer and add number of arrays (right - left+1)*(right-left)/2 to the r
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Machine coding round

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Rat In a Maze Problem Statement
Given a N * N maze with a rat placed at position MAZE[0][0], find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]. The rat is allowed to...read more
Ans. Backtracking Approach
Initialize, all the cells of the solution matrix used to print the path matrix to 0. First, you cannot make use of the existing maze to print the solution maze as you have to distinguish b/w 1 of maze or 1 of ‘SOLUTION matrix.
 
Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and t...read more
Answered Anonymously
Add your answer

Round duration - 60-90 minutes
Round difficulty - Medium

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager round

Diameter of a binary tree and bfs and dfs questions

Data structure and algorithms

Q1. System design questions
Add your answer

This was a machine coding round in which we have to implement an online cab booking service.

Standard problem solving round consists of two questions on tree and dp.

Q1. Behavioural questions related to leadership principle.
Add your answer