Pattern Synthesis

dunzo Interview Patterns

Last logged: 1643 days ago

1 Reports

1 of 1 reports are Fresher/Intern-level; the rest cover senior and specialist tracks.

Target Role Track:

Select a role tab to isolate candidate logs

Technical Focus:Dynamic ProgrammingHeaps and Priority QueuesSliding Window and Two PointersBinary Trees and GraphsSorting and Searching Algorithms

Preliminary Data (N=1 Report Logged)

Derived from 1 submission for ALL. Format details may vary across different teams or locations.

AI Pattern Synthesis — All Roles Overview

{"overview": "Dunzo\u2019s hiring process for engineering roles emphasizes strong problem-solving skills, particularly in data structures and algorithms (DSA), with a focus on optimizing solutions and handling edge cases. The interview rounds are designed to assess both theoretical knowledge and practical application, often involving medium to hard-level Leetcode problems. Candidates who demonstrate resilience in tackling complex problems and a willingness to refine their approaches tend to perform better.", "by_role": {"SDE-1 / New Grad": "# SDE-1 / New Grad - Dunzo Interview Briefing\n\n## Overview\nThe SDE-1 / New Grad hiring process at Dunzo is rigorous, focusing on assessing a candidate's ability to solve medium to hard-level DSA problems efficiently. The rounds are structured to evaluate problem-solving skills, optimization techniques, and the ability to handle edge cases.\n\n## Rounds Breakdown\n\n### 1. Onsite Round-1 (DSA Problem-Solving)\n- Format: Technical questions based on the candidate's work experience.\n- Focus: Medium-level Leetcode problems.\n- Questions Asked:\n 1. Implement a solution using classes and objects with a min-heap-based approach.\n 2. Solve a problem using a simple sorting technique.\n\n### 2. Onsite Round-2 (Final Technical Round)\n- Format: Advanced DSA problem-solving.\n- Focus: Hard-level Leetcode problems with an emphasis on optimization and edge cases.\n- Questions Asked:\n 1. Max Sum of Rectangle No Larger Than K (Leetcode 363)\n 2. Arithmetic Slices II - Subsequence (Leetcode 446)"}}

Is this AI pattern synthesis accurate for dunzo?

Community-Sourced Reports (1)

Active Track: ALL

Summary Log:

The candidate faced two onsite technical rounds focused on DSA problem-solving. The first round included medium-level questions, while the second round was more challenging with hard-level questions. The candidate struggled with optimization and edge cases but realized after the interview that their approach was correct. The experience highlights the need for more practice in solving complex problems efficiently.

Reported Round Breakdown:

• Onsite Round-1More Onsite Round-1 questions

A DSA problem-solving round focused on technical questions based on the candidate's work experience. Two Leetcode medium-level questions were asked. The first involved implementing a solution using classes, objects, and appropriate data structures (min-heap). The second was a tricky problem solvable using sorting techniques.

Questions Logged:

Implement a solution using classes and objects with a min-heap-based approach.
Solve a problem using a simple sorting technique.

• Onsite Round-2 (Final Technical Round)More Onsite Round-2 (Final Technical Round) questions

A final DSA problem-solving round where the candidate was asked two Leetcode hard-level questions. The first question involved optimizing a brute-force approach for finding the max sum of a rectangle no larger than K. The second question was about finding arithmetic slices II in a subsequence, which the candidate attempted using an LIS-like approach but struggled with edge cases.

Questions Logged: