HPE coding interview
questions, leaked.
4 problems reported across recent HPE interviews. Top patterns: string, array, depth first search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
HPE's assessment is small but deceptively sharp. Four problems total, three at medium difficulty, and they cluster around graph traversal and string manipulation. You're looking at Number of Islands (matrix plus DFS/BFS/union-find), Longest Substring Without Repeating Characters (sliding window on strings), Merge Two Sorted Lists (linked-list recursion), and Reverse Words in a String (two-pointer work). The medium-heavy distribution means there's no warm-up. If you blank on graph traversal or string algorithms mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds. Most candidates see the graph problem and panic. Don't be one of them.
Top problems at HPE
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Number of Islands | MEDIUM | 100.0 | 62% | Array · Depth-First Search · Breadth-First Search |
| 02 | Longest Substring Without Repeating Characters | MEDIUM | 100.0 | 37% | Hash Table · String · Sliding Window |
| 03 | Merge Two Sorted Lists | EASY | 100.0 | 67% | Linked List · Recursion |
| 04 | Reverse Words in a String | MEDIUM | 100.0 | 52% | Two Pointers · String |
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 HPE OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- string2 · 50%
- array1 · 25%
- depth first search1 · 25%
- breadth first search1 · 25%
- union find1 · 25%
- matrix1 · 25%
- hash table1 · 25%
- sliding window1 · 25%
- linked list1 · 25%
- recursion1 · 25%
String problems dominate the visible attack surface here. Two out of four are string-heavy, and both leverage different tools: sliding window for substring matching, two pointers for in-place reversal. The matrix and graph traversal problem (Number of Islands) is the gatekeeper. It tests whether you can code DFS or BFS cleanly under pressure, and it's the only one that bleeds into union-find territory. One easy linked-list warm-up exists, but don't rely on it to build confidence. Go hard on sliding-window string logic first. Then drill DFS/BFS on grids until you can code it without thinking. The assessment has no easy escapes. StealthCoder is the hedge if you hit a wall on the graph traversal pattern or blank on sliding-window pointer mechanics mid-OA.
Companies with similar patterns
If you prepped for HPE, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass HPE.
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 an Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
HPE interview FAQ
Should I study string problems first for HPE?+
Yes. Two of the four problems are string-centric. Longest Substring Without Repeating Characters and Reverse Words in a String together make half the assessment. Master sliding-window and two-pointer string techniques before touching graph traversal.
How much should I practice graph traversal for HPE?+
Heavy focus. Number of Islands is the most complex problem on the assessment and tests DFS, BFS, and union-find. Drill this pattern until you can code it in under 10 minutes. Most candidates stumble here.
Is the linked-list problem enough to warm up?+
No. Merge Two Sorted Lists is easy and good for confidence, but it's one easy problem among three mediums. Don't treat it as representative. Use it as a confidence check, then move to the harder string and graph problems.
What if I blank on the matrix traversal problem?+
That's where StealthCoder saves you. If DFS or BFS doesn't click mid-assessment, StealthCoder runs invisibly during your screen share and surfaces a working solution. You have a backup.
How much time should I spend on two-pointer techniques?+
Moderate focus. Two-pointer appears in Reverse Words in a String, which is one of four problems. It's important but not the primary attack vector. Master sliding-window first, then refine two-pointer work as a secondary skill.