HSBC coding interview
questions, leaked.
4 problems reported across recent HSBC interviews. Top patterns: array, dynamic programming, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
HSBC's coding assessment is small but sharp. Four problems, three easy, one medium. You're staring at arrays, dynamic programming, and string manipulation. The trap is thinking it's a warmup. The easy problems move fast if you know the patterns, and the medium one punishes hesitation. You've got a week to lock in array iteration, DP state transitions, and two-pointer mechanics. If you blank on any of these during the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, no proctor in sight.
Top problems at HSBC
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Common Prefix | EASY | 100.0 | 45% | String · Trie |
| 02 | Container With Most Water | MEDIUM | 100.0 | 58% | Array · Two Pointers · Greedy |
| 03 | Pascal's Triangle | EASY | 100.0 | 77% | Array · Dynamic Programming |
| 04 | Best Time to Buy and Sell Stock | EASY | 100.0 | 55% | Array · Dynamic Programming |
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 HSBC OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array3 · 75%
- dynamic programming2 · 50%
- string1 · 25%
- trie1 · 25%
- two pointers1 · 25%
- greedy1 · 25%
Arrays dominate the test. Three of four problems touch array manipulation, and two of those layer in dynamic programming. That's your priority. Best Time to Buy and Sell Stock and Pascal's Triangle aren't trick problems, but they force you to think about state and recurrence cleanly under pressure. Container With Most Water is the only medium, and it's the only one that tests two-pointer discipline and greedy thinking together. String and trie appear once each in Longest Common Prefix, a classic easy that catches candidates who overthink it. Your prep order: nail array iteration and DP state setup first, then drill two-pointer sweeps. Trie is lower frequency here, but if you freeze on prefix logic during the assessment, StealthCoder is your safety net.
Companies with similar patterns
If you prepped for HSBC, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass HSBC.
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. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
HSBC interview FAQ
How many array problems should I solve before the HSBC assessment?+
At least 8 to 10 beyond the four you'll see. HSBC hits arrays in 75 percent of their problems. Master index manipulation, subarray logic, and boundary conditions before test day. Pascal's Triangle and Best Time to Buy and Sell Stock are the actual questions, so solve both repeatedly until they take under 5 minutes.
Is dynamic programming going to sink me?+
It appears in half of HSBC's problems, but both are easy difficulty. They're not asking for optimization proofs or complex memoization. Focus on Pascal's Triangle (simple iteration) and Best Time to Buy and Sell Stock (single pass, one variable). These test DP thinking, not DP theory.
What should I drill the day before if I'm short on time?+
Container With Most Water. It's the only medium, and it combines array indexing, two pointers, and greedy logic. Three concepts in one problem. The other three are easy and won't tank you if you're solid on basics. One medium problem can make or break your score.
Do I need to study tries for HSBC?+
Not heavily. Longest Common Prefix is the only trie problem, and it's easy. You can solve it without a trie at all if you understand string indexing. Learn the pattern but don't spend days on trie deep dives. String and greedy matter more here.
How do I handle the two-pointer pattern under pressure?+
Practice Container With Most Water until the mental model sticks. Two pointers collapsing inward, tracking max area as you go. It's not intuitive at first, but it's always the same concept. Drill it 5 times before the assessment so your hands move without your brain getting in the way.