Problem database last updated: June 20, 2025
12 problems · 1 Easy, 9 Medium, 2 Hard · Ranked #126 of 458
1 Easy
8% · avg 23%
9 Medium
75% · avg 59%
2 Hard
17% · avg 18%
Based on 12 reported problems, Splunk interviews are in line with industry averages - 17% Hard vs 18% overall. The majority (75%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Splunk puts unusual emphasis on data-stream (16.7% of problems, 25.1x the industry average), doubly-linked-list (16.7% of problems, 8.7x the industry average), design (25% of problems, 4.3x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (50%), string (33.3%), stack (33.3%), hash-table (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Group Anagrams Given an array of strings strs, group the anagrams together. You can return the answer in any order. | Medium | Very Likely | arrayhash-tablestring | Solve |
Longest Increasing Subsequence Given an integer array nums, return the length of the longest strictly increasing subsequence. | Medium | Very Likely | arraybinary-searchdynamic-programming | Solve |
Find First and Last Position of Element in Sorted Array Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. | Medium | Very Likely | arraybinary-search | Solve |
Find Median from Data Stream The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two midd... | Hard | Very Likely | two-pointersdesignsorting | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Very Likely | hash-tablelinked-listdesign | Solve |
Find All Anagrams in a String Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Design Browser History You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward in the hist... | Medium | Very Likely | arraylinked-liststack | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Very Likely | stringstack | Solve |
Minimum Height Trees A tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree. | Medium | Very Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Koko Eating Bananas Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. | Medium | Very Likely | arraybinary-search | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Very Likely | arraytwo-pointersdynamic-programming | Solve |
Decode String Given an encoded string, return its decoded string. | Medium | Very Likely | stringstackrecursion | Solve |
Group Anagrams
SolveGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Longest Increasing Subsequence
SolveGiven an integer array nums, return the length of the longest strictly increasing subsequence.
Find First and Last Position of Element in Sorted Array
SolveGiven an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
Find Median from Data Stream
SolveThe median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two midd...
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Find All Anagrams in a String
SolveGiven two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order.
Design Browser History
SolveYou have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward in the hist...
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Minimum Height Trees
SolveA tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.
Koko Eating Bananas
SolveKoko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Decode String
SolveGiven an encoded string, return its decoded string.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Splunk interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Splunk interviews focus heavily on array, string, stack problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Splunk interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Splunk has been reported to ask 12 distinct coding problems. The most common topics are array, string, stack. 1 are Easy difficulty, 9 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 12 reported problems, Splunk interviews are in line with industry averages - 17% Hard vs 18% overall. 75% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, stack. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Splunk coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Splunk interview with AIarrow_forward
