Directi LeetCode interview questions

Explore Directi questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 8

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Minimum Cost to Buy Apples Array Graph Theory Heap (Priority Queue) +1 MEDIUM	Medium	100.0%	0.7%
Maximum XOR of Two Non-Overlapping Subtrees Tree Depth-First Search Graph Theory +1 HARD	Hard	100.0%	0.5%
Difference Between Maximum and Minimum Price Sum Array Dynamic Programming Tree +2 HARD	Hard	100.0%	0.3%
Number of Sub-arrays With Odd Sum Array Math Dynamic Programming +1 MEDIUM	Medium	100.0%	0.6%
Find the Winner of an Array Game Array Simulation MEDIUM	Medium	100.0%	0.6%
Find Longest Awesome Substring Hash Table String Bit Manipulation HARD	Hard	100.0%	0.5%
Min Cost to Connect All Points Array Union-Find Graph Theory +4 MEDIUM	Medium	100.0%	0.7%
Largest Submatrix With Rearrangements Array Greedy Sorting +1 MEDIUM	Medium	100.0%	0.8%

Showing 1–8 of 8 matching problems · All Problems