AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
BigBasket
Work with us 
CompareProud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
BigBasket IT Executive Interview Questions and Answers
BigBasket IT Executive Interview Experiences
2 interviews found
SOUMYADIP SAMANTA
Selected
I applied via Referral and was interviewed before Nov 2022. There were 3 interview rounds.
(1 Question)
- Q1. (1). What is DHCP and how it works ? (2). Subnetting calculation ... (3). OSI Layer vs. TCP/IP Layer ...
- Ans.
DHCP is a network protocol that dynamically assigns IP addresses to devices on a network. Subnetting is dividing a network into smaller subnetworks. OSI and TCP/IP are networking models.
DHCP stands for Dynamic Host Configuration Protocol
It automatically assigns IP addresses to devices on a network
DHCP uses a client-server model
Subnetting allows for efficient use of IP addresses by dividing a network into smaller subnet...
(1 Question)
- Q1. (1). Name & functions of all the Layers of OSI Model. (2). Difference between TCP vs. UDP and example.
- Ans.
The OSI Model consists of 7 layers, each with its own functions. TCP and UDP are transport layer protocols with key differences.
OSI Model layers: Physical, Data Link, Network, Transport, Session, Presentation, Application
Functions of each layer: Physical - physical transmission of data, Data Link - error detection and correction, Network - routing and addressing, Transport - reliable data delivery, Session - establishi...
(1 Question)
- Q1. (*) Salary negotiation only ...
Skills evaluated in this interview
Selected
I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.
(2 Questions)
- Q1. About your self
- Q2. About Last company experience
(2 Questions)
- Q1. Information technology
- Q2. About company, IP,DNS,domain
Top trending discussions
Interview questions from similar companies
I applied via Campus Placement and was interviewed before Jan 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Tell me about ur hobby in brief ?
- Ans.
I enjoy hiking, reading, and cooking, which help me relax and stay creative while fostering personal growth.
Hiking: I explore local trails every weekend, enjoying nature and staying fit.
Reading: I read a mix of fiction and non-fiction, currently diving into historical novels.
Cooking: I experiment with new recipes, recently trying my hand at Italian cuisine.
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Interview Questionnaire
4 Questions
- Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
- Ans.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
- Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
- Ans.
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
- Q3. Design question
- Q4. Find friends of friend who already are not friends with you
- Ans.
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
Interview Preparation Tips
Experience: It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Tips: Just walk the interviewer through the solution you're proposing.
Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.
Round: Other Interview
Experience: This was bar-raiser round.
Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras
Skills evaluated in this interview
I appeared for an interview before Apr 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
- Q1.
Kth Largest Element Problem Statement
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Example:
Input:
Array: [2,1,5,6,3,8], K ... - Ans.
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order
Return the Kth element from the sorted array
Handle multiple test cases
- Q2.
Orange Rotting Problem Statement
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
- Value 0: Represents an empty cell.
- Value 1: Represents a fresh orang...
- Ans.
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find the initial rotten oranges and add them to the queue.
Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.
Continue until the queue is empty, ke...
Round duration - 45 minutes
Round difficulty - Easy
This was a design round.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Rajesh Paramanandam
I appeared for an interview in Oct 2016.
Interview Preparation Tips
Experience: Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Tips: Just think well before u do..
Duration: 1 hour 30 minutes
Total Questions: 40
Round: Behavioural Interview
Experience: It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..
Tips: Beware filling ur resume.. they will ask every stuff that you have in resume
Round: Technical Interview
Experience: Discussion about my project that i vr done in my final year.they asked me what was my role in my project
College Name: Sri ganesh college of engineering and technology
Interview Preparation Tips
Experience: The first test
contained 25 objective questions encompassing the basics of Computer Science ranging from
data structures, networks and operating systems to theory of computation
Duration: 45 minutes
Total Questions: 25
Round: Test
Experience: The second test contained 3 coding questions.
Duration: 45 minutes
Total Questions: 3
Round: HR Interview
Experience: After the written test, next day I appeared for 3 interviews.
They were checking if you can write code and also if you are aware of the practical issues faced while coding. In the final round they were testing if you could abstract out a real world
problem into code.
Tips: Overall I can say that you must hope for the best and prepare for the
worst. So make sure that you are prepared on all counts. You never know what might go wrong.
Interview Questionnaire
2 Questions
- Q1. Data struct,algo,
- Q2. High level data structs and algos
Interview Preparation Tips
Experience: coding and submission before face to face interview shortlisting
Tips: practice coding ,coding is key to success for SE
Round: Resume Shortlist
Experience: based on marks ,I was called for F2F
Tips: the ppt was to be submitted explaining the approach
Round: Technical Interview
Experience: a lot of brain storming
Tips: understands the nitty gritty of the structs and algos
Round: Technical Interview
Experience: exact code was to be written instead of pseudo code
Tips: get hold of DS,Algos
niranjan
I applied via Campus Placement
Interview Questionnaire
4 Questions
- Q1. Boundary traversal of a tree
- Ans.
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
- Q2. Find the nearest greater value of a given value in a BST
- Ans.
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl...
- Q3. There is an infinite stair case and there are n rounds. in i'th round we can jump i steps at one or discard them. it is given that k'th step is broken , find the max height we can reach with out stepping o...
- Ans.
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit...
- Q4. Height h was given and form a binary tree of height h and start combining bottom nodes to form a cone like structure
- Ans.
Construct a binary tree of height h and merge bottom nodes to create a cone-like structure.
A binary tree of height h has 2^h - 1 nodes.
Start combining leaf nodes from the bottom level upwards.
Each combination can be visualized as merging two nodes into one.
For example, if h=3, the tree has 7 nodes, and you combine nodes at levels 2 and 1.
The final structure resembles a cone as nodes are merged.
Interview Preparation Tips
Experience: there were 20 MCQ which were on ds , networks and basic coding followed by 2 coding questions.
1) print all the distinct substrings of a given string in lexicographical order
2) find the max i-j value in the given array of 0's and 1's such that there are equal number of zeros and ones, where i is the starting index and j is the ending index of the array.
Tips: make sure that you pass atleast half the test cases for both the question.
Duration: 90 minutes
Total Questions: 22
Round: Technical Interview
Experience: 1) i printed left view then leaves and right view using three level order traversals . he asked me to use one traversal only, then i told him the approach and wrote the working code.
2) told him the approach and coded it.
Tips: look at corner cases properly. the interviewers were friendly, so i felt relaxed.
Round: Technical Interview
Experience: 1) i told him a recursive O(2^n) solution, optimised it to O(n^2). he told me to optimise further. Then i finally came up with O(n) solution after 5 min and he was satisfied . i coded it. he was satisfied finally :D .
2) came up with the approach immediately and coded it. he was satisfied.
Tips: he was very particular about corner cases and he checked the code througly tested it on some cases to ensure it was working.
General Tips: be cool. interviewers were friendly. tell them what you are thinking and be clear with the question before answering to avoid wasteage of time.
Skill Tips: solve problems from codechef, spoj and codeforces. solve interview questions from geeksforgeeks and careercup.
Skills: the way you think, coding skills and knowledge on data structures.
Duration: 3
College Name: IIT Roorkee
Motivation: some good seniors got intern, so i was inspired.
Funny Moments: on the interview day a person came into the conference room to call me for interview, i didnt thought he was interviewer. he was very simple, but intelligent and at last i felt like asking him to ask me one more coding question as it was fun solving questions infront of him, but i didnt do that as i was frightened if i would not be able to answer it would be a negative remark :P .
Skills evaluated in this interview
I appeared for an interview before May 2016.
Interview Questionnaire
4 Questions
- Q1. Tell us about yourself
- Ans.
I am a passionate software engineer with experience in developing web applications and a strong background in computer science.
Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React
Strong background in computer science with knowledge of data structures and algorithms
Proficient in programming languages such as Java, Python, and C++
Familiar with Agile development methodolog...
- Q2. Why Flipkart
- Ans.
Flipkart is a leading e-commerce platform in India with a strong focus on technology and innovation.
Flipkart offers a challenging and dynamic work environment for software engineers.
The company has a strong reputation for investing in technology and innovation.
Flipkart has a large user base and offers opportunities to work on a variety of projects.
The company has a strong focus on customer satisfaction and user experie...
- Q3. Are you comfortable to reallocate
- Ans.
Yes, I am comfortable with reallocating as needed.
I am flexible and adaptable to changing circumstances.
I have experience working in dynamic environments where priorities can shift.
I am willing to take on new challenges and responsibilities as required.
- Q4. Why should we hire you
- Ans.
I have a strong technical background, excellent problem-solving skills, and a proven track record of delivering high-quality software.
Extensive experience in software development, including proficiency in multiple programming languages such as Java, Python, and C++
Strong problem-solving skills demonstrated through successful completion of complex projects
Proven track record of delivering high-quality software on time a...
Interview Preparation Tips
Experience: 2 problem statements to be coded using any language
Tips: Focussed on string manipulations and enormous data size handling
Duration: 1 hour 30 minutes
Total Questions: 2
Skills: C/C++
College Name: Guru Premsukh Memorial College of Engineering
BigBasket Interview FAQs
Tell us how to improve this page.
BigBasket Interviews By Designations
- BigBasket Business Development Executive Interview Questions
- BigBasket Shift Incharge Interview Questions
- BigBasket HR Executive Interview Questions
- BigBasket Operations Controller Interview Questions
- BigBasket Team Lead Interview Questions
- BigBasket Store Alliance Executive Interview Questions
- BigBasket Inventory Executive Interview Questions
- BigBasket Inventory Controller Interview Questions
- Show more
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
BigBasket IT Executive Reviews and Ratings
based on 8 reviews
Rating in categories
|
Business Development Executive
617
salaries
|  ₹2 L/yr - ₹6 L/yr |
|
Shift Incharge
468
salaries
| ₹2 L/yr - ₹5.5 L/yr |
|
Inventory Executive
415
salaries
| ₹2.2 L/yr - ₹5.5 L/yr |
|
Store Manager
341
salaries
| ₹2.5 L/yr - ₹9 L/yr |
|
Customer Support Executive
330
salaries
| ₹1.5 L/yr - ₹4 L/yr |
Milkbasket
Amazon
Blinkit
Flipkart
- Home >
- Interviews >
- BigBasket Interview Questions
