How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Pwc interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
P
Pwc Coding Interview Questions
7 problems · 5 Easy, 1 Medium, 1 Hard · Ranked #182 of 458
Difficulty breakdown
5 Easy
71% · avg 23%
1 Medium
14% · avg 59%
1 Hard
14% · avg 18%
Top topics
array
71.4%
string
42.9%1.5x
hash-table
28.6%
divide-and-conquer
28.6%6.9x
dynamic-programming
28.6%
sorting
14.3%
Interview profile
Based on 7 reported problems, Pwc interviews are in line with industry averages - 14% Hard vs 18% overall.
Compared to the industry average, Pwc puts unusual emphasis on divide-and-conquer (28.6% of problems, 6.9x the industry average), string (42.9% of problems, 1.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (71.4%), string (42.9%), hash-table (28.6%), divide-and-conquer (28.6%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 7 problems
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Majority Element Given an array nums of size n, return the majority element. | Easy | Very Likely | arrayhash-tabledivide-and-conquer | Solve |
Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. | Easy | Very Likely | arraystringtrie | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Very Likely | arraydynamic-programming | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Median of Two Sorted Arrays Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. | Hard | Very Likely | arraybinary-searchdivide-and-conquer | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Very Likely | two-pointersstringdynamic-programming | Solve |
Roman to Integer Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. | Easy | Very Likely | hash-tablemathstring | Solve |
Majority Element
SolveGiven an array nums of size n, return the majority element.
EasyVery Likely
arrayhash-tabledivide-and-conquer
Longest Common Prefix
SolveWrite a function to find the longest common prefix string amongst an array of strings.
EasyVery Likely
arraystringtrie
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
EasyVery Likely
arraydynamic-programming
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
EasyVery Likely
arrayhash-map
Median of Two Sorted Arrays
SolveGiven two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
HardVery Likely
arraybinary-searchdivide-and-conquer
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
MediumVery Likely
two-pointersstringdynamic-programming
Roman to Integer
SolveRoman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
EasyVery Likely
hash-tablemathstring
Preparing for your Pwc coding interview
Pwc interviews focus heavily on array, string, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Pwc interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Frequently Asked Questions
What coding problems does Pwc ask in interviews?add
Pwc has been reported to ask 7 distinct coding problems. The most common topics are array, string, hash-table. 5 are Easy difficulty, 1 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Pwc coding interviews?add
Based on 7 reported problems, Pwc interviews are in line with industry averages - 14% Hard vs 18% overall. 14% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Pwc coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Other companies to explore
Ready to ace your Pwc interview?
Simulate a real Pwc coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Pwc interview with AIarrow_forward