BP coding interview
questions, leaked.
4 problems reported across recent BP 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.
BP's coding assessment hits you with four medium-difficulty problems across arrays, hash tables, and strings. No easy problems to warm up on. You're walking into Group Anagrams, LRU Cache, Longest Common Subsequence, and Diagonal Traverse II. All medium. All require solid fundamentals and pattern recognition under pressure. If you blank on hash-table logic mid-assessment, StealthCoder surfaces a working solution in seconds, invisible to the proctor. But the real advantage is knowing what's coming and drilling the right patterns now.
Top problems at BP
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Group Anagrams | MEDIUM | 100.0 | 71% | Array · Hash Table · String |
| 02 | Longest Common Subsequence | MEDIUM | 92.9 | 58% | String · Dynamic Programming |
| 03 | LRU Cache | MEDIUM | 82.8 | 45% | Hash Table · Linked List · Design |
| 04 | Diagonal Traverse II | MEDIUM | 82.8 | 58% | Array · Sorting · Heap (Priority Queue) |
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 BP OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- array2 · 50%
- hash table2 · 50%
- string2 · 50%
- sorting2 · 50%
- dynamic programming1 · 25%
- linked list1 · 25%
- design1 · 25%
- doubly linked list1 · 25%
- heap priority queue1 · 25%
Hash tables and arrays dominate BP's question set, appearing in half the problems reported. String manipulation and sorting tie at two each. This is a company testing whether you can transform and organize data efficiently. LRU Cache is the outlier: it's design-heavy and requires you to combine multiple data structures (hash table, doubly-linked list) under time pressure. That's where most candidates slip. Longest Common Subsequence brings dynamic programming into play, but only once. Drill hash-table construction and array traversal first. Get comfortable with LRU Cache's two-layer architecture before test day. StealthCoder is your hedge if you hit a wall on the design problem or can't recall the DP recurrence mid-OA.
Companies with similar patterns
If you prepped for BP, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass BP.
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 because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
BP interview FAQ
What should I study first for BP's assessment?+
Hash tables and arrays. They appear in two problems each and form the foundation for the other patterns. Group Anagrams tests both together. Get comfortable sorting arrays and building hash maps before you touch LRU Cache or DP.
Is LRU Cache really a medium-difficulty problem?+
It's the hardest one BP asks, even at medium rating. It combines hash tables, linked lists, and design in one go. Most candidates underestimate it. Spend extra time on the doubly-linked list mechanics and the eviction logic.
How many medium-level hash-table problems should I solve?+
BP asks two hash-table problems directly. Solve at least five to ten hash-table mediums before your OA. Two of BP's reported problems (Group Anagrams and LRU Cache) require solid hash-table patterns.
Do I need to know dynamic programming well for BP?+
It appears once in Longest Common Subsequence, but hash tables and arrays are more frequent. If DP isn't your strong suit, focus on the four core patterns first. DP can wait if time is tight.
Why no easy problems in BP's assessment?+
BP's dataset shows zero easy problems. All four are medium. Expect no warm-up round. Every problem requires clean implementation and fast debugging. You can't coast on basics here.