Filter interviews by
Cricbuzz system design involves handling real-time sports data, user traffic, and providing live scores, news, and updates.
Use microservices architecture to handle different functionalities like live scores, news, and updates.
Implement caching mechanisms to reduce load on servers and improve performance.
Utilize a distributed database to store large amounts of sports data efficiently.
Implement a robust notification syst...
The aptitude test consist of 50 questions which was simple and mixed if all concepts
Only one easy coding question
I applied via Approached by Company and was interviewed in Mar 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed before Oct 2022. There were 2 interview rounds.
Design a social networking platform with features like user profiles, news feed, messaging, and photo sharing.
Create user profiles with customizable information and privacy settings
Implement a news feed algorithm to display relevant content to users
Include messaging functionality for private communication between users
Allow users to share photos and videos on their profiles and in posts
It had 9 uqestions , one problem solving , one SQL , one API and 6 mcq
Easy assignment , if you hav eOOps knowledge you can do it
DSA - 3 Coding Questions
I applied via Walk-in and was interviewed in May 2021. 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 1 interview
Interview experience
Category Manager
522
salaries
| ₹4 L/yr - ₹14 L/yr |
Business Development Associate
458
salaries
| ₹1.8 L/yr - ₹5.2 L/yr |
Senior Category Manager
137
salaries
| ₹10 L/yr - ₹24 L/yr |
AC Technician
136
salaries
| ₹0.7 L/yr - ₹7.2 L/yr |
Beautician
135
salaries
| ₹0.9 L/yr - ₹10 L/yr |
Housejoy
Urban Ladder
Udaan
Swiggy