i
BigBasket
Filter interviews by
My mostly question were around node js frame works and other tools
I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.
Medium level DSA question in JS
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
There was an online coding test on signal consisting of leetcode easy medium and hard
posted on 3 May 2024
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
I applied via LinkedIn and was interviewed before Aug 2023. There were 3 interview rounds.
30mins aptitude test
90 mins coding test for 3 questions
I am choosing this role because of my passion for creating user-friendly and visually appealing websites.
Passion for front end development
Enjoy creating user-friendly interfaces
Excited about the creative aspect of web design
I am a dedicated and skilled front end developer with a passion for creating user-friendly interfaces.
I have a strong understanding of HTML, CSS, and JavaScript
I have experience with responsive design and cross-browser compatibility
I am proficient in using front end frameworks like React and Angular
Coding a frontend UI from provided image. And creating a fucntional star rating system
Designing a Component API in React using Typescript involves defining props, state, and methods for the component.
Define the props interface to specify the expected input data for the component
Use typescript types to ensure type safety and prevent runtime errors
Define the state interface to manage the internal state of the component
Implement methods to handle user interactions and component logic
Document the component
Function to clear all timer ids at once
Create an array to store all timer ids
Iterate through the array and clear each timer id using clearTimeout() function
Given a matrix of zeros and ones, find the minimum distance for each one to a zero.
Use breadth-first search (BFS) to find the minimum distance from each one to a zero.
Start by initializing a queue with all the zeros in the matrix.
While the queue is not empty, dequeue a zero and enqueue its neighboring ones.
Keep track of the distance from each one to the nearest zero.
Repeat until all ones have been visited.
Return the ma
I appeared for an interview before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered.
Given an array ARR
consisting of N
integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Find the maximum sum of a contiguous subarray in an array of integers.
Use Kadane's algorithm to find the maximum subarray sum in linear time.
Initialize two variables: maxSum and currentSum.
Iterate through the array and update currentSum by adding the current element or starting a new subarray.
Update maxSum if currentSum becomes greater than maxSum.
Return maxSum as the maximum subarray sum.
Round duration - 50 Minutes
Round difficulty - Easy
This was face to face interview round.
You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...
Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.
Traverse the binary tree to find all possible triplets.
Check if the sum of each triplet is greater than X.
Ensure the relationship of grandparent-parent-child in each triplet.
Return the valid triplets in any order.
Handle constraints and edge cases appropriately.
Round duration - 60 Minutes
Round difficulty - Easy
FACE TO FACE ROUND INTERVIEW
Mutex is used for exclusive access to a resource by only one thread at a time, while Semaphores can allow multiple threads to access a resource simultaneously.
Mutex is binary and allows only one thread to access a resource at a time, while Semaphores can have a count greater than one.
Mutex is used for protecting critical sections of code, while Semaphores can be used for controlling access to a pool of resources.
Exampl...
Tip 1 : Participate in previous interview questions from leetcode, geeksforgeeks
Tip 2 : Revise computer science subjects like dbms and oops thoroughly
Tip 3 : Participate in live contests on CodeChef, Codeforces
Tip 1 : Only write the things on which you are the most confident about
Final outcome of the interviewRejectedI appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
There was 2 coding questions
Based on ds and algorithms
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...Determine the minimum number of platforms needed at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize two pointers, one for arrival times and one for departure times.
Increment the platform count when a train arrives and decrement when it departs.
Keep track of the maximum platform count needed.
Return the maximum platform count as the minimum number o
Given a string S
of length N
, an array A
of length M
consisting of lowercase letters, and a positive integer K
, determine the minimum number of swaps r...
The minimum number of swaps required to make a string K-periodic by replacing characters with elements from an array.
Iterate through the string and check if each character matches the character K positions ahead.
Count the number of characters that need to be swapped to make the string K-periodic.
Use the array elements to swap characters in the string.
Return the total number of swaps needed for each test case.
Round duration - 45 minutes
Round difficulty - Medium
It was good round they asked me about all the ds and algo basics
With 2 problems by sharing the screeen
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity while traversing the matrix.
Handle edge ca...
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
Round duration - 50 minutes
Round difficulty - Medium
In this round, three questions were asked and all of them were based on DSA and a little bit about projects.
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.
Use BFS to traverse through the shops and keep track of the minimum jumps required.
If at any point the current shop is unreachable (Arr[i] = 0), return -1.
Optimize by using a visited array to avoid revisiting the same shop.
Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems
Tip 1 : Build your resume such that it grabs the eye of the interviewer
Tip 2 : metion your key skills and also maintain atleast 2 projects
I appeared for an interview in Dec 2020.
Round duration - 25 Minutes
Round difficulty - Medium
Very friendly interviewer. Although waiting time was very high
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the question.
Return the sorted list of pairs.
Tip 1 : be confident about your CV points
Tip 2 : practice consulting cases and how to answer situational questions
Tip 1 : be crisp about achievement
Tip 2 : add data points to support your achievements
based on 1 interview
Interview experience
Business Development Executive
648
salaries
| ₹2 L/yr - ₹5.1 L/yr |
Inventory Executive
444
salaries
| ₹2.1 L/yr - ₹5.2 L/yr |
Operations Controller
377
salaries
| ₹2 L/yr - ₹5.4 L/yr |
Shift Incharge
372
salaries
| ₹1.9 L/yr - ₹5.5 L/yr |
Customer Support Executive
325
salaries
| ₹1.6 L/yr - ₹3.8 L/yr |
Milkbasket
Amazon
Blinkit
Flipkart