Filter interviews by
I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.
Arrays strings maps sets trees binary search
I appeared for an interview in Jan 2024.
I will organize coding workshops, competitions, and study groups to share Coding Blocks in my college campus.
Organize coding workshops on various topics to introduce students to Coding Blocks.
Host coding competitions to engage students and encourage them to practice on Coding Blocks platform.
Create study groups where students can collaborate and learn from each other using Coding Blocks resources.
Promote Coding Blocks ...
Coding Blocks interview questions for popular designations
I applied via Company Website and was interviewed in Mar 2023. There were 3 interview rounds.
3 questions, 1 hour, live webcam with screen sharing. Problems: Rat in a maze, coin change, murthal parantha. Problems were on backtracking, recursion, dynamic programming, binary search and greedy algorithms. Medium to hard difficulty.
Top trending discussions
I applied via Walk-in and was interviewed in May 2021. There was 1 interview round.
I applied via Walk-in and was interviewed in Dec 2020. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Jun 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 23 reviews
Rating in categories
Product Engineer
7
salaries
| ₹5 L/yr - ₹12 L/yr |
Teaching Assistant
6
salaries
| ₹1.2 L/yr - ₹3 L/yr |
Software Developer
4
salaries
| ₹3 L/yr - ₹8 L/yr |
HR Manager
4
salaries
| ₹5 L/yr - ₹7 L/yr |
Operations Executive
4
salaries
| ₹2.8 L/yr - ₹4.2 L/yr |
Udaan
Swiggy
CARS24
BlackBuck