Splunk coding interview
questions, leaked.
14 problems reported across recent Splunk interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Splunk's coding interview is 14 problems deep, and 11 of them are medium or hard. That's a compressed timeline. Arrays dominate the question pool at 50%, followed by hash-tables, strings, and stacks all at 29%. You're looking at classic data-structure work: Meeting Rooms II, Group Anagrams, LRU Cache, Trapping Rain Water. One easy gimme (Valid Parentheses), but the rest demand speed and pattern recognition under pressure. StealthCoder runs invisibly during the live assessment as your real-time backup if you hit a wall on a design or binary-search problem you haven't drilled.
Top problems at Splunk
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Meeting Rooms II | MEDIUM | 100.0 | 52% | Array · Two Pointers · Greedy |
| 02 | Find First and Last Position of Element in Sorted Array | MEDIUM | 91.4 | 47% | Array · Binary Search |
| 03 | Group Anagrams | MEDIUM | 91.4 | 71% | Array · Hash Table · String |
| 04 | Number of Distinct Islands | MEDIUM | 91.4 | 62% | Hash Table · Depth-First Search · Breadth-First Search |
| 05 | Longest Increasing Subsequence | MEDIUM | 91.4 | 58% | Array · Binary Search · Dynamic Programming |
| 06 | Find Median from Data Stream | HARD | 91.4 | 53% | Two Pointers · Design · Sorting |
| 07 | Minimum Height Trees | MEDIUM | 79.4 | 42% | Depth-First Search · Breadth-First Search · Graph |
| 08 | Find All Anagrams in a String | MEDIUM | 79.4 | 52% | Hash Table · String · Sliding Window |
| 09 | Koko Eating Bananas | MEDIUM | 79.4 | 49% | Array · Binary Search |
| 10 | Decode String | MEDIUM | 79.4 | 61% | String · Stack · Recursion |
| 11 | LRU Cache | MEDIUM | 79.4 | 45% | Hash Table · Linked List · Design |
| 12 | Design Browser History | MEDIUM | 79.4 | 78% | Array · Linked List · Stack |
| 13 | Trapping Rain Water | HARD | 79.4 | 65% | Array · Two Pointers · Dynamic Programming |
| 14 | Valid Parentheses | EASY | 79.4 | 42% | String · Stack |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Splunk OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- array7 · 50%
- hash table4 · 29%
- string4 · 29%
- stack4 · 29%
- binary search3 · 21%
- two pointers3 · 21%
- sorting3 · 21%
- design3 · 21%
- depth first search2 · 14%
- breadth first search2 · 14%
The distribution is telling. Splunk tests breadth within a narrow set of core patterns. Array problems appear in 7 of 14 questions, but they're bundled with secondary topics: sorting, binary search, two-pointers, heap work. Hash-tables and strings each show up 4 times, often paired (Group Anagrams, Find All Anagrams). Stack problems are frequent but straightforward (Valid Parentheses, Decode String). The hard questions (Find Median from Data Stream, Trapping Rain Water) require both algorithmic insight and design thinking. Drill arrays and hash-tables first, then lock in stack logic. Binary search and two-pointer patterns appear often enough that weak spots here will cost you. If you blank on a heap-priority-queue merge mid-OA, StealthCoder surfaces a working solution invisible to the proctor.
Companies with similar patterns
If you prepped for Splunk, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Splunk.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Splunk interview FAQ
Should I focus on arrays first for Splunk?+
Yes. Arrays appear in 7 of 14 problems reported, and most come paired with binary search, two-pointers, or sorting. Nail array fundamentals and the binary-search variants (Find First and Last Position, Koko Eating Bananas) before moving to hash-table design work.
How much design prep do I need?+
Design appears in 3 problems: Find Median from Data Stream, LRU Cache, and Design Browser History. These are hard or medium and test your ability to pick the right data structures (heaps, hash-tables, doubly-linked lists). Practice these three explicitly.
Is one easy problem enough to warm up on?+
No. Valid Parentheses is your only easy gimme. Everything else is medium-hard. You'll need 6 to 8 hours minimum on medium patterns, focusing on arrays, hash-tables, and stacks, before you're ready to attempt a timed run.
Should I study graph algorithms for this interview?+
Graph work is light. Number of Distinct Islands and Minimum Height Trees both use DFS or BFS, but graph topics appear only twice across 14 problems. Study them after arrays, hash-tables, and design. They're not the bottleneck.
How do I prepare for the two hard problems?+
Find Median from Data Stream and Trapping Rain Water both require DP or heap logic combined with careful state management. Solve them last, after you're confident on mediums. They'll expose weaknesses in heap design and two-pointer technique.