Upload Button Icon Add office photos

Directi

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Directi Software Developer Interview Questions, Process, and Tips

Updated 16 Jun 2024

Top Directi Software Developer Interview Questions and Answers

  • Q1. Duplicate Elements in Array You are provided with an array or list called ARR , consisting of N integers. These integers fall within the range from 0 to N - 1. Some elem ...read more
  • Q2. Leaf Nodes Retrieval from Binary Tree Given a binary tree, implement a function that returns a list of leaf nodes following their appearance from left to right. If leaf ...read more
  • Q3. Dijkstra's Algorithm Problem Statement Given an undirected graph with 'V' vertices (labeled 0, 1, ..., V-1) and 'E' edges, where each edge connects two nodes ('X', 'Y') ...read more
View all 9 questions

Directi Software Developer Interview Experiences

5 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Jun 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Given a set of questions to be solved within a given time frame.

Round 2 - One-on-one 

(3 Questions)

  • Q1. About myself and projects done during my academics
  • Q2. Various Oops concepts
  • Q3. DNS concepts -How does internet work? what happens when someone types a url in browser?

I was interviewed before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

It was problem solving round.
Questions revolve around solving problems in javascript.
Like deep flattened the array, print level wise elements of same problem.

  • Q1. 

    Occurrence of X in a Sorted Array Problem Statement

    Given a sorted array of integers of size N and an integer X, determine the total number of occurrences of X in the array.

    Input:

    The first line of the...
  • Ans. 

    Count occurrences of a given integer in a sorted array.

    • Use binary search to find the first and last occurrence of X in the array.

    • Calculate the total occurrences by subtracting the indices and adding 1.

    • Handle edge cases like X not present in the array.

    • Time complexity can be O(log N) using binary search.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

There were 2 problems, related to DS and Algorithms.

  • Q1. 

    Leaf Nodes Retrieval from Binary Tree

    Given a binary tree, implement a function that returns a list of leaf nodes following their appearance from left to right. If leaf nodes are equidistant from the left...

  • Ans. 

    Implement a function to retrieve leaf nodes from a binary tree in left-to-right order.

    • Traverse the binary tree in a depth-first manner, keeping track of leaf nodes encountered.

    • Store leaf nodes in a list while traversing the tree.

    • If leaf nodes are equidistant from the leftmost node, prefer the node at a lesser depth.

    • Return the list of leaf nodes in the order they appear from left to right.

  • Answered by AI
  • Q2. 

    Exclusive Time of Functions

    We are executing a program containing 'N' functions on a single-threaded CPU. Each function has a unique 'ID' between 0 and (N-1). Each time a function starts or ends, a log is...

  • Ans. 

    Calculate exclusive time of functions based on logs of function start and end times.

    • Parse the input logs to calculate exclusive time for each function ID.

    • Use a stack to keep track of function start times and calculate exclusive time when function ends.

    • Iterate through the logs and update exclusive time for each function ID accordingly.

  • Answered by AI
Round 3 - Face to Face 

Round duration - 60 Minutes
Round difficulty - Medium

Round 4 - Face to Face 

Round duration - 60 minutes
Round difficulty - Medium

Round 5 - Face to Face 

Round duration - 15 minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteria, good to have development projects on Github.DirectI interview preparation:Topics to prepare for the interview - Debouncing, Throttling, Pollyfills of mainly array functions. Redux store like arch for machine coding rounds, prototyping Nodejs engine.Time required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Develop a lots of projects with medium complexity [around 5-8].
Tip 2 : Develop projects using css, js html to practice machine coding round under time constraints
Tip 3 : Prepare mostly asked interview questions in JS.

Application resume tips for other job seekers

Tip 1: Keep resume only 1 page, don't keep your college at top of resume unless you are from tier 1 and good academic record [I keep at last , though from tier 1 college but poor academic record] .
Tip 2: Write projects, interns and what impact you made, don't waste lines about project.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Interview Preparation Tips

General Tips: Strong Coding Skills and basic computer Knowledge is a must. Make sure you are good in these. Basically they are looking for people with problem solving abilities.
Skills: Problem Solving Qualities
College Name: IIT KHARAGPUR

I was interviewed before May 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

This was a technical round.

  • Q1. 

    Duplicate Elements in Array

    You are provided with an array or list called ARR, consisting of N integers. These integers fall within the range from 0 to N - 1. Some elements in this array may appear more t...

  • Ans. 

    Identify duplicate elements in an array of integers within the range from 0 to N - 1.

    • Iterate through the array and keep track of seen elements using a hash set.

    • If an element is already in the set, it is a duplicate and can be added to the result.

    • Return the list of duplicate elements found in the array.

    • Example: For input [1, 3, 1, 3, 4], output should be ['1', '3'].

  • Answered by AI
  • Q2. 

    Find Triplets with Given Sum Problem Statement

    Given an array ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a given integer K.

    Explanation:

    ...
  • Ans. 

    The task is to find all distinct triplets in an array that sum up to a given integer.

    • Iterate through the array and use a nested loop to find all possible triplets.

    • Use a set to store unique triplets and avoid duplicates.

    • Check if the sum of the triplet equals the target sum.

    • Return the list of valid triplets or -1 if no such triplet exists.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

This was a technical interview round with questions on Programming and algorithms.

  • Q1. 

    Box Stacking Problem Statement

    Consider you are provided with 'n' different types of rectangular 3D boxes. For each type of box, you have three separate arrays: height, width, and length that define the d...

  • Ans. 

    The task is to stack different types of rectangular 3D boxes to achieve the maximum possible height.

    • Iterate through all possible rotations of each box type.

    • Sort the boxes based on their base dimensions in non-increasing order.

    • Use dynamic programming to find the maximum height achievable by stacking the boxes.

    • Consider the constraints while implementing the solution.

    • Example: For input [3, [4, 1, 4], [6, 2, 5], [7, 3, 6]]

  • Answered by AI
  • Q2. 

    Maximum Sum Subarray Problem Statement

    Given an array of integers, find the maximum sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Output:
    137
    Exp...
  • Ans. 

    Find the maximum sum of any contiguous subarray within an array in O(N) time complexity.

    • Use Kadane's algorithm to find the maximum sum subarray in O(N) time complexity

    • Initialize two variables: max_sum and current_sum to track the maximum sum subarray

    • Iterate through the array and update current_sum by adding the current element or starting a new subarray

    • Update max_sum if current_sum becomes greater than max_sum

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Medium

This was a difficult on to face as we have to hold phone and concentrate and explaining is also very difficult.

  • Q1. 

    Stock Buy and Sell Problem Statement

    Given an array/list 'prices' where the elements represent yesterday's stock prices at each minute, determine the maximum profit possible from a single buy and sell act...

  • Ans. 

    Given an array of stock prices, find the maximum profit from a single buy and sell action.

    • Iterate through the array and keep track of the minimum price seen so far and the maximum profit achievable.

    • Calculate the profit by subtracting the current price from the minimum price seen so far.

    • If the profit is negative, set it to 0 as we can't sell without buying first.

  • Answered by AI
  • Q2. 

    Dijkstra's Algorithm Problem Statement

    Given an undirected graph with 'V' vertices (labeled 0, 1, ..., V-1) and 'E' edges, where each edge connects two nodes ('X', 'Y') and has a weight that denotes the di...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in a graph.

    • Implement Dijkstra's algorithm to find the shortest path distances from node 0 to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Initialize distances to all nodes as infinity except for the source node which is 0.

    • Update distances to neighborin...

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a small interaction just to make us familiar in Mumbai office.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPADirecti interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Directi interview questions for designations

 Software Developer Intern

 (1)

 Software Engineer

 (2)

 Application Developer

 (3)

 Platform Engineer

 (1)

 IT Support Executive

 (1)

Software Developer Interview Questions & Answers

user image Kush Khandelwal

posted on 18 Jan 2017

I was interviewed in May 2016.

Interview Preparation Tips

Round: Algorithmic Round
Experience: You are given N ranges of the form [A,B]. Find all the ranges which occur atleast K times.

Round: Algorithmic Round
Experience: 1. Find the number of ways from reaching (1,1) to (N,M) when only right and down moves are allowed in O(N+M) complexity.
2. A row-wise and column-wise sorted matrix is given. Find an element in O(N+M) complexity.

Round: Algorithmic Round
Experience: 1. Check whether the given graph is bipartite or not.
2. Given a sorted array,find the longest sequence in AP.

Skills: Algorithm, Data Structures
College Name: NIT Allahabad

Get interview-ready with Top Directi Interview Questions

Interview questions from similar companies

I applied via Walk-in and was interviewed before Dec 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Basic Programming questions.
  • Q2. Fibonacci program
  • Q3. OOPS concepts.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basic OOPS concepts and basic programs.

Interview Questionnaire 

2 Questions

  • Q1. They asked me on java and I have joined as a fresher they not much questions as I got selected as fresher on oops concepts and collections
  • Q2. Please be confident while facing interview and they will check your communication skills

I was interviewed in Mar 2021.

Interview Questionnaire 

1 Question

  • Q1. .net core , mvc basics and some scripting language

Interview Preparation Tips

Interview preparation tips for other job seekers - Stick to basics , know about your current project . If interviewer asks you if you have to ask anything , do ask . For my case I asked for his advice where I need to improve. He answered genuinely and even came to know about my other technical skills .

Interview Questionnaire 

1 Question

  • Q1. Time management

Interview Questionnaire 

1 Question

  • Q1. Sql joins

Interview Preparation Tips

Interview preparation tips for other job seekers - go to google and search it
Contribute & help others!
anonymous
You can choose to be anonymous

Directi Interview FAQs

How many rounds are there in Directi Software Developer interview?
Directi interview process usually has 2 rounds. The most common rounds in the Directi interview process are One-on-one Round and Coding Test.
What are the top questions asked in Directi Software Developer interview?

Some of the top questions asked at the Directi Software Developer interview -

  1. DNS concepts -How does internet work? what happens when someone types a url in ...read more
  2. Various Oops conce...read more

Recently Viewed

INTERVIEWS

Publicis

No Interviews

INTERVIEWS

Eversendai

No Interviews

INTERVIEWS

Eversendai

No Interviews

INTERVIEWS

Publicis

No Interviews

INTERVIEWS

Eversendai

No Interviews

INTERVIEWS

Credgenics

No Interviews

INTERVIEWS

Birdeye

No Interviews

INTERVIEWS

Publicis

No Interviews

INTERVIEWS

Publicis

No Interviews

INTERVIEWS

Eversendai

10 top interview questions

Tell us how to improve this page.

Directi Software Developer Interview Process

based on 3 interviews

Interview experience

4
  
Good
View more
Directi Software Developer Salary
based on 9 salaries
₹8.4 L/yr - ₹30 L/yr
150% more than the average Software Developer Salary in India
View more details

Directi Software Developer Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

4.0

Skill development

4.0

Work-life balance

4.0

Salary

4.0

Job security

4.0

Company culture

4.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Software Development Engineer II
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Manager
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Directi with

Zoho

4.3
Compare

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

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