4 curated coding interview questions directly asked in Hpe technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 100.0% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 100.0% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 100.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 100.0% | all |