DSA Doctor
Verified Company Vault
Splunk DSA Interview Questions
14 curated coding interview questions directly asked in Splunk technical rounds, sorted by frequency with recency and difficulty diagnostics.
14
Total Questions
2 (14%)
Easy Problems
10 (71%)
Medium Problems
2 (14%)
Hard Problems
🔥 Most Tested Topics:
Arrays (3)Strings (3)Graphs (2)Design (2)Trees (2)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 100.0% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 100.0% | all |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 100.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 100.0% | all |
| 694 | Number of Distinct Islands | Medium | Graphs | BFS / DFS / Topological Sort | 62.8% | 87.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 87.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 87.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 87.5% | all |
| 310 | Minimum Height Trees | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.6% | 87.5% | all |
| 438 | Find All Anagrams in a String | Medium | Strings | Hashing / Sliding Window | 53.8% | 87.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 87.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 87.5% | all |
| 622 | Design Circular Queue | Medium | Stack / Queue; Design | Monotonic Stack / Simulation; Data Structure Design | 54.7% | 87.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 87.5% | all |