Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Dunzo Team. If you also belong to the team, you can get access from here

Dunzo Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Dunzo SDE-2 Interview Questions, Process, and Tips

Updated 15 Sep 2021

Dunzo SDE-2 Interview Experiences

1 interview found

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 15 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Container with Most Water Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

  • Q1. 

    Anagram Substring Search

    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.

    Input:

    ...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Maximum Size Rectangle Binary Sub-Matrix with All 1s

    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.

    Input:

    The first line c...
  • Ans. 

    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.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Number of Subsequences with Even and Odd Sum

    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...

  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Minimum Cost to Reduce Array Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Next Greater Element Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaPrior experience as SDEDunzo interview preparation:Topics to prepare for the interview - Data structures and algorithms, Databases, Design patterns, System design.Time required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 2 Apr 2015

Interview Questionnaire 

10 Questions

  • Q1. Find sum of all numbers that are formed from root to leaf path (code) expected time complexity O(n)
  • Ans. 

    Find sum of all numbers formed from root to leaf path in a binary tree

    • Traverse the binary tree using DFS

    • At each leaf node, add the number formed from root to leaf path to a sum variable

    • Return the sum variable

    • Time complexity: O(n)

    • Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25

  • Answered by AI
  • Q2. Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B C
  • Ans. 

    Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.

    • Use recursion to generate all possible combinations of spaces

    • For each recursive call, either add a space or don't add a space between the current character and the next character

    • Base case is when there are no more characters left to add spaces between

    • Time complexity is O(2^n) where n is the length of the string

  • Answered by AI
  • Q3. Preorder traversal without using recursion
  • Ans. 

    Preorder traversal without recursion

    • Use a stack to keep track of nodes

    • Push right child first and then left child onto stack

    • Pop top of stack and print value

    • Repeat until stack is empty

  • Answered by AI
  • Q4. There is a 12 km road and a contractor who is in-charge of repairing it. Contractor updates you about the work which is done in patches. Like “Road between 3.2 km to 7.9 km repaired ”, “Road between 1.21 k...
  • Ans. 

    Find longest continuous patch on a 12 km road with updates in patches

    • Maintain a variable to keep track of current patch length

    • Update the variable whenever a new patch is added

    • Maintain a variable to keep track of longest patch so far

    • Compare current patch length with longest patch length and update if necessary

    • Use a sorted data structure like a binary search tree to store the patches for efficient search

    • Time complexity: ...

  • Answered by AI
  • Q5. Several Questions were asked from my project
  • Q6. Find median of an unsorted array. (code
  • Ans. 

    Find median of an unsorted array.

    • Sort the array and find the middle element

    • Use quickselect algorithm to find the median in O(n) time

    • If the array is small, use brute force to find the median

  • Answered by AI
  • Q7. General discussion on heaps
  • Q8. A stream of characters is coming, at any moment you have to tell ‘k’ elements closest to a given number (code)
  • Ans. 

    Find 'k' elements closest to a given number from a stream of characters.

    • Use a priority queue to keep track of closest elements.

    • Update the queue as new characters come in.

    • Return the 'k' closest elements from the queue.

  • Answered by AI
  • Q9. Design data structure that supports insert(), remove(), find-max(), delete-max() operations. All operations should run in O(1) time. Lots of discussion was there, discussed many approaches.
  • Ans. 

    Design a data structure with O(1) insert, remove, find-max, and delete-max operations.

    • Use a doubly linked list to maintain the elements in sorted order.

    • Use a hash table to store the pointers to the nodes in the linked list.

    • Maintain a pointer to the maximum element in the hash table.

    • Update the pointers in the hash table when inserting or removing elements.

    • Update the maximum pointer when deleting or inserting the maximum

  • Answered by AI
  • Q10. Check whether given link list represents palindrome
  • Ans. 

    Check if a given linked list is a palindrome.

    • Traverse the linked list and store the values in an array.

    • Compare the first and last elements of the array, then move towards the center.

    • If all elements match, the linked list is a palindrome.

    • Alternatively, use two pointers to find the middle of the linked list and reverse the second half.

    • Compare the first half with the reversed second half to check for a palindrome.

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Recently I attended Amazon Bangalore interview for SDE 2 position. All f2f and no phone/written screening as I had attended one before and cleared those. Total 4 rounds wer der. The first techh round dey asked mi questions listed above.
Tips: NA

Round: Technical Interview
Experience: ROUND 2 dey asked mi above questions
Tips: NA

Round: Technical Interview
Experience: Round 3 Above questions wer asked.

Round: Technical Interview
Experience: This was the last round. thy asked mi above questions

College Name: NA

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Uber user image Anonymous

posted on 15 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Timing: evening
Environment: Online round took at home

  • Q1. 

    Smallest Subarray with K Distinct Elements Problem

    Given an array A consisting of N integers, find the smallest subarray of A that contains exactly K distinct integers.

    Input:

    The first line contains tw...
  • Ans. 

    Find the smallest subarray with exactly K distinct integers in an array.

    • Use a sliding window approach to keep track of the subarray with K distinct integers.

    • Use a hashmap to store the frequency of each integer in the current window.

    • Update the window size based on the number of distinct integers found.

    • Keep track of the smallest subarray meeting the criteria.

    • Return the starting and ending indices of the smallest subarray

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Medium

Machine coding round

Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Rat In a Maze Problem Statement

    Given a N * N maze with a rat placed at position MAZE[0][0], find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]. The rat is allowed to...

  • Ans. 

    The problem involves finding all possible paths for a rat to reach its destination in a maze.

    • Use backtracking to explore all possible paths in the maze.

    • Mark visited cells to avoid revisiting them.

    • Return the path once the destination is reached.

    • Handle edge cases like blocked cells and out-of-bounds movements.

  • Answered by AI
Round 4 - Face to Face 

Round duration - 60-90 minutes
Round difficulty - Medium

Round 5 - HR 

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager round

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNone as such. Only eligible criteria for SDE-2 role is that one should have prior experience working as SDEUber interview preparation:Topics to prepare for the interview - Data structures and algorithms, Design patterns, System design, DatabasesTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

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 as this is primarily what you will be doing in live interview rounds.

Application resume tips for other job seekers

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.

Final outcome of the interviewRejected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Uber user image Anonymous

posted on 15 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

It was a telephonic interview at 10 in the morning. Interviewer seemed cool.

  • Q1. 

    Best Insert Position for a Target in a Sorted Array

    You are provided with a sorted array A of length N consisting of distinct integers and a target integer M. Your task is to determine the position where ...

  • Ans. 

    Find the best insert position for a target in a sorted array to maintain order.

    • Use binary search to find the correct position for the target integer in the sorted array.

    • If the target is already present in the array, return its index.

    • Maintain the sorted order of the array after inserting the target integer.

    • Handle edge cases like empty array or target being smaller than the first element or larger than the last element.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interview was in the morning at 10 AM in the office meeting room.

  • Q1. 

    House Robber Problem Statement

    Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...

  • Ans. 

    House Robber problem - find maximum amount of money Mr. X can rob without triggering alarm in circular street.

    • Use dynamic programming to keep track of maximum money robbed at each house.

    • Consider two cases - robbing the first house and not robbing the first house.

    • Handle circular arrangement by considering the first and last houses separately.

    • Return the maximum amount of money that can be robbed without triggering the al

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 11 AM in the meeting office.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Calculate and print the median after each new integer is added to the stream.

    • Use a min heap to store the larger half of the numbers and a max heap to store the smaller half of the numbers.

    • Keep the two heaps balanced by ensuring the size difference is at most 1.

    • If the total number of elements is odd, the median is the top element of the larger heap. If even, it's the average of the tops of both heaps.

  • Answered by AI
Round 4 - Face to Face 

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 1 AM.

Round 5 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

The meeting was at 2 PM in the office meeting room.

Round 6 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

10 AM

  • Q1. Can you provide a deeper discussion about all the projects you completed in your previous company?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in HyderabadEligibility criteriaNoUber interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Graphs, Dynamic programming, Trees, stack, queue, System DesignTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be consistent in the preparation. Practice atleast one question everyday
Tip 2 : Make relevant notes that you can go through on the day before the interview
Tip 3 :Try to note your progress by giving timed contests

Application resume tips for other job seekers

Tip 1 : Clearly mention the details of the projects that are relevant to the company that you are applying for
Tip 2 : Ensure that there are no grammatical mistakes and that you have highlighted the important keywords in your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Find the sum of the least closest element to the left and the highest element to the right for each element of a array
  • Ans. 

    Find sum of least closest element to left and highest element to right for each element of an array

    • Iterate through array and find least closest element to left and highest element to right for each element

    • Calculate sum of these two elements for each element

    • Return array of sums

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare ds and algorithms

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

  • Ans. 

    Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

    • Use Breadth First Search (BFS) algorithm to find the shortest path from start to end cell.

    • Keep track of visited cells and the number of dice throws required to reach each cell.

    • Consider the presence of snakes and ladders while calculating the next possible moves.

    • Return the minimum number of dice throws to reach the last

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1.  Stack using queue

    Mvvm architecture

  • Ans. 

    Implement a stack using a queue in MVVM architecture

    • Use two queues to simulate a stack

    • Push operation: Enqueue the element to queue 1

    • Pop operation: Dequeue all elements from queue 1 to queue 2, dequeue the last element from queue 2 (which is the top of the stack)

    • Ensure proper synchronization between the two queues

    • Example: Push(1), Push(2), Pop() should return 2

  • Answered by AI
Round 3 - HR 

Round duration - 1hour
Round difficulty - Easy

Interview Preparation Tips

Eligibility criteriaNo year gapBig Basket interview preparation:Topics to prepare for the interview - Core Java, android topics , Hacker coding test , ecommerce domain knowledge, data structure , algorithmsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : be confident
Tip 2 : always say truth about your experience
Tip 3 : don't be nervous

Application resume tips for other job seekers

Tip 1 : mentioned project u worked on 
Tip 2 : technical skills

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jul 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

It was a problem solving round where a hackerrank link was given containing 2 questions.
You have to solve them within 90 minutes.
I was asked to solve it within a week.

  • Q1. 

    Find Distinct Palindromic Substrings

    Given a string 'S', identify and print all distinct palindromic substrings within it. A palindrome reads the same forwards and backwards. For example, 'bccb' is a pali...

  • Ans. 

    Given a string, find and print all distinct palindromic substrings within it.

    • Iterate through all possible substrings of the input string

    • Check if each substring is a palindrome

    • Store distinct palindromic substrings in a set and then sort them before printing

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

2 questions was asked by the interviewer. You have to clearly explain your approach and write a working solution. He even asked me to run on some additional test cases

  • Q1. 

    Job Sequencing Problem Statement

    You are provided with a N x 2 2-D array called Jobs consisting of N jobs. In this array, Jobs[i][0] represents the deadline of the i-th job, while Jobs[i][1] indicates the...

  • Ans. 

    Maximize profit by scheduling jobs within their deadlines.

    • Sort the jobs based on their profits in descending order.

    • Iterate through the sorted jobs and schedule them based on their deadlines.

    • Keep track of the maximum profit achievable by scheduling jobs within their deadlines.

  • Answered by AI
  • Q2. 

    Partition Equal Subset Sum Problem

    Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...

  • Ans. 

    The problem is to determine if it is possible to partition an array into two subsets with equal sum.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the subset sum possibilities.

    • Check if the total sum of the array is even before attempting to partition.

    • Iterate through the array and update the subset sum array accordingly.

    • Return true if the subset sum array contains a sum equal to hal

  • Answered by AI
Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

I was asked 1 system design question. The question was to design an online multiplayer game which can be scaled for more than 10 million users. 
The interviewer helped me to collect requirement and also helped me in choosing different low latency protocol to communicate between client and server.

Round 4 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interviewer asked few sql based questions and asked me to write the solution.
He also gave 1 problem solving question.

  • Q1. Can you explain the different types of joins in SQL and how to calculate the average of all values from a given table?
  • Ans. 

    Different types of joins in SQL and calculating average of values from a table.

    • Types of joins: INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL JOIN

    • To calculate average: Use AVG() function in SQL

    • Example: SELECT AVG(column_name) FROM table_name

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNAOla interview preparation:Topics to prepare for the interview - Linked List, Stacks, Queues, Tree, Graph, System Design, Dynamic Programming.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare Data Structures topic by topic and also solve at least 10 interview questions from each topic. The have a list of excellent questions. 
Tip 2 : For system design try to take few questions by yourself and think of what different scenarios can arise considering it as a distributed system. There are multiple topics like Consistent Hashing, Partition tolerance, Availability, Sharing etc which needs special attention. The interviewers will dig them deep and will try to see how much of it you actually understand. 
Tip 3 : Also please do focus on LLD. Sometimes they can ask you to write sample code for problems. Try solving 4-5 problems. 
Tip 4 : You should do and prepare properly 2 -3 projects and try deploying it. You will face a lot of new challenges which you do not face in normal day to day usage.

Application resume tips for other job seekers

Tip 1 : You can go for 1 page resume, though it is not necessary. Mention about your projects, your actual contribution, languages that you have used in that project etc. 
Tip 2 : You should always put your academic achievements. Sometimes it gains interviewers attention. 
Tip 3 : Make it a little bit colourful rather than plain white.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Apr 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 1 hour
Round difficulty - Medium

This was coding round and was conducted on Google meet with code link shared. Their were 2 interviewers that gave questions and later ran code on sample test cases.

  • Q1. 

    Print Permutations - String Problem Statement

    Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.

    Input:

    The first and only line of input ...
  • Ans. 

    Return all possible permutations of a given input string.

    • Use recursion to generate all possible permutations of the input string.

    • Swap characters at different positions to generate permutations.

    • Handle duplicate characters by skipping swapping if the characters are the same.

  • Answered by AI
  • Q2. 

    Find the Kth Row of Pascal's Triangle Problem Statement

    Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.

    Example:

    Input:
    K = 2
    Output:
    1 1
    Input:
    K = 4
    Output:
    1 4 6 ...
  • Ans. 

    The task is to find the Kth row of Pascal's Triangle given a non-negative integer K.

    • Create an array to store the elements of the Kth row of Pascal's Triangle.

    • Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate the elements.

    • Return the array as the output.

  • Answered by AI
Round 2 - Video Call 

Round duration - 2 hours
Round difficulty - Medium

This was a Machine Coding Round/LLD round followed by HLD round which was taken by Video Conferencing and Screen Sharing.

Round 3 - HR 

Round duration - 75 minutes
Round difficulty - Medium

This was the last round. This was HM round followed by the HR round.

Interview Preparation Tips

Professional and academic backgroundI completed Civil Engineering from Netaji Subhas University Of Technology. Eligibility criteriaPrior Work ExperienceOla interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Dynamic Programming, Aptitude, Computer Netwroks and System ArchitectureTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Solve previously asked questions. It tells you about the level of questions that the company asks. Check glass-door reviews it will help you to know what kind of questions company ask 
Tip 2 : Be real during the interview and don’t show off.
Tip 3 : Prepare for theory subjects like Object-Oriented Programming System, Database Management System, Computer networks, etc.

Application resume tips for other job seekers

Tip 1 : Keep your resume simple with all work experience mentioned.
Tip 2 : Any unwanted information on the resume leaves a bad impact on the interviewer.
Tip 3 : You should be prepared to explain anything that’s written on your resume.
Tip 4 : Keep it of 1 page or 2 pages only

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Blinkit user image Anonymous

posted on 20 May 2022

I was interviewed in May 2022.

Round 1 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

Timing was around 11 am
Environment was great, it intrigued me to join Blinkit.

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Sort the array in non-decreasing order.

    • Use two pointers approach to find pairs with sum equal to 'S'.

    • Return pairs in sorted order based on first value, with smaller second value coming first.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

Timing 11 am
Interviewer had good knowledge

  • Q1. Can you explain the activity lifecycle in Android development?
  • Ans. 

    Activity lifecycle in Android development involves various states like onCreate, onStart, onResume, onPause, onStop, onDestroy.

    • Activity is created with onCreate() method

    • Activity becomes visible with onStart() and onResume() methods

    • Activity goes into background with onPause() method

    • Activity is stopped with onStop() method

    • Activity is destroyed with onDestroy() method

  • Answered by AI
  • Q2. Can you explain the fragment lifecycle in Android development?
  • Ans. 

    Fragment lifecycle in Android involves various states like created, started, resumed, paused, stopped, and destroyed.

    • Fragments are created using the onCreateView() method.

    • Fragments go through states like created, started, resumed, paused, stopped, and destroyed based on user interactions and system events.

    • Fragment lifecycle methods include onCreate(), onStart(), onResume(), onPause(), onStop(), and onDestroy().

  • Answered by AI
  • Q3. Can you explain the MVVM pattern?
  • Ans. 

    MVVM is a design pattern that separates the user interface from the business logic and data model.

    • MVVM stands for Model-View-ViewModel

    • Model represents the data and business logic

    • View represents the UI components

    • ViewModel acts as an intermediary between the Model and View, handling user input and updating the Model

    • MVVM promotes separation of concerns and easier unit testing

  • Answered by AI
Round 3 - Face to Face 

Round duration - 30 Minutes
Round difficulty - Easy

This round is cultural fit round

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNoGrofers interview preparation:Topics to prepare for the interview - Data structures, Threading and synchronisation, Kotlin vs Java, Activities lifecycle, Fragment lifecycle, Android services, Reduce APK size, Create analytics libraryTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Prepare easy/medium level data structures questions in leetcode. Solve atleast 50 questions of multiple types like strings, arrays, tree, linked list, graph
Tip 2 : Go through Android basic questions like lifecycle, live data, MVC/mvp/ mvvm pattern, retrofit, data binding
Tip 3 : Atleast solve 5 design questions like how to build Instagram, analytics library, crashlytics

Application resume tips for other job seekers

Tip 1 : be concise 
Tip 2 : write only those keywords which you have in depth knowledge

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Paytm user image Anonymous

posted on 17 May 2022

I was interviewed in May 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

Anytime

  • Q1. 

    Problem: Sort an Array of 0s, 1s, and 2s

    Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.

    Input:

    The input sta...
  • Ans. 

    The task is to sort an array of 0s, 1s, and 2s in increasing order.

    • Use a three-pointer approach to partition the array into three sections: 0s, 1s, and 2s.

    • Initialize three pointers: low, mid, and high. low points to the start of the array, mid points to the current element being processed, and high points to the end of the array.

    • While mid <= high, if ARR[mid] is 0, swap ARR[low] and ARR[mid], increment low and mid. If

  • Answered by AI
  • Q2. 

    Connect Ropes with Minimum Cost

    Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of th...

  • Ans. 

    The task is to connect N ropes into one rope with minimum cost.

    • Sort the array of rope lengths in ascending order.

    • Initialize a variable to keep track of the total cost.

    • While there are more than one rope, take the two shortest ropes and connect them.

    • Add the cost of connecting the two ropes to the total cost.

    • Replace the two shortest ropes with the connected rope.

    • Repeat the above steps until only one rope remains.

    • Return th

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.

    Example of Sub...

  • Ans. 

    The task is to find the maximum possible sum of a non-empty subarray of an array.

    • Iterate through the array and keep track of the maximum sum encountered so far

    • If the current element is greater than the sum so far, start a new subarray

    • If the current element plus the sum so far is greater than the maximum sum, update the maximum sum

    • Return the maximum sum

  • Answered by AI
  • Q2. 

    Diameter of a Binary Tree Problem Statement

    Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...

  • Ans. 

    The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.

    • The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.

    • To find the diameter of a binary tree, we can use a recursive approach where we calcu...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

This round was more aroung sytem design and my past work experience.

  • Q1. Can you describe the system design for a platform like BookMyShow and the questions that were raised during the discussion?
  • Ans. 

    Design a bookmyshow system

    • Design a system to book and manage movie tickets

    • Consider features like seat selection, payment, and ticket cancellation

    • Include user authentication and authorization

    • Implement a database to store movie and theater information

    • Consider scalability and performance of the system

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This is non-tech round.They just want to check your nature ,attitude and team work skills.

  • Q1. Why do you want to leave your current job and what are your thoughts on the CTC being offered?
  • Ans. 

    I want to leave my current job for better growth opportunities and a more challenging role.

    • Seeking new challenges and opportunities for professional growth

    • Looking for a role that aligns better with my skills and interests

    • Desire to work in a more dynamic and innovative environment

    • Seeking better compensation and benefits

    • Wanting to expand my knowledge and skills in a different domain

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in NoidaEligibility criteriaFor SDE-2 the minium 2 year of work experience was required.Paytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - DSA, Trees and Graphs, System Design, LLD, OOPSTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Pratice DSA and focus on the core subject like Database and OS
Tip 2 : Practice atlest 2 question everday to maintain consistency.

Application resume tips for other job seekers

Tip 1 : Crisp Resume : Every body knows about this step, you must create a crisp resume mentioning about your key skills, always add impact numbers if possible (for example : increased efficiency by 50%, reduced cost by 2X, etc.) Add keywords around your skills, highlight them using BOLD in resume. 
Tip 2 : Use Linkedin : Send connections requests directly to the recruiters rather than asking for referrals.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Recently Viewed

JOBS

Browse jobs

Discover jobs you love

COMPANY BENEFITS

KNR Constructions

20 benefits

COMPANY BENEFITS

IRB Infrastructure

60 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

DESIGNATION

SALARIES

BARC

SALARIES

BARC

SALARIES

JUSPAY

SALARIES

Fynd

Tell us how to improve this page.

SDE-2 Interview Questions from Similar Companies

Amazon SDE-2 Interview Questions
4.1
 • 16 Interviews
Flipkart SDE-2 Interview Questions
4.0
 • 5 Interviews
Ola Cabs SDE-2 Interview Questions
3.4
 • 3 Interviews
Uber SDE-2 Interview Questions
4.2
 • 2 Interviews
Meesho SDE-2 Interview Questions
3.7
 • 2 Interviews
Zepto SDE-2 Interview Questions
3.5
 • 2 Interviews
Paytm SDE-2 Interview Questions
3.3
 • 1 Interview
View all

Dunzo SDE-2 Reviews and Ratings

based on 1 review

3.0/5

Rating in categories

4.0

Skill development

3.0

Work-life balance

3.0

Salary

2.0

Job security

3.0

Company culture

3.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Community Operations Specialist
116 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Store Manager
104 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Procurement Manager
104 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Delivery Boy
91 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Inward Executive
90 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Dunzo with

Swiggy

3.8
Compare

Zepto

3.5
Compare

Porter

3.9
Compare

Rapido

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview