JustDial Deputy Manager Interview Questions and Answers

General questions and current affairs

Q1. Brief Introduction
Add your answer

Q1. About past experience
Add your answer

Q1. Participating Plan structure, ULIP V/S Trad., Why So many job changes
Add your answer
Q2. Relocation to Bhubaneswar
Add your answer
Q3. Local language mandatory check
Add your answer

Q1. Background verification and relieved letter or accepted Resignation mandatory before joining
Add your answer
Q2. How soon joining, Relocation assistance needed, Individual Role managing last sales teams
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.

Q1. 
Kth Largest Element Problem Statement
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Example:
Input:
Array: [2,1,5,6,3,8], K ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order

• Return the Kth element from the sorted array

• Handle multiple test cases
Answered by AI
Add your answer
Q2. 
Orange Rotting Problem Statement
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
• Value 0: Represents an empty cell.
• Value 1: Represents a fresh orang...read more
Ans. 
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
• Create a queue to store the rotten oranges and their time of rotting.

• Iterate through the grid to find the initial rotten oranges and add them to the queue.

• Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.

• Continue until the queue is empty, ke...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

This was a design round.

Round duration - 120 minutes
Round difficulty - Easy

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium levels. Time was enough and no sectional time was present. 1-2 MCQs on SQL was also present.

Q1. 
Boolean Matrix Transformation Challenge
Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...read more
Ans. 
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
• Iterate through the matrix to find elements with value 1

• Store the row and column indices of these elements

• Update the entire row and column for each element found to be 1
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was an online video interview round on HackerEarth with a simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class that required inheritance was asked by the interviewer to write. I was helped by the interviewer if I got stuck somewhere, Some questions on the implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.