i
BigBasket
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2024. There were 2 interview rounds.
I am a motivated and enthusiastic individual with a passion for learning and gaining practical experience in the field.
Currently pursuing a degree in [Your Field of Study] at [Your University]
Completed relevant coursework in [Specific Subjects]
Previous internship experience at [Company Name] where I gained skills in [Specific Skills]
Volunteered at [Organization] where I developed strong communication and teamwork skill
I have a strong interest in cybersecurity and enjoy learning about the latest trends and technologies in the field.
Completed courses in cybersecurity fundamentals
Participated in cybersecurity competitions
Stay updated on cybersecurity news and developments
Interested in ethical hacking and penetration testing
Cross-Site Scripting (XSS) is a type of security vulnerability that allows attackers to inject malicious scripts into web pages viewed by other users.
Reflected XSS: Injected script reflects off a web server and is executed in the victim's browser.
Stored XSS: Injected script is stored on the server and executed whenever the victim accesses the affected page.
DOM-based XSS: Exploits client-side scripts to manipulate the D...
What people are saying about BigBasket
I applied via Job Portal and was interviewed in Jun 2021. There were 3 interview rounds.
Sorts an array of strings in ascending order.
Use a sorting algorithm like bubble sort, selection sort, or merge sort.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat the process until the array is sorted.
I applied via Company Website and was interviewed in May 2021. There was 1 interview round.
I applied via Company Website and was interviewed in Aug 2021. There were 2 interview rounds.
E-commerce
posted on 28 Jul 2020
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
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
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
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
I appeared for an interview before Apr 2021.
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.
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Array: [2,1,5,6,3,8], K ...
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
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
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.
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.
I applied via Policy bazaar site and was interviewed before Sep 2019. There was 1 interview round.
Introducing the new and improved smartwatch with advanced health tracking features.
Track your heart rate, sleep patterns, and daily activity levels
Receive notifications and make calls without taking out your phone
Choose from a variety of stylish designs to match your personal style
Policy Bazaar is an online insurance marketplace in India.
Policy Bazaar is a platform that allows users to compare and buy insurance policies from various providers.
It offers a wide range of insurance products including health, life, motor, travel, and home insurance.
Users can get quotes, compare features and prices, and make informed decisions about their insurance needs.
Policy Bazaar has partnerships with leading ins...
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Business Development Executive
649
salaries
| ₹2 L/yr - ₹5.2 L/yr |
Inventory Executive
437
salaries
| ₹2 L/yr - ₹5.2 L/yr |
Shift Incharge
421
salaries
| ₹2 L/yr - ₹5.8 L/yr |
Operations Controller
396
salaries
| ₹2 L/yr - ₹5.9 L/yr |
Customer Support Executive
327
salaries
| ₹1.6 L/yr - ₹3.8 L/yr |
Milkbasket
Amazon
Blinkit
Flipkart