i
Dunzo
Filter interviews by
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
Given a sequence of 'N' space-separated non-negative integers A[1], A[2], ..., A[i], ..., A[n], where each number in the sequence represents the height of a lin...
Find two lines to form a container with maximum water area on a Cartesian plane.
Iterate through the array from both ends to find the maximum area.
Calculate the area using the formula: (min(height[left], height[right]) * (right - left)).
Update the pointers based on the height of the lines to maximize the area.
Round duration - 45 minutes
Round difficulty - Easy
Given two strings 'STR' and 'PTR', identify all starting indices of 'PTR' anagram substrings in 'STR'. Two strings are anagrams if one can be rearranged to form the other.
Identify starting indices of anagram substrings of 'PTR' in 'STR'.
Use a sliding window approach to check for anagrams of 'PTR' in 'STR'.
Create a frequency map of characters in 'PTR' and 'STR' to compare.
Slide the window along 'STR' and check if the frequency maps match.
Return the starting indices where anagrams are found.
Given a binary-valued matrix of size N x M
, your task is to determine the largest area of a submatrix that contains only 1's.
The first line c...
Find the largest area of a submatrix containing only 1's in a binary matrix.
Iterate over each cell in the matrix and calculate the maximum area of submatrix with all 1's ending at that cell.
Use dynamic programming to keep track of the maximum area ending at each cell.
Update the maximum area as you iterate through the matrix.
Return the overall maximum area found in the matrix.
Round duration - 60 minutes
Round difficulty - Medium
Your task is to determine the number of subsequences with odd sums and the number of subsequences with even sums from a given array of positive integers. As res...
Count the number of subsequences with odd and even sums in a given array of positive integers modulo 10^9 + 7.
Use dynamic programming to keep track of the count of subsequences with odd and even sums.
Consider the parity of each element in the array to determine the count of subsequences with odd and even sums.
Apply modulo 10^9 + 7 to handle large resulting numbers.
Example: For input [1, 2, 3], there are 3 subsequences
You are given an array ARR
containing N
positive integers. Your task is to reduce the size of this array to 1 by repetitively merging adjacent elements. Each...
Find the minimum cost to reduce an array to a single element by merging adjacent elements with their sum.
Iteratively merge adjacent elements to minimize total cost
Choose pairs to merge strategically to reduce cost
Calculate sum of adjacent elements and update array size
Round duration - 60 Minutes
Round difficulty - Medium
You are given an array arr
of length N
. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...
The task is to find the next greater element for each element in an array to its right, if no greater element exists return -1.
Use a stack to keep track of elements for which the next greater element is not found yet.
Iterate through the array from right to left, popping elements from the stack until a greater element is found.
Store the next greater element for each element in a separate array.
Tip 1 : Do some basic research about the interview process and types of rounds while appearing for a company interview. Narrow down the topics and draft a realistic plan afterwards.
Tip 2 : Try to solve as many problems as possible topic wise.
Tip 3 : Please cover the breadth of topics first to get an early estimate of strong and weak topics.
Tip 1 : Tailor your resume as per expectations from the role you are applying for.
Tip 2 : Order your experiences and skills by relevance.
Tip 3 : Try to fit the content in a single page.
Top trending discussions
I applied via Job Portal and was interviewed in Jun 2024. There were 3 interview rounds.
I don't remember the ques
Design a scalable notification system for sending real-time alerts to users.
Use a distributed system to handle high volume of notifications.
Implement message queues for asynchronous processing.
Utilize push notifications for mobile devices.
Include a user preference system for customizing notification settings.
Consider implementing a notification history feature for users to view past alerts.
Google Pay is a digital wallet platform and online payment system developed by Google.
Google Pay uses secure tokenization to protect user's payment information.
It integrates with various payment methods like credit/debit cards, UPI, and NFC.
The system handles transactions, user authentication, and merchant integrations.
Google Pay leverages Google's infrastructure for scalability and reliability.
It provides features lik
I appeared for an interview in May 2022.
I applied via LinkedIn and was interviewed in Jun 2024. There was 1 interview round.
The minimum cost to connect the ropes is calculated by repeatedly connecting the two smallest ropes until all ropes are connected.
Sort the ropes in ascending order.
Repeatedly connect the two smallest ropes.
Add the cost of connecting the two ropes to the total cost.
Continue this process until all ropes are connected.
The question asks for the maximum value of arr[i]+arr[j]+i-j for given array arr.
Iterate through all possible pairs of i and j in the array
Calculate the value of arr[i]+arr[j]+i-j for each pair
Keep track of the maximum value found
I appeared for an interview in Jun 2021.
Round duration - 60 minutes
Round difficulty - Medium
- It was a face to face (virtually) round.
- Two questions one after one and you are expected to pass all the test cases.
- Question was Easy and Medium Easy. (tags: stack, array, bfs, dfs, array)
- Timing: Afternoon
- Interviewer: he was nice, as I was able to solve both question, he was very happy, and given me the feedback.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters and return the newly formed string.
The task is to remove consecutive duplicate characters from a given string and return the new string.
Iterate through the characters of the string
Compare each character with the next character
If they are the same, skip the next character
If they are different, append the current character to the new string
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
The task is to find the number of islands present in a 2-dimensional array filled with ones and zeroes.
Iterate through each cell in the array
If the cell is land (1) and not visited, perform a depth-first search to find all connected land cells
Increment the count of islands for each connected component found
Round duration - 135 minutes
Round difficulty - Medium
Machine Coding.
Timing: Afternoon
The interviewer was answering my questions nicely.
Round duration - 60 minutes
Round difficulty - Medium
Hiring Manager.
Interviewer: Sr Engineering Manager.
Timing: evening.
The environment was cool.
Tip 1 : Stick to one coding platform either do it from geeks for geeks, coding ninja or leetcode. Never jump from one platform to other. Focus on Building the concept rather than solving it.
Tip 2 : Follow the Grooking the Object-Oriented Programming, and try to follow SOLID principle as much as you can. If possible take some MOCK interviews.
Tip 3 : Build your concept on Relational databases, you should be able to design the table structures and relationships.
Tip4: You should aware of your project and your contribution to it. Project Objective should be clear. You should know the tech stack used in project, and reason for choosing it.
Tip 1 : Don't write too many paragraphs in the project description, It should be pointwise.
Tip 2 : Don't highlight too many skills, like HTML CSS kind of things.
Tip 3 : One page.
Tip 4 : If you are not a fresher, no need to mention school achievements.
I applied via Walk-in and was interviewed before Apr 2020. There was 1 interview round.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
How to maintain control spillage
F&V stages refer to the different stages of fruits and vegetables from harvesting to consumption.
The first stage is harvesting, where the produce is picked from the plant.
The second stage is grading, where the produce is sorted based on quality and size.
The third stage is packaging, where the produce is packed for transportation and storage.
The fourth stage is transportation, where the produce is transported to the mar...
I applied via Recruitment Consultant and was interviewed before Dec 2019. There were 3 interview rounds.
Swiggy is an Indian food delivery company that operates through a website and mobile app.
Swiggy was founded in 2014 and is headquartered in Bangalore, India.
It partners with local restaurants to provide food delivery services to customers.
Swiggy's business model is based on charging a commission fee from the restaurants for every order placed through their platform.
It has expanded to over 500 cities in India and has ov...
I applied via Recruitment Consultant and was interviewed before Dec 2020. There was 1 interview round.
Community Operations Specialist
116
salaries
| ₹2.6 L/yr - ₹4.3 L/yr |
Key Account Manager
106
salaries
| ₹4 L/yr - ₹12 L/yr |
Store Manager
104
salaries
| ₹3.8 L/yr - ₹7 L/yr |
Procurement Manager
104
salaries
| ₹3.5 L/yr - ₹7 L/yr |
Delivery Boy
91
salaries
| ₹0.5 L/yr - ₹4.5 L/yr |
Swiggy
Zepto
Porter
Rapido