AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Directi Interview Questions and Answers for Freshers
11 Interview questions
BSTs are binary search trees for sorted data, while tries are prefix trees for efficient string retrieval.
BST (Binary Search Tree) organizes data in a hierarchical structure with nodes having at most two children.
Trie (Prefix Tree) is used for storing strings where each node represents a character of the string.
In a BST, searching for a value takes O(h) time, where h is the height of the tree; in a trie, searching...
Given a string and pairs of indices, output the lexicographically smallest string after swapping characters.
Sort the pairs based on the first index in ascending order.
Use union-find data structure to keep track of connected components.
Swap characters in the string based on the connected components.
Return the lexicographically smallest string.
Output all edges in any shortest path from x to y in an undirected weighted graph
Use Dijkstra's algorithm to find all shortest paths from x to y
Store the predecessor of each vertex to reconstruct the paths
Output all edges in any of the shortest paths found
To find the country of an IP address from a CSV file, we can use a lookup table based on the IP address range.
Create a lookup table from the CSV file with IP address ranges and corresponding country codes
Parse the given IP address and match it with the ranges in the lookup table to find the corresponding country code
Use binary search for efficient lookup in the IP address ranges
Handle cases where the given IP addr...
The angle between the hour hand and minute hand of a clock can be calculated using a simple formula.
The angle between the hour hand and minute hand is given by the formula: |(30H - 11/2) - 6M| degrees
H is the hour hand position and M is the minute hand position
If the result is greater than 180 degrees, subtract it from 360 degrees to get the acute angle
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, one moving at twice the speed of the other
If there is a loop, the two pointers will eventually meet at some point
Alternatively, use a hash set to store visited nodes and check for duplicates
Merge Overlapping Intervals Problem Statement
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interva...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
Design a streaming service like Netflix and explain content onboarding process.
Create a user-friendly dashboard for content providers to submit new content.
Implement a review process to ensure quality and compliance with guidelines.
Use algorithms to categorize and recommend new content to users based on their preferences.
Negotiate licensing deals with production companies to acquire new content.
Regularly update th...
Postfix Expression Evaluation Problem Statement
Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expre...
Evaluate postfix expressions by applying operators after operands. Return result modulo (10^9+7).
Iterate through each character in the postfix expression
If character is an operand, push it onto the stack
If character is an operator, pop two operands from stack, apply operator, and push result back
Repeat until end of expression, return final result modulo (10^9+7)
Maximum Product Subarray Problem Statement
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
Explanation:
A subarray can be derived from the...
Find the contiguous subarray with the maximum product of elements in an array.
Iterate through the array and keep track of the maximum and minimum product ending at each index.
Update the maximum product by taking the maximum of current element, current element * previous maximum, current element * previous minimum.
Update the minimum product by taking the minimum of current element, current element * previous maximu...
Directi Interview Experiences for Freshers
7 interviews found
Selected
I applied via Walk-in and was interviewed in Feb 2023. There were 5 interview rounds.
Basic HR Round to get basic requirements of IT Manager
(2 Questions)
- Q1. One Round With Shift Leads to check your communication technical skills and behaviors
- Q2. Basic technical questions from Port number to scenario
(1 Question)
- Q1. Final round with Team Manager, He mostly repeats the questions and focuses on a questions which you were not able to answer in the shift lead round to know if you are hungry for knowledge or not
(1 Question)
- Q1. If you are applying for a higher position then the IT Project manager comes into the scene, And their questions are based on your profile but this will be very technical
Interview Preparation Tips
Focus on technical accurate answers rather than English communication as 90% of the crowd will speak with you in local languages rather than English. Yes, But English communication will get the higher package.
I applied via Recruitment Consulltant
It was a clear job and I managed to do well with the guidelines presented. This is not a real review because theyre forcing me to write one
None at all of course this is all nonsense because I want to read reviews so I need to write this crap
The coding test was just terrific easy and manageable all in all a good experience
Interview Preparation Tips
I appeared for an interview in Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
There were 2 coding questions. All of them were pretty easy and solvable in less than 40 minutes. Some string and pattern matching + some number theory problems were there.
- Q1.
Maximum Product Subarray Problem Statement
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
Explanation:
A subarray can be derived from th...
- Ans.
Find the contiguous subarray with the maximum product of elements in an array.
Iterate through the array and keep track of the maximum and minimum product ending at each index.
Update the maximum product by taking the maximum of current element, current element * previous maximum, current element * previous minimum.
Update the minimum product by taking the minimum of current element, current element * previous maximum, cu...
- Q2.
Postfix Expression Evaluation Problem Statement
Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expr...
- Ans.
Evaluate postfix expressions by applying operators after operands. Return result modulo (10^9+7).
Iterate through each character in the postfix expression
If character is an operand, push it onto the stack
If character is an operator, pop two operands from stack, apply operator, and push result back
Repeat until end of expression, return final result modulo (10^9+7)
(3 Questions)
Round duration - 60 minutes
Round difficulty - Hard
This was a technical round. First after properly introducing ourselves(me and the interviewer), we started with the main interview. I was asked 2 questions, one DS and Algorithms and the other System Design question.
- Q1.
Problem Statement: Sibling Nodes
You are provided with a Binary Tree consisting of 'N' nodes, where each node holds an integer value. Your objective is to identify and list all nodes that do not possess a...
- Ans.
Identify and list nodes in a Binary Tree that do not have a sibling.
Traverse the Binary Tree in level order to identify sibling nodes.
Keep track of nodes without siblings and output them in ascending order.
Handle cases where nodes have only one child or no children.
Consider the root node as a sibling node.
Sort the output list of nodes without siblings in ascending order.
- Q2.
Merge Overlapping Intervals Problem Statement
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
- Ans.
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
- Q3. Design a streaming service similar to Netflix and explain how it onboard new content.
- Ans.
Design a streaming service like Netflix and explain content onboarding process.
Create a user-friendly dashboard for content providers to submit new content.
Implement a review process to ensure quality and compliance with guidelines.
Use algorithms to categorize and recommend new content to users based on their preferences.
Negotiate licensing deals with production companies to acquire new content.
Regularly update the lib...
Interview Preparation Tips
Tip 1 : Make sure to solve the most recommended problems of LeetCode. Around 200 will do
Tip 2 : Be confident with your basics of chapters from Operating Systems and DBMS or SQL Queries.
Tip 3 : Have a slight knowledge of system designing concepts.
Tip 1 : Make your Resume such that it is properly readable. Keep it of one page. If it exceeds try your best to include only the most important highlights.
Tip 2 : Put your most important achievements at the top and after than the not so important ones. You want the interviewer to see them first.
Skills evaluated in this interview
Mohit Gupta
I appeared for an interview in Dec 2017.
Interview Preparation Tips
Experience: 1) 2D dp question
2) prim's algorithm
3) 3D dp question
Tips: need to solve all 3 question to get shortlisted.
22 students shortlisted
Round: Technical Interview
Experience: Online Skype Round
Round: Technical + HR Interview
Experience: This was the worst round because it was the skype round and there was communication problem. The interview started with summer intern project discussion and I required
to draw some diagrams to explain him and it was really difficult to explain him through the poor communication but he somehow got the idea of project.
He asked there are 2 type of transactions in bank credit and debit, He asked how will you model the total amount of money available at bank..(Threading question based
on syncronisation) he asked me to do in JAVA but I told him that I know c++ only, he told me to build in c++ but he wasn't seems to be satistfied fully however he said
its alright.
Then he gave me real confusing problem ---> we are given a huge data of points in 2D points and this point can be floating points. Now you are given queries where you are given a rectangle and you need to output the
all the points inside that rectangle.I proceeded by making buckets in x-axis and then for each bucket along x axis,(I further bucketed along the y-axis, he also helped me a bit in that. )
Then he told he was done and if I had any question- I asked how the team is decided and what is general strength of team and how to switch(15 min discussion.)
I thought that I did fine but may be CV and branch was the weak point as directi is very selective but very few reached the final round, they selected only 2 students but
really good company to work in
College Name: IIT Guwahati
Interview Questionnaire
12 Questions
- Q1. Suppose you are given a string of length n and a set of pairs(i, j such that 0 <= i < j < n). Pair “i, j” (0 based indexing) means that you can swap the i’th and j’th character in the string any number of ...
- Ans.
Given a string and pairs of indices, output the lexicographically smallest string after swapping characters.
Sort the pairs based on the first index in ascending order.
Use union-find data structure to keep track of connected components.
Swap characters in the string based on the connected components.
Return the lexicographically smallest string.
- Q2. Suppose there are two piles of plates in the table. One has ‘m’ RED plates and other has ‘n’ BLACK plates. In his/her chance, a player can either pick any number of red plates or any number black plates or...
- Q3. Suppose there are ‘n’ trees (literal trees, not trees of computer science, suppose they don’t have any branch, more like a straight stick), each of them have some height. We want x length of wood. We have ...
- Q4. You have an undirected weighted graph, given input ‘x’ and ‘y’, which are any two vertices of the graph, you have to output all the edges that are in any of the shortest path from x to y. Note that there c...
- Ans.
Output all edges in any shortest path from x to y in an undirected weighted graph
Use Dijkstra's algorithm to find all shortest paths from x to y
Store the predecessor of each vertex to reconstruct the paths
Output all edges in any of the shortest paths found
- Q5. About any of my self-projects
- Q6. Advantages and disadvantages of BST and hashing. Questions related to collisions in hashing etc
- Q7. A question related to databases, he asked me to make a query
- Q8. Formulate the angle between the hour hand and minute hand of the clock for any given time
- Ans.
The angle between the hour hand and minute hand of a clock can be calculated using a simple formula.
The angle between the hour hand and minute hand is given by the formula: |(30H - 11/2) - 6M| degrees
H is the hour hand position and M is the minute hand position
If the result is greater than 180 degrees, subtract it from 360 degrees to get the acute angle
- Q9. Suppose we have a huge CSV file having ip-address ranges and its corresponding country code, given any ip-address how will we find the country which it belongs to
- Ans.
To find the country of an IP address from a CSV file, we can use a lookup table based on the IP address range.
Create a lookup table from the CSV file with IP address ranges and corresponding country codes
Parse the given IP address and match it with the ranges in the lookup table to find the corresponding country code
Use binary search for efficient lookup in the IP address ranges
Handle cases where the given IP address f...
- Q10. Difference between BST and tries
- Ans.
BSTs are binary search trees for sorted data, while tries are prefix trees for efficient string retrieval.
BST (Binary Search Tree) organizes data in a hierarchical structure with nodes having at most two children.
Trie (Prefix Tree) is used for storing strings where each node represents a character of the string.
In a BST, searching for a value takes O(h) time, where h is the height of the tree; in a trie, searching for ...
- Q11. He asked few questions from Network course and OS course
- Q12. You have a huge linked list, how will you detect any loop in the linked list
- Ans.
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, one moving at twice the speed of the other
If there is a loop, the two pointers will eventually meet at some point
Alternatively, use a hash set to store visited nodes and check for duplicates
Interview Preparation Tips
Experience: There were 2 questions. Question 1 had 2 points whereas question 2 had 1 point.
Question 1. There is a compressed string eg. ”ab2c3”, the string has lowercase characters and numbers. We can uncompress the given string as follows: whenever we get a number “n” in the string, the portion of the string before the number will repeat “n” times. So in the above example, we get a 2, so string will become “ababc3”, now we get a 3, so final string will be “ababcababcababc”.
Given a compressed string and a number k, you have to output the k’th character in the uncompressed string.1 <= length of string <= 1500
1 <= n <= 1000
1 <= k < 2^31
example:
input: ab2c3 10
output: c
Question 2. There is a string whose characters can only be either ‘a’, ‘b’ or ‘_’ (there can be only one ‘_’ in the string). At each step, we can modify the string as follows:
1. ‘_’ can be swapped with its adjacent character, example “a_ba” can be changed to either “_aba” or “ab_a”.
2. Two characters adjacent to ‘_’ (both on the same side of ‘_’) can be reversed along with the ‘_’ if both characters are different, example, “aa_ba” can be changed to “aaab_” but not to “_aaba” because both characters are ‘a’.
You are given two strings, the initial state and the final state (lengths will be same), you have to output the minimum number of steps required to change the string in initial state to the string in the final state.
example:
input: a_b ab_
output: 1
input: abaa_a b_aaaa
output: 4
reason for example 2:- abaa_a -> aba_aa -> ab_aaa -> _baaaa -> b_aaaa
Hint: Use Breadth first searchThey shortlisted 12 students after this contest for the next round.
Total Questions: 02
Round: Technical Interview
Experience: Question 1. Suppose you are given a string of length n and a set of pairs(i, j such that 0 <= i < j < n). Pair “i, j” (0 based indexing) means that you can swap the i’th and j’th character in the string any number of times. You have to output the lexicographically smallest string that can be produced by doing any number of swaps on the input string.
example:input: zcxfbe
0, 1 0, 2 3, 5
output: cxzebfHint: Try to model the problem to a graph problem.
Question 2. Suppose there are two piles of plates in the table. One has ‘m’ RED plates and other has ‘n’ BLACK plates. In his/her chance, a player can either pick any number of red plates or any number black plates or equal number of red and black plates. A player loses if he cannot make a move in his/her chance. You are playing this game with your friend. Given that you begin the game and both the players play optimally, output ‘L’ if you will lose or ‘W’ if you will win.
example:
input: m = 1, n = 2
output: L
input: m = 2, n = 2
output: W
After this round, they selected 4 people for the next round of interview.
General Tips: Tips:1. There main focus was on string and graph, prepare well for them.2. Practice your codes on paper or google doc, you will not get any editor for coding.3. Keep your concepts clear on all the topics, they can ask you about any minute detail of any data structure or algorithm.
College Name: NA
Skills evaluated in this interview
Samarth Gupta
I appeared for an interview in Aug 2017.
Interview Preparation Tips
Experience: Questions based on Data Structures, Algorithms
Tips: Practice Competitive Programming
Duration: 1 hour 20 minutes
Total Questions: 2
Round: Technical Interview
Experience: Algorithm Round. One problem was asked and I needed to code it on paper.
Tips: Practice Competitive Programming
Round: Technical Interview
Experience: Algorithm Round. One problem was asked and I needed to code it on paper.
Tips: Practice Competitive Programming
Round: Technical Interview
Experience: Questions based on Operating System, Computer Networks, Databases, Object Oriented Programming were asked.
Tips: Prepare basics of CS subjects
Round: Technical Interview
Experience: Design Based questions were asked
Tips: Go through a few design based questions and answers
College Name: Fr. Conceicao Rodrigues College Of Engineering
Interview Preparation Tips
Experience: General Aptitude + technical questions (C, OOP, DBMS)Aptitude questions (with a few exceptions)were easy, technical questions were of moderate difficulty. C questions like recursive functions, finding output of some code etc.,15 x 1 mark, 10 x 3 marks and 3 x 10 marks questions and 1mark=1min1 mark questions were very simple…For 3 marks questions little bit thinking is necessary but easy ones… like matching kind of questionso 10 marks questions contains puzzles for e.g.: bulbs on/off, probability based questions Eg 1) Given a binary tree, such that each node contains a number. Find the maximum possible sum in going from one leaf node to another. 2) Suppose you have some guests arriving at a party. For each guest, you are given the arrival and departure time. When a guest arrives he is given a wine glass and when he leaves he returns that wine glass (it becomes available to be given to another guest). Find the minimum number of wine glasses needed to serve all the guests. The arrival and departure team can only be between 1800 to 2359 hours.
Round: Technical Interview
Experience: Round 1 Technical ::• The first round was algos round• Panel consisted of one interviewer• He asked me to tell him about myself• Then, he asked if I had passion for something. I talked about web development and we had a very long discussion on many web
technologies, protocols, interoperability, vendor locking, cloud storage, cloud computing, web OSes, domains, DNS, server technologies, web databases. This is where I scored huge points in my interview.• Then he asked very simple questions on merging two sorted arrays, finding the kth element in two sorted arrays, permutations of merging two series such that their relative order is maintainedEg ::1) Suppose you have strings like A, B…, Z, AA, AB, ….AZ and so on. This is similar to the way the columns of excel are named. Given a number you have to find the corresponding string. (e.g. 27 would map to AA). I had to give the algorithm and write the pseudo code for this.2) Given n biased coins, with each coin giving heads with probability Pi, find the probability that on tossing the n coins I will obtain exactly k heads. I had to write the formula for this (i.e. the expression that would give us P (n, k)).3) Given n positive real numbers, find whether there exists a triplet among this set such that, the sum of the triplet is in the range (1, 2). Do it in linear time and O (1) space..
Round: Technical Interview
Experience: Roound 3 Technical Interview • This was my longest (105 minutes) and toughest interview yet.• Q1: Given an array AA = { 4 0 0 3 6 5 4 7 1 0 1 2 }
You start at the first element. From here, you can jump as many places ahead as the value of the cell you are at. E.g. from the initial 4, you can jump to 0, 0, 3 and 6. You are stuck if you end up at a 0. Give an efficient algorithm to find the path with minimum jumps from start of the array to the end. (Note: the most obvious solutions are not the best ones)
• + is string concatenation operator
a1 = “()”
a2 = “(“ + a1 + “)”
a3 = “(“ + a1 + a2 + “)”
a4 = “(“ + a1 + a2 + a3 + “)”
.
.
an = “(“ + a1 + a2 + a3 + …….. + an-1 + “)”
Given n and p, find which bracket would come at pth position in an.• He asked how much programming experience I had, what all programming languages I knew, if I had studied DBMS. Then he asked me questions on javascript, PHP, mySQL.• Then there were questions on OS (like multithreading) and networks (OSI model, TCP/IP model, DNS functioning, IMAP, POP
protocols, encryption etc)• Questions on data structures (difference between trees and hash tables), their applications.Eg :::The length and breadth of my knowledge regarding Databases, networks and data structures was tested. Some of the questions asked were:What are relationships? How are they represented in a database?
What is indexing? Explain it with an example.
What is a hash table?
What is an IP address?
What is a MAC address?
If a MAC address exists why do we need an IP address?
Give the use cases of binary tree?
What is the advantage of an M-ary tree over binary tree?
Given the different prices of a stock over a time period, find the maximum profit that a person can make by buying and selling the stock within the given time period. The number of such entries can run into millions, so time complexity is important. E.g. the prices are 70, 60,100,150,110. The maximum possible profit in this case is (150-60=90).Special Part ::This was the end of the telephonic interview. Probably he was in two minds after this because I was called again after 10 minutes, and two quick questions were asked:How can I contribute to Directi?
What exactly did I do in my internship and how did I benefit my team?
Why I chose ECE if I was so much interested in computer science.
In the end, he gave feedback of how did in the interview and told that I’ll be informed of result later by the HR.But i think The response to these two questions sealed the deal and I was ‘hired’ by Directi .
Tips: Students spend majority of their time doing problems related to data structures and algorithms. However most of students ignore the other core CS subjects. You MUST devote equal time to these subjects, because almost all companies require you to possess a solid understanding of the basic fundamentals of Operating Systems, Databases, Networks, Classes (depending on the profile they are hiring you for).. The way you express yourself is really important. If you are unable to express yourself clearly or lack enthusiasm organizations would see that as a potential red flag. If you are weak in English, practice speaking in front of a mirror (believe me, it helps) or still better give mock interviews to your friends Think out aloud. Whatever idea comes to your mind, share it with the interviewer. Always start by giving a brute force solution to the problem (it helps the interviewer know that you have understood the problem).. Don’t give up on a problem until the last moment. Keep on discussing things with the interviewer; he will give you hints if you are on the right path. CSE guyz might be asked networks, DBMS also.Good problem solving/analytical skills are required.Most of all, passion/zeal for something (like web development in my case) is looked for in applicants.Candidates are expected to know a little bit of everything, but superficial knowledge won’t work.Some experience of working with websites/web apps will be a huge plus.
College Name: BITS PILANI
Top trending discussions
Interview questions from similar companies
I applied via Naukri.com and was interviewed before Mar 2020. There were 4 interview rounds.
Interview Questionnaire
4 Questions
- Q1. Difference between Hashtable and hashmap?
- Ans.
Hashtable is synchronized while hashmap is not.
Hashtable is thread-safe while hashmap is not.
Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.
Hashtable is slower than hashmap due to synchronization.
Hashtable is a legacy class while hashmap is a newer implementation.
- Q2. Difference between hashmap and concurrent hashmap?
- Ans.
Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.
Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.
Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.
Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.
Concurrent Hashmap is slower than Hashma...
- Q3. Jdbc step
- Q4. Spring ioc
Interview Preparation Tips
Skills evaluated in this interview
I applied via Naukri.com and was interviewed before Sep 2020. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. IOS Basics , iPhone programming
Interview Preparation Tips
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
- Q2.
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...
- Ans.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
- Q3.
Maximum Path Sum Between Two Leaves Problem Description
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
- Ans.
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
- Q1.
N-th Node From The End Problem Statement
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
Example:
Input:
If the given list is (1 -> -2 -&g...
- Ans.
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
- Q2.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
- Q3.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
- Q1.
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
- Ans.
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
- Q2. What is grammar in the context of compiler design?
- Ans.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
- Q3. What is a token in compiler design?
- Ans.
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
- Q1.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
- Q2. What is a regular language?
- Ans.
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
- Q3. What are NP and NP-Hard problems?
- Ans.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Directi Interview FAQs
Some of the top questions asked at the Directi interview for freshers -
Tell us how to improve this page.
Directi Interviews By Designations
- Directi Software Developer Interview Questions
- Directi Application Developer Interview Questions
- Directi Software Engineer Interview Questions
- Directi Product Manager Interview Questions
- Directi Applications Engineer Interview Questions
- Directi IT Support Executive Interview Questions
- Directi Platform Engineer Interview Questions
- Directi Intern Interview Questions
- Show more
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
|
Softwaretest Engineer
15
salaries
|  ₹6.8 L/yr - ₹24 L/yr |
|
Software Developer
15
salaries
| ₹10.5 L/yr - ₹30 L/yr |
|
Senior Software Engineer
13
salaries
| ₹25 L/yr - ₹57 L/yr |
|
Software Development Engineer II
13
salaries
| ₹21.5 L/yr - ₹49.5 L/yr |
|
Product Manager
11
salaries
| ₹19.4 L/yr - ₹51 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant
- Home >
- Interviews >
- Directi Interview Questions >
- Directi Interview Questions for Fresher
