Premium Employer

i

This company page is being actively managed by BigBasket Team. If you also belong to the team, you can get access from here

BigBasket Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

BigBasket Front end Developer Interview Questions and Answers

Updated 22 Jun 2024

BigBasket Front end Developer Interview Experiences

1 interview found

Front end Developer Interview Questions & Answers

user image sushanth shetty

posted on 22 Jun 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

My mostly question were around node js frame works and other tools

Round 2 - One-on-one 

(2 Questions)

  • Q1. Case study for the question asked
  • Q2. Tell me something more about you

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Questions on optimizations
  • Q2. Question on React Js
Round 2 - Coding Test 

Medium level DSA question in JS

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in May 2024. There was 1 interview round.

Round 1 - Coding Test 

There was an online coding test on signal consisting of leetcode easy medium and hard

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Introduce Yourself, What do you know about Insurances?
Round 2 - HR 

(1 Question)

  • Q1. How can you as a Front End developer contribute to our company?

Interview Preparation Tips

Interview preparation tips for other job seekers - Remember your goal
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed before Aug 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

30mins aptitude test

Round 2 - Coding Test 

90 mins coding test for 3 questions

Round 3 - HR 

(2 Questions)

  • Q1. Why are you choosing this role
  • Ans. 

    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

  • Answered by AI
  • Q2. Why should we write you
  • Ans. 

    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

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Coding a frontend UI from provided image. And creating a fucntional star rating system

Round 2 - Technical 

(2 Questions)

  • Q1. Designing a Component API in React using Typescript.
  • Ans. 

    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

  • Answered by AI
  • Q2. Create a function that can clear all the timer ids at once.
  • Ans. 

    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

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Given a matrix zeros and ones find minimum distance for each one to a zero.
  • Ans. 

    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

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

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.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    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.

    Example of Sub...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 50 Minutes
Round difficulty - Easy

This was face to face interview round.

  • Q1. 

    Finding Triplets in a Binary Tree Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

FACE TO FACE ROUND INTERVIEW

  • Q1. Can you tell me about yourself?
  • Q2. What is the difference between Mutex and Semaphores? Please provide a real-life example.
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaabove 7 cgpaAmazon interview preparation:Topics to prepare for the interview - Computer Fundamentals, Data Structures and AlgorithmsTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

Tip 1 : Only write the things on which you are the most confident about

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions
Based on ds and algorithms

  • Q1. 

    Minimum Number of Platforms Problem

    Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.

    Explanation:

    Given two arrays:

    • AT - represent...
  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Minimum Number of Swaps to Achieve K-Periodic String

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

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

  • Q1. 

    Number of Islands Problem Statement

    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...

  • Ans. 

    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...

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

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.

  • Q1. 

    Minimum Jumps Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 65 percentAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Computer Networks, JavaTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Dec 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 25 Minutes
Round difficulty - Medium

Very friendly interviewer. Although waiting time was very high

  • Q1. 

    Pair Sum Problem Statement

    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'.

    Note:
    ...
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNoAmazon interview preparation:Topics to prepare for the interview - CV points, Leadership principles, ecommerce basics, problem solving, case studiesTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : be confident about your CV points
Tip 2 : practice consulting cases and how to answer situational questions

Application resume tips for other job seekers

Tip 1 : be crisp about achievement
Tip 2 : add data points to support your achievements

Final outcome of the interviewRejected

Skills evaluated in this interview

BigBasket Interview FAQs

How many rounds are there in BigBasket Front end Developer interview?
BigBasket interview process usually has 2 rounds. The most common rounds in the BigBasket interview process are Coding Test and One-on-one Round.

Tell us how to improve this page.

BigBasket Front end Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Join BigBasket India's largest online supermarket

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
3.9
 • 1.3k Interviews
PolicyBazaar Interview Questions
3.6
 • 378 Interviews
JustDial Interview Questions
3.5
 • 330 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
Times Internet Interview Questions
3.6
 • 65 Interviews
View all
Business Development Executive
648 salaries
unlock blur

₹2 L/yr - ₹5.1 L/yr

Inventory Executive
444 salaries
unlock blur

₹2.1 L/yr - ₹5.2 L/yr

Operations Controller
377 salaries
unlock blur

₹2 L/yr - ₹5.4 L/yr

Shift Incharge
372 salaries
unlock blur

₹1.9 L/yr - ₹5.5 L/yr

Customer Support Executive
325 salaries
unlock blur

₹1.6 L/yr - ₹3.8 L/yr

Explore more salaries
Compare BigBasket with

Milkbasket

3.9
Compare

Amazon

4.1
Compare

Blinkit

3.7
Compare

Flipkart

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview