Dunzo LeetCode Interview Questions
Practice 41 real coding problems frequently asked in Dunzo technical interviews. Master these questions to ace your next Dunzo software engineering interview.
Top Topics at Dunzo
Ace your Dunzo interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Dunzo Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Bus Routes 100% | HardH | Solve→ |
Group Shifted Strings 99% | MediumM | Solve→ |
Number of Ships in a Rectangle 94% | HardH | Solve→ |
Reverse Nodes in k-Group 92% | HardH | Solve→ |
Longest Arithmetic Subsequence of Given Difference 89% | MediumM | Solve→ |
K-diff Pairs in an Array 86% | MediumM | Solve→ |
Interval List Intersections 81% | MediumM | Solve→ |
Capacity To Ship Packages Within D Days 80% | MediumM | Solve→ |
Largest Number 80% | MediumM | Solve→ |
Valid Word Abbreviation 75% | EasyE | Solve→ |
Longest Common Prefix 72% | EasyE | Solve→ |
Roman to Integer 70% | EasyE | Solve→ |
Nested List Weight Sum II 67% | MediumM | Solve→ |
Maximum Subarray 67% | MediumM | Solve→ |
Generate Parentheses 63% | MediumM | Solve→ |
Final Array State After K Multiplication Operations I 63% | EasyE | Solve→ |
Longest Increasing Subsequence 62% | MediumM | Solve→ |
Shortest Path in Binary Matrix 61% | MediumM | Solve→ |
Design an Ordered Stream 61% | EasyE | Solve→ |
Logger Rate Limiter 56% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 56% | MediumM | Solve→ |
Reverse Integer 54% | MediumM | Solve→ |
All O`one Data Structure 54% | HardH | Solve→ |
Flatten Binary Tree to Linked List 53% | MediumM | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 48% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Binary Tree Zigzag Level Order Traversal 47% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 45% | MediumM | Solve→ |
Design Hit Counter 45% | MediumM | Solve→ |
Goat Latin 44% | EasyE | Solve→ |
Boundary of Binary Tree 41% | MediumM | Solve→ |
Two City Scheduling 35% | MediumM | Solve→ |
Regular Expression Matching 33% | HardH | Solve→ |
Letter Combinations of a Phone Number 33% | MediumM | Solve→ |
Add Strings 31% | EasyE | Solve→ |
Palindrome Number 30% | EasyE | Solve→ |
Binary Search Tree Iterator 27% | MediumM | Solve→ |
Sort Colors 27% | MediumM | Solve→ |
Diagonal Traverse 25% | MediumM | Solve→ |
Remove All Occurrences of a Substring 24% | MediumM | Solve→ |
Move Pieces to Obtain a String 23% | MediumM | Solve→ |
Length of Last Word 23% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Dunzo ask in interviews?
Dunzo commonly asks 41 coding problems in technical interviews, including Bus Routes, Group Shifted Strings, Number of Ships in a Rectangle. The difficulty breakdown is 10 Easy, 26 Medium, and 5 Hard problems.
How should I prepare for a Dunzo coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Dunzo interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Dunzo coding interviews?
Based on our data, Dunzo interviews include 10 Easy (24%), 26 Medium (63%), and 5 Hard (12%) problems.
Ready to ace your Dunzo interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required