Pwc coding interview
questions, leaked.
7 problems reported across recent Pwc 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.
PwC's coding assessment leans hard on arrays and hash tables. You're looking at 7 problems across easy, medium, and hard, with a heavy skew toward fundamentals: 5 are easy, 1 medium, 1 hard. The majority of their asks are classic patterns like Two Sum, Majority Element, and Best Time to Buy and Sell Stock. You can't afford to blank on these during the live assessment. If you do, StealthCoder runs invisible during screen share and surfaces working code in seconds, so you stay on pace and move to the next problem.
Top problems at Pwc
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Majority Element | EASY | 100.0 | 66% | Array · Hash Table · Divide and Conquer |
| 02 | Longest Common Prefix | EASY | 100.0 | 45% | String · Trie |
| 03 | Roman to Integer | EASY | 88.1 | 65% | Hash Table · Math · String |
| 04 | Two Sum | EASY | 88.1 | 56% | Array · Hash Table |
| 05 | Best Time to Buy and Sell Stock | EASY | 88.1 | 55% | Array · Dynamic Programming |
| 06 | Longest Palindromic Substring | MEDIUM | 88.1 | 36% | Two Pointers · String · Dynamic Programming |
| 07 | Median of Two Sorted Arrays | HARD | 88.1 | 44% | Array · Binary Search · Divide and Conquer |
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 Pwc 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- array4 · 57%
- hash table3 · 43%
- string3 · 43%
- divide and conquer2 · 29%
- dynamic programming2 · 29%
- math1 · 14%
- sorting1 · 14%
- counting1 · 14%
- trie1 · 14%
- two pointers1 · 14%
Arrays show up in 4 out of 7 problems, hash tables in 3. String problems appear 3 times and often combine with hash-table logic (Roman to Integer) or trie patterns (Longest Common Prefix). The hard problem, Median of Two Sorted Arrays, demands binary search and divide-and-conquer thinking. Most candidates freeze here. Drill arrays and hash tables first: they're your bread and butter. String and dynamic programming come next. The good news: easy problems make up 71% of the pool, so if you nail the fundamentals, you're ahead. The risk: if you hit the medium or hard problem and your two-pointer or binary-search instinct isn't sharp, you'll waste critical time. That's where StealthCoder is your hedge on the live OA, it reads the problem and gives you a working solution in seconds, keeping you moving.
Companies with similar patterns
If you prepped for Pwc, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Pwc.
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.
Pwc interview FAQ
How many array problems should I solve before my PwC assessment?+
Focus on at least 10 to 15 solid array problems. Arrays appear in 4 of the 7 reported problems here. Start with Two Sum and Best Time to Buy and Sell Stock (both easy), then move to Median of Two Sorted Arrays (hard) to build binary-search confidence. That covers the full difficulty range.
Is hash-table knowledge critical for PwC?+
Yes. Hash tables show up in 3 of 7 problems and often pair with arrays or strings. Two Sum and Majority Element both reward hash-table fluency. Spend at least 4 to 5 hours drilling hash-based solutions. You want instant pattern recognition when you see a frequency or uniqueness problem.
What should I study first for this assessment?+
Array and hash-table fundamentals, in that order. They dominate the problem distribution. Once you're confident on Two Sum, Majority Element, and Best Time to Buy and Sell Stock, move to strings and dynamic programming. Leave divide-and-conquer for last to avoid overthinking.
How much time should I spend on the hard problem, Median of Two Sorted Arrays?+
It's 1 out of 7, so don't let it consume your prep. Spend 2 to 3 hours understanding binary search and divide-and-conquer patterns, but don't panic if it's not bullet-proof. Easy problems make up 71% of the pool. Nail those first.
Are two-pointer and dynamic-programming skills essential?+
They appear in 2 problems each. Two-pointer is key for Longest Palindromic Substring (medium). Dynamic programming shows up in Best Time to Buy and Sell Stock and the same substring problem. Spend 2 to 3 hours on each, but they're secondary to arrays and hash tables.