BigBasket Senior Software Engineer Interview Questions and Answers for Experienced

Easy to medium-level coding questions on DSA

Q1. DSA question along with basic java needs
Add your answer
Q2. Create custom linked list
Ans. 
A custom linked list is a data structure where each node contains a value and a reference to the next node.
• Define a Node class with value and next properties

• Define a LinkedList class with head property and methods to add, remove, and traverse nodes

• Example: let list = new LinkedList(); list.add(1); list.add(2); list.remove(1);
Answered by AI
Add your answer

Q1. Of an elevator and some questions on how to implement it with some scenarios
Add your answer

Q1. Minimum Knight Moves (LC Medium)
Add your answer
Q2. OS, CN, DB concepts like multithreading, semaphore, tcp vs udp, transaction and ACId properties. Java concepts like stack vs heap(memory), error vs exception. Any 1 Project discussion for 10 mins
Add your answer

Q1. Prefer not to due to NDA
Add your answer

Brush up on DS and Algorithms

Solve sudoku, row and columns should have 1-9 numbers and the numbers shouldnt repeat

Q1. What is the toughest problem you solved and once I answered they started digging in to it
Add your answer

Q1. System Design - Design a parking lot
Ans. 
Design a parking lot system with features like parking, retrieving, and tracking available spots.
• Create a ParkingLot class with attributes like total number of spots, available spots, and a list of parked vehicles.

• Implement methods for parking a vehicle, retrieving a vehicle, and tracking available spots.

• Use data structures like arrays or lists to manage parked vehicles and available spots.

• Consider implementing feature...read more
Answered by AI
Add your answer

Q1. Several questions related to behavioral and troubleshooting
Add your answer

Q1. Given array of integer create subarray with sum = 0
Ans. 
Create subarrays with sum = 0 from given array of integers.
• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.

• If yes, then the subarray between those two indices has a sum of 0.
Answered by AI
Add your answer
Q2. Left view of binary tree
Ans. 
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner and keep track of the first node at each level.

• Use a queue to store nodes at each level and update the left view nodes accordingly.

• Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
Answered by AI
Add your answer

Algorithm and database and datastructures

Language and basic understanding

Q1. Too much Negotiations
Add your answer
Q2. Why this much of salary we give you
Add your answer