Directi LeetCode Questions
8 questions all-time · 0 easy · 5 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Minimum Cost to Buy Apples Array, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 100 | 0.7% |
| 2 | Maximum XOR of Two Non-Overlapping Subtrees Tree, Depth-First Search, Graph Theory, Trie | Hard | 100 | 0.5% |
| 3 | Difference Between Maximum and Minimum Price Sum Array, Dynamic Programming, Tree, Depth-First Search | Hard | 100 | 0.3% |
| 4 | Number of Sub-arrays With Odd Sum Array, Math, Dynamic Programming, Prefix Sum | Medium | 100 | 0.6% |
| 5 | Find the Winner of an Array Game Array, Simulation | Medium | 100 | 0.6% |
| 6 | Find Longest Awesome Substring Hash Table, String, Bit Manipulation | Hard | 100 | 0.5% |
| 7 | Min Cost to Connect All Points Array, Union-Find, Graph Theory, Minimum Spanning Tree | Medium | 100 | 0.7% |
| 8 | Largest Submatrix With Rearrangements Array, Greedy, Sorting, Matrix | Medium | 100 | 0.8% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.