i
BigBasket
Filter interviews by
Clear (1)
My mostly question were around node js frame works and other tools
Top trending discussions
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Question are very tough and faad
Question like trees linked list and graphs
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
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
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
I applied via Campus Placement
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 1 interview
Interview experience
Business Development Executive
654
salaries
| ₹0 L/yr - ₹0 L/yr |
Inventory Executive
432
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Controller
380
salaries
| ₹0 L/yr - ₹0 L/yr |
Shift Incharge
371
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Support Executive
326
salaries
| ₹0 L/yr - ₹0 L/yr |
Milkbasket
Amazon
Blinkit
Nature's Basket