i
Dunzo
Filter interviews by
I applied via Referral and was interviewed before Jul 2023. There were 3 interview rounds.
2 Leetcode medium to hard level questions were given. Time: 1hr
2 Leetcode medium to hard level questions were given. Time: 1hr
Top trending discussions
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
I appeared for an interview in Nov 2020.
Round duration - 50 minutes
Round difficulty - Easy
Mcq Questions
Round duration - 10 Minutes
Round difficulty - Easy
It was very difficult they go in depth of everything
Given a binary tree consisting of 'N' nodes with distinct integer values, transform it into a Binary Search Tree (BST) while maintaining the original structure of th...
Transform a binary tree into a Binary Search Tree (BST) while maintaining the original structure.
Implement a function to transform the binary tree into a BST by rearranging the nodes based on BST rules.
Maintain the original structure of the binary tree while converting it into a BST.
Ensure that nodes in the left subtree hold values less than the node's value, and nodes in the right subtree hold values greater than the ...
Tip 1 : Do atleast 2 projects
Tip 3 : Practice Atleast 250 Questions
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
I appeared for an interview before Jun 2024, where I was asked the following questions.
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Data structures are used to store and organize data in a computer so that it can be accessed and manipulated efficiently.
Data structures in JavaScript include arrays, objects, sets, and maps.
Arrays are used to store a collection of elements, accessed by index.
Objects are used to store key-value pairs.
Sets are used to store unique values.
Maps are used to store key-value pairs with keys of any type.
In React Native, timers can be implemented using the setTimeout and setInterval functions.
Use setTimeout for a one-time delay before executing a function.
Use setInterval for executing a function repeatedly at a specified interval.
Remember to clear the timer using clearTimeout or clearInterval when no longer needed.
Count occurrences of elements in an array of strings
Iterate through the array and use a hashmap to store the count of each element
Use a for loop to go through each element and increment the count in the hashmap
Return the hashmap with element counts
posted on 23 Feb 2022
I applied via Naukri.com and was interviewed in Sep 2021. There were 3 interview rounds.
posted on 23 May 2022
Duration: 1 hour
Platform: Hackerrank
Topics : Standard Interview Problems
I applied via LinkedIn and was interviewed in Nov 2023. There was 1 interview round.
Easy and medium level questions on array linked list
I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
My dream is to create innovative software solutions that positively impact people's lives and drive technological advancement.
Building User-Centric Applications: I aspire to develop applications that prioritize user experience, like a health tracking app that motivates users to lead healthier lives.
Contributing to Open Source: I dream of contributing to open-source projects, collaborating with developers worldwide to c...
posted on 4 Feb 2024
I applied via Job Fair
Create a controller, service, and repository to save user details using Spring Data JPA.
Create a UserController class with appropriate mappings for saving user details.
Create a UserService class with a method to save user details.
Create a UserRepository interface that extends JpaRepository to handle database operations.
Implement the saveUserDetails method in the UserService class to call the save method of the UserRepo...
based on 1 interview experience
Difficulty level
Duration
Store Manager
109
salaries
| ₹3.8 L/yr - ₹7 L/yr |
Community Operations Specialist
99
salaries
| ₹2.7 L/yr - ₹4.2 L/yr |
Procurement Manager
96
salaries
| ₹3.5 L/yr - ₹7 L/yr |
Inward Executive
93
salaries
| ₹1.8 L/yr - ₹3.5 L/yr |
Delivery Boy
89
salaries
| ₹0.5 L/yr - ₹4.5 L/yr |
Swiggy
Zepto
Porter
Rapido