DSA Doctor
Verified Company Vault
30d Active
Palantir DSA Interview Questions
29 curated coding interview questions directly asked in Palantir technical rounds, sorted by frequency with recency and difficulty diagnostics.
29
Total Questions
5 (17%)
Easy Problems
19 (66%)
Medium Problems
5 (17%)
Hard Problems
🔥 Most Tested Topics:
Arrays (14)Strings (6)Core DSA (6)Trees (2)Design (1)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 3006 | Find Beautiful Indices in the Given Array I | Medium | Arrays | Sorting / Prefix / Scan | 40.9% | 100.0% | 30d |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 100.0% | 30d |
| 1202 | Smallest String With Swaps | Medium | Strings | Hashing / Sliding Window | 60.6% | 75.0% | 3m |
| 244 | Shortest Word Distance II | Medium | Strings | Hashing / Sliding Window | 62.9% | 75.0% | 3m |
| 539 | Minimum Time Difference | Medium | Arrays | Sorting / Prefix / Scan | 62.6% | 75.0% | all |
| 3008 | Find Beautiful Indices in the Given Array II | Hard | Arrays | Sorting / Prefix / Scan | 27.9% | 75.0% | all |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 62.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | all |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 62.5% | all |
| 219 | Contains Duplicate II | Easy | Arrays | Sorting / Prefix / Scan | 51.3% | 62.5% | all |
| 220 | Contains Duplicate III | Hard | Arrays | Sorting / Prefix / Scan | 24.8% | 62.5% | all |
| 303 | Range Sum Query - Immutable | Easy | Arrays | Sorting / Prefix / Scan | 72.2% | 62.5% | all |
| 1232 | Check If It Is a Straight Line | Easy | Core DSA | Implementation / Reasoning | 40.1% | 62.5% | all |
| 325 | Maximum Size Subarray Sum Equals k | Medium | Arrays | Sorting / Prefix / Scan | 50.9% | 62.5% | all |
| 2312 | Selling Pieces of Wood | Hard | Core DSA | Implementation / Reasoning | 52.9% | 62.5% | all |
| 3650 | Minimum Cost Path with Edge Reversals | Medium | Arrays | Sorting / Prefix / Scan | 61.8% | 62.5% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 50.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 50.0% | all |
| 721 | Accounts Merge | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 50.0% | all |
| 245 | Shortest Word Distance III | Medium | Strings | Hashing / Sliding Window | 59.5% | 50.0% | all |
| 427 | Construct Quad Tree | Medium | Trees | DFS / BFS | 78.3% | 50.0% | all |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 50.0% | all |
| 2539 | Count the Number of Good Subsequences | Medium | Core DSA | Implementation / Reasoning | 48.6% | 50.0% | all |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 50.0% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 50.0% | all |
| 2225 | Find Players With Zero or One Losses | Medium | Core DSA | Implementation / Reasoning | 72.5% | 37.5% | all |
| 2964 | Number of Divisible Triplet Sums | Medium | Arrays | Sorting / Prefix / Scan | 67.6% | 37.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 37.5% | all |
| 718 | Maximum Length of Repeated Subarray | Medium | Arrays | Sorting / Prefix / Scan | 51.4% | 37.5% | all |