Problem database last updated: June 20, 2025
7 problems · 0 Easy, 4 Medium, 3 Hard · Ranked #201 of 458
0 Easy
0% · avg 23%
4 Medium
57% · avg 59%
3 Hard
43% · avg 18%
Based on 7 reported problems, Directi interviews are significantly harder than average - 43% Hard vs 18% across all companies. The majority (57%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Directi puts unusual emphasis on tree (28.6% of problems, 5.1x the industry average), depth-first-search (28.6% of problems, 3.1x the industry average), dynamic-programming (42.9% of problems, 2.2x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (71.4%), dynamic-programming (42.9%), tree (28.6%), depth-first-search (28.6%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Number of Sub-arrays With Odd Sum Given an array of integers arr, return the number of subarrays with an odd sum. | Medium | Very Likely | arraymathdynamic-programming | Solve |
Min Cost to Connect All Points You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi]. | Medium | Very Likely | arrayunion-findgraph | Solve |
Difference Between Maximum and Minimum Price Sum There exists an undirected and initially unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length... | Hard | Very Likely | arraydynamic-programmingtree | Solve |
Largest Submatrix With Rearrangements You are given a binary matrix matrix of size m x n, and you are allowed to rearrange the columns of the matrix in any order. | Medium | Very Likely | arraygreedysorting | Solve |
Find the Winner of an Array Game Given an integer array arr of distinct integers and an integer k. | Medium | Very Likely | arraysimulation | Solve |
Find Longest Awesome Substring You are given a string s. An awesome substring is a non-empty substring of s such that we can make any number of swaps in order to make it a palindrome. | Hard | Very Likely | hash-tablestringbit-manipulation | Solve |
Binary Tree Maximum Path Sum A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequ... | Hard | Likely | dynamic-programmingtreedepth-first-search | Solve |
Number of Sub-arrays With Odd Sum
SolveGiven an array of integers arr, return the number of subarrays with an odd sum.
Min Cost to Connect All Points
SolveYou are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi].
Difference Between Maximum and Minimum Price Sum
SolveThere exists an undirected and initially unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length...
Largest Submatrix With Rearrangements
SolveYou are given a binary matrix matrix of size m x n, and you are allowed to rearrange the columns of the matrix in any order.
Find the Winner of an Array Game
SolveGiven an integer array arr of distinct integers and an integer k.
Find Longest Awesome Substring
SolveYou are given a string s. An awesome substring is a non-empty substring of s such that we can make any number of swaps in order to make it a palindrome.
Binary Tree Maximum Path Sum
SolveA path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequ...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Directi interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Directi interviews focus heavily on array, dynamic-programming, tree problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Directi interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Directi has been reported to ask 7 distinct coding problems. The most common topics are array, dynamic-programming, tree. 0 are Easy difficulty, 4 are Medium, and 3 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, Directi interviews are significantly harder than average - 43% Hard vs 18% across all companies. 57% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, tree. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Directi coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Directi interview with AIarrow_forward
