Directi Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 60 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Directi.
Directi
Software Engineer
Senior Difficult Neutral experience Decline offer 3 rounds
Interview process
Recruiter call Phone screen Take home
Interview formats
Technical Coding Behavioral
So, I didn't actually finish the whole thing, I was pushed to a next round but I declined. The first call was a 2-hour long phone screen with technical, analytical, and coding stuff. Scheduling was a bit annoying because they only had Thursday evenings, so if a date didn't work, you'd have to wait a week for the next slot. The HR sent me links to the company's website but didn't really give me an intro about the job or where I'd fit in. They also sent a link to their programming contest site and told me to pick a hard/hardest problem and code it. There were only two problems to choose from, and one was an NP-complete problem, which took me 3 nights to finish because I was still working my day job. I did like that they focused on programming basics, but knowing NP-complete solutions is a bit much.
Confirmed questions1 question
- Can you code a solution for the number partitioning problem where the cardinality difference is at most 1?
Directi
Software Engineer
Entry Difficult Neutral experience Accept offer 4 rounds
Interview process
Technical screen Technical screen Technical screen Technical screen
Interview formats
Coding Technical Technical Technical
Applied on campus. Went through 4 rounds. First round was a coding test on codechef with 2 questions in about 75-90 mins, I managed to solve 1. Only a few people (9 out of 200) solved 2 questions, and they shortlisted 30-40 for the next stages. The second and third rounds were algorithm interviews, each lasting about an hour. I was asked 2 questions in each, and they were moderately to highly difficult. I solved all of them and passed. The final round was a technical-HR interview, which was the toughest. It was a phone call where they asked me about everything, starting with my current project, then a live coding problem, followed by questions on DBMS, OS, and Networks. This round took around 1 hour 30 minutes. The interviewers were really nice and friendly, making it a good experience. Since I'm still finishing my last semester, I don't have any feedback on the office culture yet.
Confirmed questions1 question
- No comments on this as it is against the company policy to release questions
Directi
Software Engineer
Mid Difficult Positive experience Accept offer 4 rounds
Interview process
Recruiter call Technical screen Technical screen Technical screen Technical screen
Interview formats
Technical Coding Technical
I was contacted by the DirectI CEO about open positions and the interview process included 4 rounds. It started with a difficult algorithm interview covering probability theory and segment trees. This was followed by a very difficult technical interview with questions on databases, networks, and OS. Next, a pair coding interview involved building a simple application where I got many hints. Finally, the CEO conducted a 30-minute interview focusing on OS, Multithreading, and Data Structures, which didn't go too well due to my lack of preparation, but the questions were logical.
Confirmed questions1 question
- I was expecting only HR/company questions from the CEO, but instead, I was asked about four processors.
Directi Software Engineer Interview Questions
Quoted word for word from Directi interview reports.
“What is the probability a knight starting at coordinates [a,b] on an 8x8 board will move off the board within n moves, generalized for a, b, and n?”
Read reports →“Find the shortest path in a square matrix from (0,0) to (n,n) and back to (0,0), with constraints on movement: only upper half when going down, only lower half when going up.”
Read reports →“What is the minimum number of adjacent swaps required to make a given string a palindrome, assuming it's possible, in under O(n^2) time?”
Read reports →“Given a binary tree where each node has a number, what is the maximum possible sum when going from one leaf node to another?”
Read reports →“Is it possible to color a binary tree with red and black nodes such that the distance between any two red nodes and any two black nodes is at most k, given a positive integer k?”
Read report →“How many ways are there to reach from one end to another in an m x n matrix?”
Read report →“Find the number that appears more than n/2 times in an array of n elements, with an O(nlogn) and then O(n) solution.”
Read report →“What is the logic behind hashtables and algorithm complexity?”
Read report →“What are the methods for finding a duplicate element in an array?”
Read report →Formats, difficulty and experience
Across all 60 Directi interview reports.