Filter interviews by
I applied via LinkedIn and was interviewed in Sep 2024. There were 2 interview rounds.
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers - low, mid, and high to partition the array into three sections.
Iterate through the array and swap elements based on their values.
Repeat until all elements are sorted.
Finding a specific element in a large collection of data
Use efficient search algorithms like binary search or hash tables
Consider sorting the data first to speed up the search process
Optimize the search by narrowing down the search space if possible
Design a parking lot system for managing parking spaces and vehicles.
Consider different types of parking spaces (regular, handicapped, electric vehicle charging, etc.)
Implement a system for assigning and tracking parking spaces for vehicles
Include features for payment, reservations, and monitoring of available spaces
Design a user-friendly interface for both customers and parking attendants
I applied via Referral and was interviewed in Feb 2024. There was 1 interview round.
LLM stands for Master of Laws, a postgraduate academic degree in law.
LLM is a specialized degree for individuals who have already completed their law degree and wish to further their legal education.
It allows students to focus on a specific area of law, such as international law, environmental law, or intellectual property law.
LLM programs typically involve coursework, research, and a thesis or dissertation.
Some exampl...
Prompt engineering is the process of quickly and efficiently designing and implementing solutions to problems or tasks.
Involves identifying the problem or task at hand
Creating a plan or strategy to address the problem
Implementing the solution in a timely manner
Iterating on the solution based on feedback or results
Examples: software development, project management, problem-solving in various industries
Given a question to fetch max length of fibbinocci series that can be formed from an array
I applied via Approached by Company and was interviewed before Apr 2023. There was 1 interview round.
BarRaiser interview questions for popular designations
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in Jun 2020. There was 1 interview round.
I applied via Referral and was interviewed before May 2020. There was 1 interview round.
To understand the supply of restaurants in a particular area of a city, we can use various methods.
Collect data from online directories like Yelp, Zomato, etc.
Conduct surveys to gather information about the number of restaurants in the area.
Analyze the population density and demographics of the area to estimate the demand for restaurants.
Check the number of restaurant permits issued by the local government.
Use GIS mapp...
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
Yes, I am comfortable traveling for work.
I have experience traveling for work in my previous roles.
I am adaptable and enjoy exploring new places.
I am willing to travel for client meetings and conferences.
I understand the importance of face-to-face interactions in sales.
I am organized and can handle the logistics of travel efficiently.
I applied via LinkedIn and was interviewed before May 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
based on 5 interviews
Interview experience
based on 13 reviews
Rating in categories
Operations Associate
6
salaries
| ₹4.5 L/yr - ₹5.2 L/yr |
Business Analyst
4
salaries
| ₹9 L/yr - ₹9.4 L/yr |
Product Lead
4
salaries
| ₹35 L/yr - ₹62 L/yr |
Senior Associate Operations
4
salaries
| ₹5.1 L/yr - ₹6.5 L/yr |
Data Analyst
3
salaries
| ₹4 L/yr - ₹7 L/yr |
HackerRank
InterviewBit
GeeksForGeeks
LeetCode