i
Dunzo
Filter interviews by
I was interviewed in Oct 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This was a DS/Algo round.
Timing was 4:00pm-5:00pm IST.
The interviewer was very friendly.
He asked for my introduction.
Given an array/list ASTEROIDS
representing asteroids aligned in a row, each element's absolute value identifies the asteroid's size, while its sign indicates the dir...
Step 1 : I was able to think of a stack solution directly.
Step 2 : We have to keep track of asteroids that are moving in the right direction.
Step 3 : When we found an asteroid that is moving in the left direction then we will use the stack to check asteroids that will collide.
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
Make use of the stack. Traverse the string and push the current character in the stack if it is an opening brace else pop from the stack If it is the corresponding starting brace for current closing brace then move to the next character of the string otherwise return false.
If after complete traversal if the stack is empty then the string is balanced else it is not balanced.
Pseudo Code:
Round duration - 60 Minutes
Round difficulty - Medium
Timing was 3:00pm-4:00pm IST
Interviewer was friendly
He asked for my introduction. We dry run the code for the question.
Given a non-empty string 'S' containing no spaces and a dictionary of non-empty strings, generate and return all possible sentences by adding spaces in the string 'S', such...
Step 1 : Was able to recognize that it was a question of backtracking.
Step 2 : Created a unordered hashmap to check if any string is part of dictionary or not.
Step 3 : Traverse the string in recursive manner.
Step 4 : For each prefix, we check if it is part of dictionary or not. If it is part of dictionary then include this prefix string in answer otherwise include the next character in the string.
Tip 1: Do not be nervous
Tip 2 : Ask questions from the interviewer if you are confused
Tip 1 : Mention your coding achievement in the resume
Tip 2 : You should have at least one good project on your resume.
I was interviewed before Nov 2020.
Round duration - 90 Minutes
Round difficulty - Medium
1. 90 min , can do anytime between a designated 4 hr window
2. was on Hackerrank, and I was familiar with the platform
3. had 3 coding questions
Given an undirected graph of 'V' vertices (labeled 0, 1, ..., V-1) and 'E' edges, the task is to determine whether the graph is bipartite.
A bipartite grap...
The idea is very simple. To separate the vertices of the graph in two sets such that no two vertices of a set are connected, we will try to color the vertices of the graph using two colors only.
If any of the adjacent vertices are of the same color, the graph is not bipartite. Else, it is bipartite.
Note that, if there are more than 1 connected components in the graph, the graph will be bipartite if and on...
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
The basic idea of this approach is to break the original problem into sub-problems. Let us assume we want to find the length of the longest common subsequence of “STR1” and “STR2” whose length is ‘N’ and ‘M’ respectively.
Now, let us define a recursive function
LCS(Int I, int J, string STR1, string STR2)
Which returns the length of the longest common subsequence of string STR1...
Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.
A min-binary heap is a complete binary tree where each internal node's va...
The idea is to follow a top-down approach. The given array does not necessarily represent a heap. In order to convert the input array to a heap, we will heapify the complete binary tree formed from the array in reverse order, i.e., from the rightmost element to the leftmost element. Heapify is defined as the process of converting a binary tree into a Heap data structure. We do not need to heapify the l...
Round duration - 60 minutes
Round difficulty - Hard
With manager
1. DS/algo
2. Networking
3, basic project stuff
4. Google meet
3. was in the afternoon
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...
We will try to explore all the possibilities using the recursion.
Let’s say we have a recursive function ‘REC’ who has two arguments IDX and IDY where IDX represents the index in the text string and IDY represents the index in pattern string and its return type is boolean. Initially, we will call the rec with IDX = N and IDY = M where N is the size of the text string and M is the size of the patte...
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a...
This problem can be solved through recursion.We will maintain max_level variable which will keep track of maxLevel and will pass current level in recursion as argument. Whenever we see a node whose current level is more than maxLevel then we will print that node as that will be first node for that current level. Also update maxLevel with current level.
Space Complexity: O(n)Explanation:O(N), where ‘N’...
Tip 1 : Interview Preparation is different from competitive coding. One has not to be a master, to ace faang interviews. CP is like solving puzzles.
Tip 2 : In interview be as descriptive as you can. Try to demonstrate the what you are thinking and the path you took to reach the solution ( whether or not it is correct )
Tip 3 : Try to improve your communication skills ( Trust me it matters a lot )
Tip 1 : Have a master resume and align it with the company requirements and position you are applying
Tip 2 : Include the projects that you actually worked on or have the knowledge about it
I was interviewed before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
This round contained two coding questions. I was also asked some basic android development questions as I had mentioned a couple of projects around android.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mir...
I first clarified the doubts since the question was too vague in start.
Then I told that this problem can be solved with iterative or recursive approach, Interviewer told me to go ahead and code the recursive one.
We discussed time complexity.
Then I implemented iterative one too.
I asked clarifying doubts to understand the exact scope.
Then we discussed possible data structures.
And finally concluded that stack would be the best one.
I didn't have to code this question.
Round duration - 60 Minutes
Round difficulty - Medium
I was asked two coding questions, some questions around OOPs concepts and DBMS.
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
I gave the level order traversal approach.
Interviewer asked me to implement it.
I discussed multiple ways to implement and went ahead with delimiter one.
Design and implement a Trie (Prefix Tree) which should support the following two operations:
1. Insert a word into the Trie. The operation is marked as 'insert(word)'.
2....
This was a straight forward implementation problem. We discussed everything about tries in detail.
Tip 1 : Focussing on DSA is essential for freshers, most of the companies' interview process will contain DSA questions.
Tip 2 : Stay stick to the basic concepts and don't feel overwhelmed by the advance concepts, most of the companies' will judge you on your foundation/basics.
Tip 1 : Resume should be one pager document which enables user to understand your background. Understand the difference between CV and resume.
Tip 2 : Be as honest as you can on your resume. However, writing that you are a beginner for this particular skill is fine.
Top trending discussions
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Easy to medium level of leet code
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.
For Fibonacci series without recursion, use a loop to calculate the series.
For string palindrome, compare characters from start and end of the string.
To count all repeated numbers from the array, u
Rotate array to find max sum of i*A[i]
Rotate array to bring maximum element to front
Calculate sum of i*A[i] for each rotation
Keep track of maximum sum found
I was interviewed before Aug 2023.
3 question of basic and 3 mcq
Strings,Sort 0 1 2,invert binary tree
My daily routine involves coding, debugging, attending meetings, and learning new technologies.
Start the day by checking emails and prioritizing tasks
Code and debug new features or fix existing issues
Attend team meetings to discuss progress and roadblocks
Spend time learning new technologies or improving coding skills
Collaborate with team members on projects
I applied via campus placement at Indian School of Mines (ISM), Dhanbad and was interviewed before Nov 2023. There were 2 interview rounds.
2 questions on Hackerearth leetcode medium to hard level
I was interviewed in May 2021.
Round duration - 90 Minutes
Round difficulty - Hard
Test Description/Instruction as Mentioned on the portal and mail :
1) The test will consist of 3 algorithmic problems.
2) The test time is 1.5 hours in which you will need to solve the 3 problems. The test link will be active from 10:00 AM onwards.
3) Please do not change the tabs since all the actions will be recorded and logged.
Assist Ninja in altering the color of a specific region in his photo. Given the image as a 2D array where each pixel is a positive integer, update the color of a specified pixel ...
The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.
The image is represented as a 2D array of positive integers
The starting pixel and new color are given
Adjacent pixels are connected in up, down, left, or right directions
Diagonal pixels are not considered adjacent
Implement the Flood Fill Algorithm to replace the color of the given pixel and it...
You are given a connected undirected weighted graph. Your task is to determine the weight of the minimum spanning tree of this graph.
A minimum...
The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.
Implement Kruskal's algorithm to find the minimum spanning tree
Use a disjoint set data structure to keep track of connected components
Sort the edges in non-decreasing order of their weights
Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle
Return the sum of weigh
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.
Then it merges the two sorted halves to produce a single sorted array.
The time complexity of merge sort is O(n log n), where n is the size of the input array.
The algorithm is efficient ...
Tip 1 : Practice Atleast 300 Questions on leetcode (150 easy, 100 medium and 50 hard )
Tip 2 : Make atleast one big project which includes (DB, backend and frontend). Because in Hiring Manager round we have to discuss our resume for about 45mins to 1 Hr so having 1 or 2 big projects on the resume is always good to have otherwise HM will go towards core subjects Like OOP/OS/Networks which are often tricky.
Tip 3 : Think out of the box while solving a Question think of all the variants in which this questions can be asked. Let's take an example of simple question like two sum here we have to find a pair in an array whose sum is equal to given value. Now what if Interviewer asked to find three numbers instead of 2 or maybe find k numbers whose sum is equal to a given number. So it is always good to think out of the box and generalise the solution.
Tip 4 : Always try to solve each question in different ways. You should know both the bruteforce solution and the optimal one.
Tip 5 : When you solve a Question try to learn as much possible from a single Question for eg if you try to solve a Tree question then it is good to know both the iterative and recursive solution as sometimes Interviewer may introduce some constraints that due to huge test case recursive solution is not possible.
Tip 6 : 3-4 days before the interview start preparing using interviewbit as it contains all the important questions topic wise. I usually solve Interviewbit before the interview. No doubt Leetcode is good in terms of UI, Test cases and Easy to use but Interviewbit is more organised. I myself have done all the Interviewbit Questions multiple times.
Tip 1 : Try to add Experience at the top with detailed explanation of work done by you
Tip 2 : If No Experience: try to add more and more personal projects with the skills required in JD
Tip 3 : If No projects and Experience: Try to add Coding profiles, Achievements (Hackathons and Coding Competitions )
I was interviewed in Feb 2021.
Round duration - 24 hours
Round difficulty - Medium
Round duration - 120 Minutes
Round difficulty - Medium
It was a Data Structures and Algorithm Round and Discussion on My assignment round to check my Problem Solving Skills.
And the Interviewer was very friendly to me. I first introduced myself to the interviewer and what did I have done in past as a Software Engineer and Why I want to work in Grofers.
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...
Given an array ARR
consisting of exactly four integer digits, your task is to form the maximum possible valid time in a 24-hour format using those digits.
Approach:
Algorithm:
Tip 1 : Practise Data Structures and Algorithms as much as you can on daily basis. Don't Fix numbers in your head, but practise as much as you can from all topics on daily basis.
Tip 2 : Give Programming Contests on a Daily basis. As it helps you to think of any particular problem in the fixed time frame.
Tip 3 : For Mastering DP, Learn From Aditya Verma Youtube Playlist and apply around 100 questions for solving any DP problem.
Tip 4 : Also Learn Computer Science theory subject once a week so that you will have a deep understanding of the particular subject since many interviews grind on CS theory subjects like OS, DBMS and Networks
Tip 5 : Make at least 2-3 Projects in any technology you like maybe Web Development or Android Development. It shows that you have some experience in Development and the company don't need to waste time on you for teaching frameworks.
Tip 6 : If you have time learn some System Design and learn how to design any system from end to end. Especially learn about designing a database of any application. In many interviews, the interviewer asks to design an application from end to end. So if you have some practice, then you can easily clear this type of rounds.
Tip 1 : Always attached your Project links in your resume. As it seems your project is genuine and you are confident in showing your projects
Tip 2 : Don't add unnecessary things in your resume which are not related to the job, like your 10th class winning tournament certificate or managing a college society. These things didn't create any impact on your profile and takes an unnecessary space in your resume.
Tip 3 : Always make a 1-page resume. If you are making more than 1 page then it means you have added a lot of unnecessary information which are not related to the job profile.
Tip 4 : Always show your Project and Past experience on top, just after your basic info and education. Since these are the things which should be on top to showcast the skills.
I applied via campus placement at Kalinga Institute of Industrial Technology, Khurda and was interviewed in Sep 2023. There was 1 interview round.
3 Questions were asked out of which if you did 2 you were shortlisted for next round. Questions were mostly from topics like array, string and greedy
Community Operations Specialist
112
salaries
| ₹2.6 L/yr - ₹4.2 L/yr |
Store Manager
106
salaries
| ₹3.8 L/yr - ₹7 L/yr |
Procurement Manager
103
salaries
| ₹3.5 L/yr - ₹7 L/yr |
Delivery Boy
91
salaries
| ₹0.5 L/yr - ₹4.5 L/yr |
Inward Executive
90
salaries
| ₹1.9 L/yr - ₹3.5 L/yr |
Swiggy
Zepto
Porter
Rapido