Upload Button Icon Add office photos

Directi

Compare button icon Compare button icon Compare

Filter interviews by

Directi Application Developer Interview Questions and Answers

Updated 24 Nov 2015

Directi Application Developer Interview Experiences

3 interviews found

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

Interview Preparation Tips

Round: Test
Experience: 1. My first question was to design a data structure to store a dictionary . I gave a solution to use 
a trie with 26 pointers for each character . Now he asked me to reduce the no of pointers . 
He gave me an example of our phone , where we use only 10 digits to make a combination of 
all the words instead of 26 different buttons of every character .
Then for this type of a system he asked me to design a data structure . Well I gave a solution 
with which he was satisfied . 
Note : for this hashing is not an efficient solution .
2. The next one was to design a data structure ( he explicitly expressed it as a queue ) where 
inserting , deleting and finding minimum is done in O(1) time . here you can use additional 
memory but they were very much concerned about the time i.e O(1)  . I answered them using 
additional queue .
3. Then he asked me a algorithm problem  . The statement goes like this
You are given two end points ( consider them as two end stations at some distance  ) 
there are 100 stations between these two . Now you need to build a train track between these 
two end points which includes only 10 stations and not more than that . Now the objective is to 
find such 10 stations such that the maximum distance between any two consecutive stations is 
minimum 

College Name: Anna University Chennai

Application Developer Interview Questions Asked at Other Companies

asked in Oracle
Q1. Minimum Cost to Connect All Points Problem Statement Given an arr ... read more
asked in Fujitsu
Q2. Reverse Linked List Problem Statement Given a singly linked list ... read more
asked in Oracle
Q3. Puzzle: – Two persons X and Y are sitting side by side with a coi ... read more
asked in Oracle
Q4. Count Subsequences Problem Statement Given an integer array ARR o ... read more
asked in Oracle
Q5. Remove the Kth Node from the End of a Linked List You are given a ... read more

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 took printouts 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 area of 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.


Round: Phone interview
Experience: 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 pushed to the bask.
This problem was the same as sorting the array of 0, 1 and 2. we  can do this in o(n) 
using two pointers.
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) Loop: compare this element e with x
 i) if they are equal then return its position
 ii) e < x then move it to down (if out of bound of matrix then break return false)
 iii) e > x then move it to left (if out of bound of matrix then break return false)
c) repeat the i), ii) and iii) till you find element or returned false
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.
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 case of knapsack problem and hence it is NP­Complete so i said we 
cannot find the solution in polynomial time.We consider all the subsets with k elements. Then 
check how many of these sets have a sum of 0. This is an exponential time algorithm.
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 with its actual value.Then he said “what if you cannot create any new 
data structure but have to use only the previously available data structures?” I replied that then 
we can use two stacks one to store the actual data and other to store the minimum values.

Skills:
College Name: Anna University Chennai

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: Apti was quite easy . In Basic CS concepts software engineering is prominent.
Tips: Brush up Software Engineering before written test
Duration: 90 minutes
Total Questions: 50

College Name: NIT BHOPAL

I was interviewed before Aug 2016.

Interview Preparation Tips

Round: General and technical aptitude
Experience: There were questions on basics of programming and general questions on verbal,reasoning and quantitative.
Tips: Time will be short to answer all so keep watch on time

Round: Group Discussion
Experience: They segregated us in to batches and in our team there were 10 members.
Tips: Easy round
Duration: 15 minutes

Round: Telephonic
Experience: They tested my communication skill in that round

College Name: Dhanalakshmi college of engineering

I was interviewed before Jun 2016.

Interview Questionnaire 

4 Questions

  • Q1. Tell me about yourself
  • Ans. 

    I am a passionate application developer with experience in developing web and mobile applications.

    • Experienced in programming languages such as Java, JavaScript, and Swift

    • Skilled in developing responsive and user-friendly interfaces

    • Familiar with Agile development methodologies

    • Have worked on projects involving database management and API integration

  • Answered by AI
  • Q2. Tell me about your project
  • Ans. 

    Developed a mobile application for tracking daily water intake

    • Designed user-friendly interface for inputting water consumption

    • Implemented notifications to remind users to drink water throughout the day

    • Integrated a database to store and track user's daily water intake

    • Utilized charts and graphs to visualize water intake trends

  • Answered by AI
  • Q3. Tell me about your family
  • Ans. 

    I come from a close-knit family of four, including my parents and younger sister.

    • My parents have always been supportive of my career choices.

    • I have a younger sister who is currently studying in college.

    • We enjoy spending quality time together on weekends, going for family outings or watching movies.

  • Answered by AI
  • Q4. Why mphasis
  • Ans. 

    Mphasis offers a diverse range of projects and opportunities for growth in the field of application development.

    • Mphasis has a strong reputation in the IT industry for delivering innovative solutions.

    • The company provides a collaborative work environment that fosters creativity and learning.

    • Mphasis offers opportunities to work on cutting-edge technologies and projects, allowing for professional growth and development.

  • Answered by AI

Interview Preparation Tips

Round: HR Interview
Experience: The interviewer welcomed so warmly in order to make me comfortable.. after a light talk, she started asking me to tell about myself, my place and asked me to explain about my project done...she asked me questions related to my project and concept. I was able to answer most of the questions and for those I didn't know, I tried to give an answer for some questions and for others I accepted that I have no knowledge in an area related to the concept.on the whole I was able to show that I am confident enough and possess good communication skills .I was shortlisted to second round
Tips: Practice the question tell me about yourself...know about the company, know about the projects or internships done. We need not answer all the questions nor we need not be absolutely perfect, but we should see that we need to have the basics grilled in any concept or area

Round: Telephonic interview
Experience: Telephonic interview had a pre-recorded voice and many rounds in itself which tests our communication skills .I was qualified in it and was finally selected
Tips: Focus and attention is very much required....voice quality must be maintained...manage the time gap

College Name: G.Pullareddy Engineering College

I was interviewed in Apr 2017.

Interview Questionnaire 

2 Questions

  • Q1. Java questions...
  • Q2. Tell me about urself and about us family and all
  • Ans. 

    I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.

    • Experienced software developer

    • Passionate about coding and problem-solving

    • Supportive family that encourages my career in tech

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Easy questions are there
Duration: 1 hour
Total Questions: 90

Round: Group Discussion
Experience: 12 members are there only 9 got selected
Tips: Be confident in urself and specially work in Communication skills
Duration: 15 minutes

Round: Technical Interview
Experience: Asking all the concepts of Java like oops collections threads
Tips: Prepare well on Java

Round: HR Interview
Experience: Everything was Gud but due to my certificate problem I got rejected.. Otherwise everything is good.
Tips: Be confident

College Name: C. V. Raman College of Engineering

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was an easy round which went really smooth.

  • Q1. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using dynamic programming.

    • Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.

    • Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using F(n-1) and F(n-2).

    • Ensure the input N is within the constraints 1 <= N <= 10000.

    • Example: For N = 5, the 5th Fibonacci number is 5 (1, 1, 2, 3, 5).

  • Answered by AI
  • Q2. 

    Prime Numbers Problem Statement

    Given a positive integer N, your task is to determine and return all prime numbers less than or equal to N.

    Input:

    N = 10

    Output:

    2 3 5 7

    Example:

    Input:
    N = 20
    Out...
  • Ans. 

    Implement a function to return all prime numbers less than or equal to a given positive integer N.

    • Create a function that takes a positive integer N as input

    • Iterate from 2 to N and check if each number is prime

    • Use a helper function to determine if a number is prime

    • Return an array of all prime numbers less than or equal to N

  • Answered by AI
  • Q3. What is a merge join in SQL?
  • Ans. 

    A merge join in SQL is a method of combining two sorted datasets by matching corresponding rows based on a specified condition.

    • Merge join is used when joining two large datasets that are already sorted.

    • It is more efficient than other join methods like nested loop join or hash join for sorted datasets.

    • The join condition must be an equality condition.

    • Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.i

  • Answered by AI
Round 2 - HR 

Round duration - 30 minutes
Round difficulty - Easy

The round went excellent. I really enjoyed it. Just be confident about whatever you answer

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALarsen & Toubro Infotech (LTI) interview preparation:Topics to prepare for the interview - Database, Basic C/C++, Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 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

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This round went well. Interview depends on your basic knowledge of C/C++.

  • Q1. 

    Matrix Multiplication Task

    Given two sparse matrices MAT1 and MAT2 of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...

  • Ans. 

    Implement a function to multiply two sparse matrices and return the resulting matrix.

    • Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication

    • Iterate through the non-zero elements of the matrices to perform the multiplication efficiently

    • Handle the edge cases such as empty matrices or matrices with all zero elements

    • Ensure the dimensions of the matrices are compatible

  • Answered by AI
  • Q2. 

    Problem: Count Even or Odd in Array

    Tanmay and Rohit are best buddies. Tanmay gives Rohit a challenge involving an array of N natural numbers. The task is to perform and answer a series of queries on the ...

  • Ans. 

    Count the number of even or odd numbers in a range of an array based on given queries.

    • Create an array to store the input numbers.

    • Iterate through the queries and update or count even/odd numbers based on the query type.

    • Output the count of even or odd numbers for each query of type 1 or 2.

  • Answered by AI
Round 2 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALarsen & Toubro Infotech (LTI) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 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

I was interviewed in Jul 2017.

Interview Questionnaire 

1 Question

  • Q1. Android basics and programs

Interview Preparation Tips

Round: Resume Shortlist
Experience: Resume shortlisted on the basis of 60% through out and experience in development more than 6 months.

Round: Technical Interview
Experience: Core java.. String, oops, exception,

Round: HR Interview
Experience: As usual.. tell me about your self.expectations and salary discussion.
Tips: Be confident whatever you say.

Tell us how to improve this page.

Software Development Engineer II
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Manager
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Directi with

Zoho

4.3
Compare

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

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