Question 1

Minimum Cost to Buy Apples — Directi Interview Question

Accepted Answer

"Minimum Cost to Buy Apples" is a medium difficulty problem asked at Directi interviews. It covers the following topics: Array, Graph, Heap (Priority Queue), Shortest Path. You can practice it on LeetCode: https://leetcode.com/problems/minimum-cost-to-buy-apples

Question 2

Maximum XOR of Two Non-Overlapping Subtrees — Directi Interview Question

Accepted Answer

"Maximum XOR of Two Non-Overlapping Subtrees" is a hard difficulty problem asked at Directi interviews. It covers the following topics: Tree, Depth-First Search, Graph, Trie. You can practice it on LeetCode: https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees

Question 3

Difference Between Maximum and Minimum Price Sum — Directi Interview Question

Accepted Answer

"Difference Between Maximum and Minimum Price Sum" is a hard difficulty problem asked at Directi interviews. It covers the following topics: Array, Dynamic Programming, Tree, Depth-First Search. You can practice it on LeetCode: https://leetcode.com/problems/difference-between-maximum-and-minimum-price-sum

Question 4

Number of Sub-arrays With Odd Sum — Directi Interview Question

Accepted Answer

"Number of Sub-arrays With Odd Sum" is a medium difficulty problem asked at Directi interviews. It covers the following topics: Array, Math, Dynamic Programming, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum

Question 5

Find the Winner of an Array Game — Directi Interview Question

Accepted Answer

"Find the Winner of an Array Game" is a medium difficulty problem asked at Directi interviews. It covers the following topics: Array, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/find-the-winner-of-an-array-game

Question 6

Find Longest Awesome Substring — Directi Interview Question

Accepted Answer

"Find Longest Awesome Substring" is a hard difficulty problem asked at Directi interviews. It covers the following topics: Hash Table, String, Bit Manipulation. You can practice it on LeetCode: https://leetcode.com/problems/find-longest-awesome-substring

#	Question Title	Difficulty	Frequency	Topics
1	Minimum Cost to Buy Apples	MEDIUM	100.0	ArrayGraphHeap (Priority Queue)+1
2	Maximum XOR of Two Non-Overlapping Subtrees	HARD	100.0	TreeDepth-First SearchGraph+1
3	Difference Between Maximum and Minimum Price Sum	HARD	100.0	ArrayDynamic ProgrammingTree+1
4	Number of Sub-arrays With Odd Sum	MEDIUM	100.0	ArrayMathDynamic Programming+1
5	Find the Winner of an Array Game	MEDIUM	100.0	ArraySimulation
6	Find Longest Awesome Substring	HARD	100.0	Hash TableStringBit Manipulation
7	Min Cost to Connect All Points	MEDIUM	100.0	ArrayUnion FindGraph+1
8	Largest Submatrix With Rearrangements	MEDIUM	100.0	ArrayGreedySorting+1
9	Binary Tree Maximum Path Sum	HARD	62.4	Dynamic ProgrammingTreeDepth-First Search+1

Explore 450+ Companies

Companies

Directi

Directi Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Directi

Directi Interview Questions

Ai Assistant Kas