Dunzo | SWE- II | Bangalore | Jun 2022 [Rejected]

dunzo logo
dunzo
SWE - IIBangalore, IN3 yearsRejected
August 24, 20220 reads

Summary

I interviewed for a SWE-II position at Dunzo in Bangalore in June 2022. Unfortunately, I was rejected as I couldn't provide an optimal solution for one of the problem-solving questions during the second round.

Full Experience

My interview process for the SWE-II role at Dunzo consisted of two rounds.

The first round focused on System Design. I was asked to provide both High-Level Design (HLD) and Low-Level Design (LLD) for Instagram, including relevant UML diagrams. I felt comfortable with this round.

The second round was purely focused on Problem Solving. I was given two LeetCode problems: 'Perfect Squares' and 'Nearest Exit from Entrance in Maze'. While I tackled the second problem, I struggled to provide an optimal answer for 'Perfect Squares'. This ultimately led to my rejection.

Interview Questions (3)

Q1
System Design: Instagram
System Design

Design the Low-Level Design (LLD) and High-Level Design (HLD) for Instagram, including UML diagrams.

Q2
Perfect Squares
Data Structures & AlgorithmsMedium

Given an integer n, return the least number of perfect square numbers that sum to n. A perfect square is an integer that is the square of an integer; for example, 1, 4, 9, and 16 are perfect squares. while 3 and 11 are not.

Q3
Nearest Exit from Entrance in Maze
Data Structures & AlgorithmsMedium

You are given an m x n matrix maze (0-indexed) with empty cells ('.') and walls ('+'). You are also given the entrance of the maze, where entrance = [entrancerow, entrancecol] denotes the row and column of the cell you are currently in. You want to find the nearest exit from the entrance. An exit is defined as an empty cell that is at the border of the maze. The entrance does not count as an exit. Return the number of steps in the shortest path from the entrance to the nearest exit, or -1 if no such path exists.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!