Skip to content

Tag Archives: Dunzo

Round 1 (Coding Assessment): There were two questions that need to be solved in 90 mins. Questions were medium-hard level. One is based on DSA… Read More
Online Test: It had 2 questions. Not exactly remember the questions. but first was matrix question and 2nd was something modified knapsack.  I solved 2nd… Read More
Hackerrank Round: There were 3 questions in the test.  2 were DS Algo and 1 was to implement a function.  I don’t remember the questions… Read More
Online Assessment for SE2: 3 Question: Time 100 minutes Compute Before Matrix from the given After matrixhttps://stackoverflow.com/questions/65510354/matrix-summation-challenge Question-Related to: https://www.geeksforgeeks.org/max-sum-of-m-non-overlapping-subarrays-of-size-k Fetch Data from an API, with… Read More
Given an array, arr[] of size N, the task is to find the count of array indices such that removing an element from these indices… Read More
Hi Team, I wanted to share the Dunzo Interview experience with GFG. Location: Bangalore HackerRank Test: https://www.geeksforgeeks.org/sum-minimum-maximum-elements-subarrays-size-k/ kth-ancestor-of-a-tree-node Machine Coding: Write the working code to… Read More
Round 1: It was held oh hackerrank platform consist of 4 coding questions  in 1 hr and 50 minutes. Q1. https://www.hackerrank.com/challenges/cut-the-sticks/problem Q2. A string is… Read More
Round 1: Hacker Rank Given an array, arr, we want it to make it unique by incrementing any duplicate elements in arr such that the… Read More

Start Your Coding Journey Now!