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 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...
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
Deadlock is a situation in computing where two or more processes cannot proceed because each is waiting for the other to release resources.
Occurs in multi-threaded environments when processes hold resources and wait for others.
Example: Process A holds Resource 1 and waits for Resource 2, while Process B holds Resource 2 and waits for Resource 1.
Can lead to system inefficiency and unresponsiveness.
Deadlock detection and...
A Red-Black Tree is a balanced binary search tree with specific properties to ensure efficient operations.
Each node is colored either red or black.
The root node is always black.
Red nodes cannot have red children (no two reds in a row).
Every path from a node to its descendant leaves must have the same number of black nodes.
This structure ensures O(log n) time complexity for insertion, deletion, and search operations.
Exa...
Local minima in a 2-D array are elements smaller than their neighbors. We can find them using various algorithms.
A local minimum is defined as an element that is less than its adjacent elements.
For example, in the array [[9, 8, 7], [6, 5, 4], [3, 2, 1]], the element 1 is a local minimum.
To find local minima, iterate through each element and compare it with its neighbors (up, down, left, right).
Consider edge cases where...
I appeared for an interview in Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.
You are provided with two strings A
and B
. Your task is to find the index of the first occurrence of A
within B
. If A
is not found in B
, return -1.
A = "bc", ...
Implement a function to find the index of the first occurrence of one string within another string.
Iterate through the second string and check if a substring of the same length as the first string matches the first string.
Return the index of the first occurrence of the first string within the second string, or -1 if not found.
Handle edge cases like empty strings or when the first string is longer than the second string...
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q
queries. Each query is represented by an integer Q[i]
, and you must ...
Search for integers in a rotated sorted array efficiently.
Implement binary search to find the target integer in the rotated array.
Handle the rotation by checking which side of the array is sorted before performing binary search.
Return the index of the target integer if found, else return -1.
Time complexity of O(logN) is required for each query.
Round duration - 60 minutes
Round difficulty - Medium
The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Calculate the number of distinct subsequences in a string with possible duplicates.
Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.
Consider the cases where the current character is included or excluded in the subsequence.
Handle duplicates by considering the previous occurrence of the character.
Return the count of distinct subsequences modulo 10^9 + 7.
Round duration - 60 minutes
Round difficulty - Easy
This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM
Tip 1 : I prepared all topics from my Coding Ninjas Course - Competitive Programming
Tip 2 : I practiced 300+ questions on CodeZen ( Coding Ninjas Platform), LeetCode, InterviewBit
Tip 3 : I took part in contests on CodeForces.
Tip 4 : Apart from Data Structures and Algorithms , I also studied DBMS, OOPs and other course subjects
Tip 1 : Keep Resume up to date for the role you are applying.
Tip 2 : Mention atleast 1 project or past work experience.
Tip 3 : Try to keep a 1 pager resume.
Sorting of an array and aptitude
posted on 16 May 2023
I applied via Campus Placement and was interviewed before May 2022. There were 3 interview rounds.
Basic maths, logical resoning, puzzles
Competitive Programming on Dynamic Programming, Java code debug, SQL qurries
posted on 27 Sep 2024
The hard stock sell problem involves determining the best time to sell stocks to maximize profit.
Consider using dynamic programming to solve this problem efficiently.
Keep track of the minimum stock price seen so far and calculate the maximum profit that can be made by selling at each day.
The final answer will be the maximum profit that can be made by selling at the last day.
Creating a server without using Express framework
Use Node.js built-in 'http' module to create a server
Listen for incoming requests on a specific port
Handle different routes and methods using 'http' module
Singleton class is a class that can only have one instance created throughout the application.
Singleton class restricts the instantiation of a class to one object.
It is often used for logging, caching, thread pools, database connections, etc.
Example: Java implementation of Singleton class -
public class Singleton { private static Singleton instance; private Singleton() {} public static Singleton getInstance() { if(insta...
posted on 9 Nov 2024
I applied via LinkedIn and was interviewed in May 2024. There were 3 interview rounds.
Event loop is a mechanism in programming that allows for asynchronous execution of code by continuously checking for and handling events.
Event loop is commonly used in JavaScript to handle asynchronous operations like setTimeout, setInterval, and AJAX requests.
It works by continuously checking the event queue for any pending events, executing them one by one, and then moving on to the next event.
Event loop helps in pre...
The order of output is fs, process, setTimeout, setInterval, promise.
fs module is synchronous and will output first
process is next in line
setTimeout will be executed after process
setInterval will be executed after setTimeout
promise will be executed last
JavaScript is an interpreted language.
JavaScript is an interpreted language, meaning it is executed line by line at runtime.
There is no separate compilation step in JavaScript like in languages that use compilers.
Examples of interpreted languages include Python, Ruby, and PHP.
Output comparison of for loops using var, let, and bind in JavaScript.
Using var: variable is function-scoped, may lead to unexpected behavior in loops.
Using let: variable is block-scoped, recommended for loop iterations.
Using bind: creates a new function with a specified 'this' value and initial arguments.
Choosing a database involves evaluating data structure, scalability, consistency, and specific use cases.
Understand data structure: Use SQL for structured data (e.g., PostgreSQL) and NoSQL for unstructured data (e.g., MongoDB).
Consider scalability: Choose databases like Cassandra for horizontal scaling in large applications.
Evaluate consistency needs: Use strong consistency databases like MySQL for critical transaction...
I work on coding, debugging, testing, and collaborating with team members. Tech stack decisions are based on project requirements, scalability, performance, and team expertise.
Daily tasks include coding, debugging, testing, and collaborating with team members
Tech stack decisions are based on project requirements, scalability, performance, and team expertise
Consider factors like language compatibility, libraries/framewo...
Design a scalable, real-time document sharing app like Google Docs.
Use websockets for real-time collaboration
Implement version control to track changes
Utilize a distributed database for scalability
Include user authentication and access control
Support offline editing with automatic sync
Utilize cloud storage for scalability, implement image compression techniques, and regularly update image processing libraries.
Utilize cloud storage for scalability
Implement image compression techniques
Regularly update image processing libraries
Implement strategies like versioning, sharding, and caching to manage high I/O and reduce conflicts on the same document.
Use versioning to track changes and allow concurrent edits without conflicts. For example, implement optimistic locking.
Implement sharding to distribute the load across multiple servers, reducing the I/O on a single document.
Utilize caching mechanisms to store frequently accessed data in memory, mini...
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