Upload Button Icon Add office photos

Directi

Compare button icon Compare button icon Compare

Filter interviews by

Directi Interview Questions, Process, and Tips

Updated 16 Jun 2024

Top Directi 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
    asked in Software Developer interview
  • Q2. 2)Given an n x n matrix, where every row and column is sorted in increasing order. Given a number x, how to decide whether this x is in the matrix. The designed algorithm ...read more
    asked in Software Engineer interview
  • Q3. Algorithms: Write an algorithm to list elements of a Fibonacci series; There are two unsorted arrays (with no repeating elements) – find the median of the combined array ...read more
    asked in Product Manager interview
View all 71 questions

Directi Interview Experiences

Popular Designations

22 interviews found

Interview Questions & Answers

user image Prabhu

posted on 10 Nov 2015

Interview Questionnaire 

19 Questions

  • Q1. What is HTTP and why it is used?
  • Q2. What is cookies and why it is used?
  • Q3. Why dont we store cookies details in server instead of storing in client system?
  • Ans. 

    Storing cookies on the client system allows for personalized user experiences and reduces server load.

    • Storing cookies on the client system allows for faster access to user data without the need to constantly query the server.

    • Cookies can store user preferences and login information, making the browsing experience more personalized.

    • Server-side storage of cookies would require more server resources and could slow down the...

  • Answered by AI
  • Q4. Tell me About yourself?
  • Ans. 

    I am a highly motivated and experienced professional with a strong background in project management and team leadership.

    • Over 10 years of experience in managing complex projects and leading cross-functional teams.

    • Proven track record of delivering projects on time and within budget.

    • Expertise in strategic planning, risk management, and stakeholder communication.

    • Strong problem-solving and decision-making skills.

    • Excellent c...

  • Answered by AI
  • Q5. Significance of thread over process?
  • Ans. 

    Threads provide a lightweight way to achieve multitasking within a process.

    • Threads share the same memory space, while processes have separate memory spaces.

    • Threads are faster to create and terminate compared to processes.

    • Threads allow for efficient communication and synchronization between different parts of a program.

    • Threads are commonly used in applications that require concurrent execution, such as web servers or mu...

  • Answered by AI
  • Q6. I can run concurrent process. then why should i use threads?
  • Ans. 

    Threads allow for more efficient use of resources and better performance compared to running concurrent processes.

    • Threads are lighter weight than processes, requiring less overhead to create and manage.

    • Threads share the same memory space, allowing for easier communication and data sharing between threads.

    • Threads are more efficient for tasks that require frequent communication or synchronization.

    • Threads are commonly use...

  • Answered by AI
  • Q7. Semaphores?
  • Q8. Is parallelism possible in merge sort using threads?
  • Q9. Int x=5; fun() {x++;} if 3 threads run this function and am reading x at last, what will be value of x?
  • Ans. 

    The value of x will depend on the execution order of the threads.

    • The function fun() increments the value of x by 1.

    • If all three threads run the function concurrently, the final value of x will be 8.

    • If the threads run sequentially, the final value of x will be 7.

  • Answered by AI
  • Q10. What is index & why we are using it in Database?
  • Q11. Write query to find 3rd highest mark of students in student table with name and marks? Then he asked my favourite language and replied “OOPS­C++”
  • Q12. What is purpose of virtual keyword?
  • Ans. 

    The virtual keyword is used in object-oriented programming to indicate that a method or property can be overridden in a derived class.

    • The virtual keyword allows for polymorphism, where a derived class can provide its own implementation of a method or property inherited from a base class.

    • It enables the concept of dynamic dispatch, where the appropriate method implementation is determined at runtime based on the actual t...

  • Answered by AI
  • Q13. What is inheritance and why using it?
  • Q14. What is polymorphism and why using it?
  • Q15. What is overloading and why using it?
  • Q16. Can we implement overloading using different return types of function and Why?
  • Ans. 

    No, we cannot implement overloading using different return types of function.

    • Overloading is based on the number and types of parameters, not the return type.

    • If we have two functions with the same name and parameters but different return types, it will result in a compilation error.

    • Return type alone is not sufficient to differentiate between overloaded functions.

  • Answered by AI
  • Q17. What is overriding and why using it? again to networks
  • Ans. 

    Overriding is a concept in object-oriented programming where a subclass provides a specific implementation of a method that is already provided by its superclass.

    • Overriding allows a subclass to provide a specific implementation of a method that is already defined in its superclass.

    • It is used to achieve runtime polymorphism in object-oriented programming.

    • The method in the subclass must have the same name, return type, a...

  • Answered by AI
  • Q18. Explain sliding window protocol?
  • Ans. 

    Sliding window protocol is a technique used in computer networks to ensure reliable and efficient data transmission.

    • Sliding window protocol is used to manage the flow of data between sender and receiver in a network.

    • It divides the data into small packets and assigns a sequence number to each packet.

    • The sender sends a fixed number of packets and waits for acknowledgment from the receiver before sending more packets.

    • If a...

  • Answered by AI
  • Q19. Then he asked me to explain my projects

Interview Preparation Tips

Round: Test
Experience: 1.Given a no. ‘n’, find posible no. of smart strings and input alphabet is a to z(26 chars).Smart string means a string after applying following changes, resulting string is same as the original
string. smart string: given a string of size n, reverse it and again reverse it excluding the end chars at position 1 and n. Now again reverse it excluding next to end chars at 2 and n-1. continue this till you reach middle of string. eg. consider string “abcdcea”, aftet 1st reverse: “a ecdcb a”, after 2nd reverse: “ab cdc ea”, after 3rd reverse : “abc d cea”. now we reached middle of string and resulting string is same as
original string. so it is smart. after analysing the pattern i got the solution for this.
2. given a stack , i want to access the max element in O(1). it is easy one. use 2 stacks.
3. given an array of numbers containing positive and negative numbers, return the no. of contiguous subsequences which sum to 0.
4. Modification of LIS: given an array of integers, return the length of longest alternating subsequence. i.e. ace

Skills:
College Name: Anna University Chennai

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: 1.    Queue in O(1)  solution.. I came up with a method and it was not the most optimal one… 
and I asked if I should optimize more.. he said he was happy with the solution I gave and 
proceeded to the next question…
2.       For eg.. if there is a string abda. I shud reverse it n/2 times.. ie… say
1st rev: adba
2nd rev: (during the second reversal I shouldnot rev from beg.. but rev the string between ( i+1,j­
1) where i=0,j=n­1in the first case….)ie
a db a => a bd a….
so it is abda finally….after n/2 reversal we get the initial string which is abda.. this is a 
favourable case and I increment the count by 1…
The question is give the string length say n=4 how do u find out the total number of strings 
which will have the favourable condition after n/2 reversals…. I came up with a solution… just 
think over it.. not a difficult one… just 5mins of thinking will get u reach the right answer….
3.    There are 100 petrol pumps between two points A and B/.. u have to select 10(say) petrol 
pumps such that the largest distance between any two petrol pumps should be minimum…I gave 
a top down approach.. guess he expected a bottom up approach….  But at the end he was quite 
happy with my answer…
4. tel me a scenario where i cud use MERGE SORT AND QUICK SORT AND WHERE I CAN 
USE ONE NOT THE OTHER.. and the differences...
MERGE SORT:
when there is 1GB of things to be solved we can divide that 1 GB into A*B=1GB , such that 
each division will have a size of A(MBs)... in this case I cannot bring the entire 1GB into 
memory.. So i ll bring A(MB) into memory at a time sort it and keep it and sort all the B 
divisions and do a B­WAY Merge... which will be easier... But this kinda thing cant be done in 
quick sort...
Quick SORT:
if we want to find the Kth smallest v can use quick sort without sorting the entire array but its 
enuogh.. till the pivot element is placed at the kth position... (random select...)...... this cant be 
applied for merge sort..where v have to sort the entire thick to identify.. kth smallest...


Round: Technical Interview
Experience: This round involved all concepts right from OS, DBMS, Networks, Data structure, Algorithms, your 
projects,  a slight touch on testing…
Topics covered in each subject:
OS: Threads, process… difference.. if threads have more advantages y go for process??
Semaphores, Synchronization, concurrency problems, Second chance algorithm in virtual 
memory chapter….
DBMS: Second highest salary… TRY TO USE TOP… I TOLD HIM TWO SOLUTIONS ONE 
WITH TOP AND OTHER WITHOUT TOP … But he emphasized me to use TOP first.. So use 
that…
He gave me a set of tables and asked me write queries
Indexing was also an important concept he asked me.. B+ trees properties and how used in DB.
Normalization of my tables in my project….
Data structures:
Difference between binary trees,  hash map, Tries.
A scenario where BST has advantages than hash map without any collision.
How do we avoid collision in hash
Example of a good hash being used…(I told STL..he said no that’s a different concept.. I then 
said…Java hash map…..that was the right answer… time for getting.. most of the time O(1) and 
depending on the inputs and the things it might vary accordingly )
Tries advantages and wen can it be used….and application of it..
Networks:
Layers of OSi.. explanation of each layer 
Google.com steps involved
About DNS
Testing:
What do u know about testing…
I explained back and white box testing… alpha n beta testing.. and he said..he was  not proficient 
in it..n stopped…
Algorithms: (besides the algorithm round)
Difference in greedy n dynamic… which is better….
Kinda company oriented questions:
advantages and disadvantages of that site…
what I know About Advertising online…
all this went for around 1.5 hrs

Skills:
College Name: Anna University Chennai

Application Developer Interview Questions asked at other Companies

Q1. Minimum Cost to Connect All Points Problem Statement Given an array COORDINATES representing the integer coordinates of some points on a 2D plane, determine the minimum cost required to connect all points. The cost to connect two points, (x... read more
View answer (2)
Directi Interview Questions and Answers for Freshers
illustration image

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

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 elements in this array may appear more than once. Your task is to identify a... read more
View answer (1)

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)

I was interviewed in Aug 2017.

Interview Preparation Tips

Round: Test
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

Applications Engineer Interview Questions asked at other Companies

Q1. Minimum Special Sum Problem You are given an array ARR of length N. There are two operations defined for each index i in the array: FIRST_SUM(i): Calculates the sum of the first i numbers. LAST_SUM(i): Calculates the sum of the last N-i+1 ... read more
View answer (1)

Directi interview questions for popular designations

 Software Developer

 (5)

 Application Developer

 (3)

 Software Engineer

 (2)

 Product Manager

 (1)

 Applications Engineer

 (1)

 IT Support Executive

 (1)

 Platform Engineer

 (1)

 Intern

 (1)

Interview Questions & Answers

user image Anonymous

posted on 2 Jun 2015

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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • Q10. Difference between BST and tries
  • 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

  • Answered by AI

Interview Preparation Tips

Round: Test
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&#44; 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

Sales & Marketing Interview Questions & Answers

user image DANISH JAWAD ZAIDI

posted on 31 Mar 2017

I was interviewed before Mar 2016.

Interview Questionnaire 

2 Questions

  • Q1. What made me want to apply to this company?
  • Ans. 

    I was attracted to this company because of its strong reputation in the industry and its commitment to innovation.

    • The company has a proven track record of success and is highly regarded in the market.

    • I was impressed by the company's focus on staying ahead of industry trends and constantly seeking new ways to improve.

    • The company's values and mission align with my own professional goals and aspirations.

    • I was excited abou...

  • Answered by AI
  • Q2. What are the key point of marketing that got me fascinating in majoring in it?
  • Ans. 

    The key points of marketing that fascinated me were its creativity, strategic thinking, and impact on consumer behavior.

    • Creativity in developing unique campaigns and messaging to attract customers

    • Strategic thinking in analyzing market trends and competition to create effective marketing strategies

    • Impact on consumer behavior by influencing purchasing decisions through targeted marketing efforts

  • Answered by AI

Interview Preparation Tips

Round: HR Interview
Experience: This was just a basic call to check my command over the language and figure how interested i was for the job opening. Basic questions and verification.

Round: Group Discussion
Experience: So this seemed like the most basic GD i had ever gone through. Sitting in a circle talking in turns, I couldn't understand why the need so such a basic topic would be required after some people started listed things about facebook and orkut (its an old interview) which made me realize a lot of these candidates though from decent colleges still thought the internet is basically facebooking and orkuting which I found extremely funny, the interviewers looks already could tell who went to the next round and who were let go off. I spoke about how the internets much bigger than just social media of a certain companies and its vast knowledge is a boon. Also from a companies point of view to have a platform to tell people of what it manufactures or provides as a product or service to the entire world makes a platform like the internet an awesome place.
Duration: 35 minutes

Round: Technical + HR Interview
Experience: So time for personal interview and final interview, I walk in meet this guy whose wearing a T-shirt, don't be surprised. (Internet Firm) Also this guys a IIT , IIM A and very professional. sits me down asks me some basic questions and some that should corner me. I reply to all of them I've listed them above. We have a quick chat about how some candidates were really off point on the group discussion he was just trying to see my mindset thus he started that conversation. Conversations is fun and he sees I'm enjoying it , which I was.
He then tells me You'd already know what all to answer as you are referred by a friends who works here. I said,"Yes, So please don't ask me to sell you a pen or something like that". I laugh.
(Mind you while all of this is going on there is a female sitting extremely behind in the room just assessing my interview. )
Then the Interviewer smiles and says you see that female sitting behind assessing the interview , ask her out . If she says yes, I'll hire you . Wish I could record the look on my face, partially embarrassed partially surprised for a moment. Then I smile , tell him. Guess I'm done talking to you. I just need her approval and that's it. I go up to her ask her name, tell her how I'm happy that it was her job to eavesdrop on our conversation so that's made it easier for me to do this. I tell her about restaurant that serves different type of food and has an open mic every friday and if shes interested I could pick her up from her place. Also explain her the ambience and tell her shed really enjoy it . I'd done it once and it was fun . She says no, saying shes never been to an open mic before. I try to explain more , but shes like Ive never been to an open mic so im not interested. I immediately ask her if shes been to Iran ? she says no, I ask her so how is Tehran (The capital) as a city to be at. Shes like I do not understand . Then I explain if you've never been to an open mic how would you ever know how awesome it is . Let me pick you up at 8 Friday, you'll have a great time.
I purposely don't talk about non veg or alcohol because i do not know her food preferences so I stick away from that. The guy calls me back laughs and says lets talk salary. I get the job.
Basically the key is to be confident and not give up.
P.S: Its another story that the Interviewer and now my boss kept joking about how i asked a girl out jut for a job. :D



Tips: Stick to what you are confident at, don't give up, maintain eye contact.

Skills: Sales, Marketing, Confidence

Sales & Marketing Interview Questions asked at other Companies

Q1. 1) what are the benefits of mutual fund and why someone should invest in mutual fund rather than direct equity?
View answer (10)

Software Engineer Interview Questions & Answers

user image Anish Somani

posted on 13 Mar 2015

Interview Questionnaire 

4 Questions

  • Q1. Beer overflow problem. Glasses are stacked like a pyramid onto a table. If you are given X liters of water to pour on the topmost glass, How much water will be held by each glass. Given, Xth glass an hold...
  • Ans. 

    The glasses are stacked like a pyramid on a table. Each glass can hold a certain amount of water, and the overflow is distributed equally to the glasses below.

    • The glasses form a pyramid shape, with the topmost glass being the first level and each subsequent level having one more glass than the previous level.

    • The amount of water held by each glass can be calculated by dividing the total amount of water by the number of ...

  • Answered by AI
  • Q2. Sub Divide a Rectangle. Given a Rectangle of M X N. U have many smaller rectangles of M1 X N1 and so on. You have to divide the greater rectangle in such a way to minimize the wastage. Rules of division ar...
  • Ans. 

    Divide a rectangle of M x N into smaller rectangles of M1 x N1 to minimize wastage.

    • Start by dividing the rectangle horizontally or vertically based on the dimensions of the smaller rectangles.

    • Continue dividing each resulting sub-rectangle until no further division is possible.

    • Consider the dimensions of the smaller rectangles and the remaining space to minimize wastage.

    • Keep track of the divisions made to reconstruct the

  • Answered by AI
  • Q3. You are needed to sort a given String. Trick is, you can send letter from any position only to the first of the string. Interviewer didn’t clear me as to if the letters are interchanged or the Ith position...
  • Q4. You start with A. In every step, A gets transformed to AB and B get transformed to BA. You are supposed to tell how many ‘BB’ will occur at Nth iteration. E.G. A AB ABBA ABBABAAB … So on
  • Ans. 

    The number of 'BB' occurrences at the Nth iteration of the transformation sequence.

    • At each iteration, A gets transformed to AB and B gets transformed to BA.

    • To find the number of 'BB' occurrences at the Nth iteration, we need to count the number of 'BB' substrings in the transformed string.

    • The transformation sequence follows a pattern: AB, ABA, ABAAB, ABAABABA, ...

    • The number of 'BB' occurrences doubles with each iterati...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: It was a skype round of 90 mins.
Tips: Prior to this we had an online round, you will get it online. Frankly, I don't rem the questions.

Round: Technical Interview
Experience: It was a skype round of 1hr. I was rejected after this round. Next would have been the final round.
Tips: Time was limited, so we had to come up with efficient solution faster.

General Tips: Code Daily and give it your best. Practise will make it easier for you.
Skill Tips: Learn to code fast, you won't get lot of time to think about the problem statement as you get in Long challenges.
Skills: efficiency, Speed, Coding, Algorithm
College Name: IIT DHANBAD

Skills evaluated in this interview

Top Directi Software Engineer Interview Questions and Answers

Q1. 2)Given an n x n matrix, where every row and column is sorted in increasing order. Given a number x, how to decide whether this x is in the matrix. The designed algorithm should have linear time complexity. a) Start with top right element b... read more
View answer (1)

Software Engineer Interview Questions asked at other Companies

Q1. Bridge and torch problem : Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge. Person... read more
View answer (197)

Interview Questions & Answers

user image Anonymous

posted on 14 Mar 2015

Interview Questionnaire 

22 Questions

  • Q1. What r your favorite subjects and how do you rate yourself in then out of 10 and why.
  • Q2. Why do we prefer oops?
  • Q3. What r all complex data structures you have implemented?
  • Q4. What did you do in IPC. Tell all programs & asked me to explain coordinate server.
  • Q5. What do we use for IPC if processes run on different systems?
  • Q6. If we r given time in hh:mm find the angle between hr hand and minute hand.
  • Q7. How to find nth node from end in a link list in only one scan
  • Q8. If we are give a link list such that a few nodes from end are common....and both are of unknown different length....how to find first common node....
  • Q9. If we are given a matrix such that its rows and column are sorted search a number in o(n+m) complexity....
  • Ans. 

    Use binary search starting from top right corner to find the number in O(n+m) complexity.

    • Start from the top right corner of the matrix

    • If the current number is greater than the target, move left

    • If the current number is less than the target, move down

    • Repeat until the number is found or out of bounds

  • Answered by AI
  • Q10. In an array find maximum non consecutive sum sequence...
  • Q11. What r all comp science subjects u have read
  • Q12. What are threads. Why do we use them ?
  • Q13. What are indexes , normalization, asked about OLTP
  • Q14. What are deadlocks. Give some example.
  • Q15. How do we synchronize our programs?
  • Q16. About me
  • Q17. What wil my sister say about me. What my friends say about me?
  • Ans. 

    My sister would say I am caring and reliable. My friends would say I am funny and outgoing.

    • Sister: caring, reliable

    • Friends: funny, outgoing

  • Answered by AI
  • Q18. What did I like about directi
  • Q19. How was the ppt?
  • Q20. Give some feedback about the process
  • Q21. Any higher studies plan?
  • Q22. What will I prefer and why among google,yahoo,Microsoft,amazon.
  • Ans. 

    I would prefer Google for its search engine, Microsoft for its software, and Amazon for its e-commerce services.

    • Google for its powerful search engine

    • Microsoft for its software products like Office Suite and Windows OS

    • Amazon for its e-commerce services and Prime membership benefits

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: It  was  online   coding   round....we  were   given   two   problems   and   asked   to   sole  any  one  of them. If  you keep  your cool you can solve both in the given code problems were not difficult.
Tips: Keep yourself cool.
Duration: 120 minutes

Round: Technical Interview
Experience: This round was in college itself just after the written exam & he asked me the following questions:
In an  array there  is  a number  which  is  guaranteed to  be  repeated   more than n/2  times.   find  the number  in o(n) time and o(1) space complexity. We r given 3 arrays  of equal size, a number k, we have to  find 3 number one from each array which add up to k. Give the best solution. I first gave n3 and n2 solution.

Round: Technical Interview
Experience: This round was just after the first round. We are given a number of balloons  with different sizes  and only one parameter to  indicate size.we can fit smaller balloon   in   larger...we   have   to   make   minimum   number   of   sets   such   that   in   a   such   after   fitting   into   each   other   they reduce to one balloon . Asked me to explain 0­1 knapsack problem in detail.

Round: Technical Interview
Experience: Half   an   hour   after   HR   round   I   got   the   call....this   was   a   difficult   one   to   face as  we have to hold phone and concentrate and explaining is also very difficult. I am given day high and day low of past 10 years of a share script. If I could buy and sell only once  when would I like to buy and sell to maximize my profit tell in o(n). We are given two circles with center and radius  of them and we have to tell whether they are completely apart/touch externally/cut/touch internally/one is inside other, if they cut then find the points of intersection. One   question   of   travelling   person   based   on   dijkstra`s   algorithm then   asked   me   to   explain dijkstra`s   algorithm. Then asked what if negative cycles are there and then said find the complexity in terms to number of edges.

Round: HR Interview
Experience: this   was   a   small   interaction just   to   make   us   familiar   in   mumbai  office. She   asked   about   me,what do you think about directi,what r ur favorite subjects,what language do u prefer.

Round: Presentation
Experience: First they shown a presentation about the bad ways of writing code...then they gave code snippets to  identify wrong code writing practices  and to  modify the code .  After this  we were asked  to  choose on technical topic  of our  own  choice which  they  expected to  be out of our academics...and  speak  on  it for  10 minute....after  we finish   speaking   they   will   ask   questions....about   what   we   said...   I   did   very   bad   in   this   round.....as  I   could   not   get   a good topic.

Round: Technical Interview
Experience: This was taken by CEO of company itself....he asked a few things...but all in depth.
Given   an   array   having   +ve   as   well   as   –ve   numbers   ....find   the   maximum   subsequence   sum......if   there   are   two subsequence such  that both sum up to  maximum....print the smaller one....only  one  scan allowed.....asked  to  write the code after listening to algorithm....then said to optimize code.... Asked   about   multithreading.....how   is   it   helpful....then   said...if   we   have   only   one   processor   and   there   is   no   read write....we   have   just   computations. Wwhy   would   we   use   threading. Then   said   we   have   100   computations and   2 processors which one will do faster one thread/two thread/three thread ...and why. Compare   bst   and   hashing...asked   me   to   give   7   differences and how   to   improve   hashing   if   we   have   many collisions. I   said   linear   chaining/linear   probing/quadratic   probing....he   was   not   happy then   I   said   to   use   bst   in place of linear chain...and then I said multiple hashing...and he was happy.

Skill Tips: Be present in online coding communities. Solve problems on careercup.com. Let interviewer know whatever you are thinking. Whether it is the way you are approaching problem or u r tensed or you did bad   in   last  round and   want  to   make   most   of   it whatever that makes you feel free and   if   you   don’t no one wins. Play   smart. If  you  know  the  good   solution  to   a problem. Don't  tell the  solution in  first shot, first  give   some  bad solution and   then   give   good   one. Make   him   feel   that you faced the problem first time and you thought over here only.
College Name: NIT WARANGAL

Skills evaluated in this interview

Interview Questions & Answers

user image Anonymous

posted on 19 May 2015

Interview Preparation Tips

Round: Test
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

Interview Questionnaire 

5 Questions

  • Q1. 1)There are three types of balls arranged linearly in a random order Red, Green and Blue. Now your job is to sort them so that the Red balls are in front follwed by the Green balls and the Blue balls are p...
  • Ans. 

    Sorting an array of 0, 1 and 2 can be done in O(n) using two pointers.

    • Use two pointers, one for 0 and one for 2, and a current pointer to traverse the array

    • If the current pointer encounters a 0, swap it with the 0 pointer and move both pointers to the right

    • If the current pointer encounters a 2, swap it with the 2 pointer and move the 2 pointer to the left

    • Repeat until the current pointer meets the 2 pointer

  • Answered by AI
  • Q2. 2)Given an n x n matrix, where every row and column is sorted in increasing order. Given a number x, how to decide whether this x is in the matrix. The designed algorithm should have linear time complexity...
  • Ans. 

    Algorithm to find if a number is present in a sorted n x n matrix with linear time complexity.

    • Start with the top right element

    • Compare the element with x

    • If equal, return its position

    • If e < x, move down (if out of bounds, return false)

    • If e > x, move left (if out of bounds, return false)

    • Repeat till element is found or returned false

  • Answered by AI
  • Q3. 3)In the same matrix mentioned above find the kth maximum element. I said that we just need to compare the last K x K sub matrix and to find the Kth element
  • Q4. 4)Given a set of integers, Display the non-empty subsets whose sum is zero. For example, given the set { −7, −3, −2, 5, 8}, the answer is the subset { −3, −2, 5} which sums to zero. This is the special cas...
  • Ans. 

    The problem is to find non-empty subsets of a given set of integers whose sum is zero.

    • The problem is a special case of the knapsack problem and is known to be NP-Complete.

    • A brute-force approach would involve generating all subsets and checking their sums.

    • The brute-force approach has an exponential time complexity.

    • There is no known polynomial time solution for this problem.

  • Answered by AI
  • Q5. 5)Create a data structure where inserting, deleting and finding the minimum element all have O(1) time. i said we can use augmented stack where with each element we can augment the minimum element along wi...
  • Ans. 

    Data structure with O(1) insert, delete, and find min without creating new structures

    • Use two stacks, one for actual data and one for minimum values

    • When inserting, push the value onto the data stack and push the minimum of the new value and the top of the minimum stack onto the minimum stack

    • When deleting, pop from both stacks

    • When finding the minimum, return the top of the minimum stack

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There is a drought situation in Agrabah.King got worried and called Aladdin for helping him out. As he is a modern Aladdin he tookprintouts of places around Agrabah from google maps.For analyzing the map properly, he converted the map into a M x N grid. Each point is represented by either ?0? or ?1?.?1? represents the unit area of water and ?0? represents the unit areaof land. King told him to find the largest continuous patch of water.so that he can send his people over there.As our Aladdin is modern, but not a good programmer, he wants your help. Help him out by printing out the largest area water patch available on map.

College Name: NA

Skills evaluated in this interview

Top Directi Software Engineer Interview Questions and Answers

Q1. 2)Given an n x n matrix, where every row and column is sorted in increasing order. Given a number x, how to decide whether this x is in the matrix. The designed algorithm should have linear time complexity. a) Start with top right element b... read more
View answer (1)

Software Engineer Interview Questions asked at other Companies

Q1. Bridge and torch problem : Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge. Person... read more
View answer (197)
Contribute & help others!
anonymous
You can choose to be anonymous

Directi Interview FAQs

How many rounds are there in Directi interview?
Directi interview process usually has 3-4 rounds. The most common rounds in the Directi interview process are One-on-one Round, Resume Shortlist and Coding Test.
How to prepare for Directi interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Directi. The most common topics and skills that interviewers at Directi expect are Communication Skills, Client Support, Product Support, Program Management and Technical Support.
What are the top questions asked in Directi interview?

Some of the top questions asked at the Directi interview -

  1. 2)Given an n x n matrix, where every row and column is sorted in increasing ord...read more
  2. Suppose there are ‘n’ trees (literal trees, not trees of computer science, ...read more
  3. 4)Given a set of integers, Display the non-empty subsets whose sum is zero. For...read more

Recently Viewed

SALARIES

Credgenics

INTERVIEWS

Directi

No Interviews

INTERVIEWS

ClearTax

No Interviews

INTERVIEWS

Namaste Credit

No Interviews

LIST OF COMPANIES

DRC Systems

Overview

SALARIES

Eversendai

SALARIES

Publicis

SALARIES

Directi

SALARIES

Credgenics

SALARIES

Directi

Tell us how to improve this page.

Directi Interview Process

based on 6 interviews

Interview experience

3.7
  
Good
View more

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.5k Interviews
Infosys Interview Questions
3.6
 • 7.7k Interviews
Wipro Interview Questions
3.7
 • 5.7k Interviews
Tech Mahindra Interview Questions
3.5
 • 3.9k Interviews
HCLTech Interview Questions
3.5
 • 3.8k Interviews
LTIMindtree Interview Questions
3.8
 • 3k Interviews
Mphasis Interview Questions
3.4
 • 812 Interviews
Zoho Interview Questions
4.3
 • 516 Interviews
CitiusTech Interview Questions
3.4
 • 269 Interviews
View all

Directi Reviews and Ratings

based on 59 reviews

4.1/5

Rating in categories

3.8

Skill development

3.8

Work-life balance

4.2

Salary

3.7

Job security

4.1

Company culture

3.6

Promotions

3.7

Work satisfaction

Explore 59 Reviews and Ratings
Software Development Engineer II
13 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
11 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Product Manager
11 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Software Engineer
9 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Software Developer
9 salaries
unlock blur Lock Unlock

₹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