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
Developed a web-based project management tool to streamline team collaboration and task tracking.
Utilized React for the front-end, ensuring a responsive and user-friendly interface.
Implemented RESTful APIs using Node.js and Express for seamless data communication.
Integrated a PostgreSQL database for efficient data storage and retrieval.
Employed Agile methodologies for project management, resulting in a 30% increase in ...
Top trending discussions
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 appeared for an interview in Oct 2020.
Round duration - 90 minutes
Round difficulty - Medium
The test was conducted in the evening from 5:00 pm to 6:30 pm. Because of the covid situation, all the students attempted the test from their homes. But it was a webcam-based test to avoid any kind of cheating.
There were 3 coding problems to be done in 90 minutes.
After resume based shortlisting, 70 candidates were selected to appear for the test out of which 30 were shortlisted for interviews.
Determine if the third string contains all the characters from both the first and second strings in any order. If so, return "YES"; otherwise, return "NO".
Line ...
Check if the third string contains all characters from the first and second strings in any order.
Create a frequency map for characters in the first and second strings.
Check if all characters in the third string are present in the frequency map.
Ensure the count of characters in the third string matches the count in the frequency map.
Return 'YES' if all conditions are met, otherwise return 'NO'.
You are given a connected undirected unweighted graph comprising 'N' nodes and 'M' edges. In this graph, each pair of connected nodes is linked by exactly one undirected e...
Find the length of the shortest path visiting all nodes in a connected undirected unweighted graph.
Use Breadth First Search (BFS) to find the shortest path that visits all nodes at least once.
Maintain a bitmask to keep track of visited nodes and their states.
Consider all possible permutations of nodes to find the shortest path length.
Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...
Round duration - 50 minutes
Round difficulty - Medium
This round started at 9 am and went till 4 pm.
Out of 70 students that appeared in online coding test, 30 were shortlisted for the first round (this round) of interviews.
In this round, everyone was asked one moderate level coding question. The interviewer provided the link to an IDE, where I wrote my code.
The interview started with the introduction being followed by 1 coding problem. In the end, the interviewer asked me if I wanted to ask any questions. To which I asked him my feedback so that I can improve my wear areas.
Of the 30 candidates, 17 were selected for the final interview round.
Given an array arr
containing 'N' distinct integers, your task is to generate all possible non-empty subsets of this array.
Note: While the elements within each subset should ...
Generate all possible non-empty subsets of an array of distinct integers.
Use recursion to generate all subsets by including or excluding each element in the array.
Maintain a current subset and add it to the result when reaching the end of the array.
Ensure elements within each subset are in increasing order.
Handle the input and output format as specified in the question.
Round duration - 50 minutes
Round difficulty - Easy
This was a technical + HR round. Started in the evening at 4:30 pm, this round went till 9:30 pm.
17 students were shortlisted for this final round of interview.
This interview was also virtual and involved both technical and HR-related questions. The interview started with an introduction and then questions based on my resume were asked.
Out of 17 candidates, 8 candidates got a full-time offer from Urban Company.
You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...
Find the row with the maximum number of 1's in a sorted 2D matrix.
Iterate through each row of the matrix and count the number of 1's in each row.
Keep track of the row index with the maximum number of 1's seen so far.
Return the index of the row with the maximum number of 1's.
If multiple rows have the same number of 1's, return the row with the smallest index.
Tip 1 : Coding Problems are asked from DSA, so a good practice of standard problems is a must. Revisit these problems before the interview to ace and crack the interview.
Tip 2 : To tackle the conceptual questions, you need to have thorough knowledge about the concepts, so to prepare for OS and DBMS, read one standard book.
Tip 3 : Have proper and clear knowledge about your project. Basic but tricky questions are asked based on the internship experience and the projects you have done.
Tip 1 : The best way to ace an interview is to take command of your interview in your hands. And this is done by having a balanced resume. Projects give direction to the interview and increase the probability of selection. So add at least 2 projects.
Tip 2 : Urban Company seeks team players and not just good coders. So add your achievements outside the academics to get shortlisted.
I appeared for an interview in Oct 2020.
Round duration - 75 minutes
Round difficulty - Medium
The test had 3 questions which had to solved in 75 minutes.The test was of medium difficulty.
Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...
You are provided with an integer X
and are tasked with identifying an integer Y
such that the bitwise XOR operation between X
and Y
yields the maximum possible value. The condition is t...
Find an integer Y such that XOR operation with X yields maximum value within given constraints.
Iterate from the most significant bit to find the highest bit that can be toggled to maximize XOR value.
To maximize XOR value, toggle the highest bit of X to 0 and all lower bits to 1.
Ensure the final Y does not exceed (2^61) - 1.
Example: For X = 3, the highest bit to toggle is at position 61, so Y = 2305843009213693950.
Examp...
You are provided with a non-decreasing array and an integer K. Your task is to remove exactly K elements from this array so that the maximum differenc...
Remove K elements from a non-decreasing array to minimize the maximum difference between adjacent elements.
Sort the array in non-decreasing order.
Iterate through the array and calculate the difference between adjacent elements.
Remove elements to minimize the maximum difference.
Return the minimized maximum difference.
Round duration - 60 minutes
Round difficulty - Easy
The interview was taken by SDE2 and she was very friendly. All the questions asked were related to DS and algo. The first 10 minutes were used for introductions and the last 5 minutes were reserved for any questions that I have. Always try to ask meaningful questions at the end of the interview.
Given a sorted array ARR
and a number X
, your task is to determine the count of occurrences of X
within ARR
.
X
is not found in the array, return...Count occurrences of a number in a sorted array efficiently.
Use binary search to find the first and last occurrence of the target number in the array.
Calculate the count of occurrences by subtracting the indices of the last and first occurrences.
Handle cases where the target number is not found in the array.
Time complexity: O(log(N)), Space complexity: O(1).
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...
Round duration - 60 minutes
Round difficulty - Medium
The focus of this round was mainly on my projects and internships. It was taken by a Senior SDE and it more of a technical interaction. I was asked in-depth about my projects and most of the questions asked around OS/DBMS were based on my projects.
The interviewer wanted to judge whether I have core knowledge about subjects like OS and DBMS and also about the projects that I had done.
Round duration - 60 minutes
Round difficulty - Easy
It was the culture fit round taken by the Director of Engineering.
Tip 1 : Learn the concepts, not the solutions.
Tip 2 : You should have deep knowledge about the projects mentioned in your resume.
Tip 1 : Resume should be only 1 page.
Tip 2 : Try to tell a story through your resume. For eg - always mention the impact or scale of your projects/internship.
I applied via Instahyre and was interviewed in Nov 2024. There were 2 interview rounds.
Easy to medium questions, Questions on DSA and Node.js.
The three sum problem involves finding unique triplets in an array that sum to zero.
Sort the array to simplify finding triplets.
Use a loop to fix one element and apply two-pointer technique for the rest.
Skip duplicates to ensure unique triplets.
Example: For array [-1, 0, 1, 2, -1, -4], the triplets are [-1, -1, 2], [-1, 0, 1].
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
I appeared for an interview before Jul 2024, where I was asked the following questions.
Rearranging an array to place negative and positive numbers at even and odd indices respectively.
1. Iterate through the array and separate positive and negative numbers.
2. Create a new array of the same length to hold the rearranged elements.
3. Place negative numbers at even indices (0, 2, 4,...) and positive numbers at odd indices (1, 3, 5,...).
4. If there are more positives than negatives, fill remaining odd indices ...
To find the second highest salary, we can use various methods like sorting or using a set to eliminate duplicates.
Use a set to store unique salaries, then convert it to a list and sort it.
Example: salaries = [3000, 2000, 4000, 4000]; unique_salaries = set(salaries) -> [2000, 3000, 4000].
After sorting, the second highest can be accessed by index -2.
Alternatively, iterate through the list while keeping track of the hi...
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 ...
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.
I applied via Walk-in
Mixed design is a research design that combines elements of both quantitative and qualitative research methods.
Mixed design involves collecting and analyzing both numerical data and non-numerical data.
It allows researchers to gain a more comprehensive understanding of a research topic by utilizing the strengths of both quantitative and qualitative approaches.
Examples of mixed design studies include using surveys to col...
A cube mould is a device used in construction to create concrete cubes for testing the compressive strength of concrete.
Cube moulds are typically made of steel or cast iron and come in various sizes.
Concrete is poured into the cube mould and allowed to set before being tested for strength.
The dimensions of the cube mould are standardized to ensure accurate testing results.
Cube moulds are commonly used in construction p...
M20 grade is a mix of concrete with a compressive strength of 20 megapascals after 28 days.
M20 grade concrete is commonly used for residential construction.
It is a mix of 1:1.5:3 (cement:sand:aggregate).
The compressive strength of M20 grade concrete is achieved after 28 days of curing.
It is suitable for foundations, slabs, beams, columns, etc.
The end-to-end billing procedure involves reconciliation of materials and analysis of vendor work orders.
Gather all relevant information for billing, including materials used and vendor work orders.
Verify the accuracy of the materials used and work performed against the vendor work orders.
Calculate the total cost of materials and work performed for billing purposes.
Generate an invoice based on the reconciled materials ...
based on 1 interview experience
Difficulty level
Duration
Store Manager
109
salaries
| ₹3.8 L/yr - ₹7 L/yr |
Community Operations Specialist
100
salaries
| ₹2.7 L/yr - ₹4.3 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
| ₹1.5 L/yr - ₹4.5 L/yr |
Swiggy
Zepto
Porter
Rapido