Directi Interview Questions — 9 DSA Problems

7 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Directi LeetCode questions for software engineering interviews.

• Minimum Cost to Buy Apples (MEDIUM) — Array, Graph, Heap (Priority Queue), Shortest Path
• Maximum XOR of Two Non-Overlapping Subtrees (HARD) — Tree, Depth-First Search, Graph, Trie
• Difference Between Maximum and Minimum Price Sum (HARD) — Array, Dynamic Programming, Tree, Depth-First Search
• Number of Sub-arrays With Odd Sum (MEDIUM) — Array, Math, Dynamic Programming, Prefix Sum
• Find the Winner of an Array Game (MEDIUM) — Array, Simulation
• Find Longest Awesome Substring (HARD) — Hash Table, String, Bit Manipulation
• Min Cost to Connect All Points (MEDIUM) — Array, Union Find, Graph, Minimum Spanning Tree
• Largest Submatrix With Rearrangements (MEDIUM) — Array, Greedy, Sorting, Matrix
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree