DSA Doctor
Verified Company Vault
Directi DSA Interview Questions
8 curated coding interview questions directly asked in Directi technical rounds, sorted by frequency with recency and difficulty diagnostics.
8
Total Questions
0 (0%)
Easy Problems
5 (62%)
Medium Problems
3 (38%)
Hard Problems
🔥 Most Tested Topics:
Arrays (6)Trees (2)Greedy (1)Strings (1)Core DSA (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2473 | Minimum Cost to Buy Apples | Medium | Arrays | Sorting / Prefix / Scan | 67.3% | 100.0% | all |
| 2479 | Maximum XOR of Two Non-Overlapping Subtrees | Hard | Arrays; Trees; Greedy | Sorting / Prefix / Scan; DFS / BFS; Greedy | 52.2% | 100.0% | all |
| 2538 | Difference Between Maximum and Minimum Price Sum | Hard | Arrays | Sorting / Prefix / Scan | 33.6% | 100.0% | all |
| 1524 | Number of Sub-arrays With Odd Sum | Medium | Arrays | Sorting / Prefix / Scan | 55.7% | 100.0% | all |
| 1535 | Find the Winner of an Array Game | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 100.0% | all |
| 1542 | Find Longest Awesome Substring | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 46.9% | 100.0% | all |
| 1584 | Min Cost to Connect All Points | Medium | Core DSA | Implementation / Reasoning | 70.9% | 100.0% | all |
| 1727 | Largest Submatrix With Rearrangements | Medium | Arrays | Sorting / Prefix / Scan | 80.2% | 100.0% | all |