Publicis Sapient coding interview
questions, leaked.
5 problems reported across recent Publicis Sapient interviews. Top patterns: hash table, string, array. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Publicis Sapient's coding assessment is small but dense. Five problems. Two easy, two medium, one hard. Hash tables, strings, and arrays dominate the set, appearing in three problems each. You're looking at pattern recognition over breadth. Most candidates will see Two Sum and Valid Parentheses as warmups, then hit the wall on Trapping Rain Water or Group Anagrams. If you blank mid-assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds, keeping you moving when the pattern doesn't click.
Top problems at Publicis Sapient
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Trapping Rain Water | HARD | 100.0 | 65% | Array · Two Pointers · Dynamic Programming |
| 02 | Longest Substring Without Repeating Characters | MEDIUM | 88.4 | 37% | Hash Table · String · Sliding Window |
| 03 | Group Anagrams | MEDIUM | 88.4 | 71% | Array · Hash Table · String |
| 04 | Two Sum | EASY | 88.4 | 56% | Array · Hash Table |
| 05 | Valid Parentheses | EASY | 88.4 | 42% | String · Stack |
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 Publicis Sapient OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- hash table3 · 60%
- string3 · 60%
- array3 · 60%
- stack2 · 40%
- sliding window1 · 20%
- two pointers1 · 20%
- dynamic programming1 · 20%
- monotonic stack1 · 20%
- sorting1 · 20%
The distribution tells you what Publicis Sapient values: hash-table fluency for grouping and lookups, string manipulation for substring problems, and array indexing for multi-pointer techniques. Stack shows up twice, signaling they care about parsing and monotonic stacks. Trapping Rain Water is the spike, a hard problem that needs either dynamic programming or a two-pointer monotonic stack approach. The easy tier is accessible, which means the real filter is medium to hard. Drill hash-table construction and two-pointer mechanics first. Sliding window and monotonic stack are the outliers, but Longest Substring Without Repeating Characters combines all three core topics and appears to be a hybrid blocker. StealthCoder is your hedge if a pattern doesn't stick during the live assessment.
Companies with similar patterns
If you prepped for Publicis Sapient, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Publicis Sapient.
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 an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Publicis Sapient interview FAQ
Should I study all nine topics, or focus on the big three?+
Focus on hash-table, string, and array first. They're in three problems each and cover two-thirds of the assessment. Stack and two-pointers matter for the hard problem and Valid Parentheses. Monotonic stack, sliding window, and dynamic programming are lower priority unless you're strong on the core three.
Is Valid Parentheses a real blocker, or just a warmup?+
It's a warmup. Easy difficulty and a straightforward stack problem. Don't spend time drilling it. Use it to confirm your stack mechanics work, then move to Group Anagrams and Longest Substring Without Repeating Characters, which mix topics and are more representative.
How should I approach Trapping Rain Water if I've never seen it?+
It's the hard problem and likely a tiebreaker. Two-pointer monotonic stack is the fastest approach. If you're not comfortable with that pattern yet, study the two-pointer rhythm first using Two Sum and Valid Parentheses as stepping stones. Trapping Rain Water combines array indexing, two-pointer logic, and monotonic thinking.
Do I need to master dynamic programming for this assessment?+
Not strictly. Trapping Rain Water has a DP solution, but two-pointer monotonic stack is faster and cleaner. DP appears once in the top problems. If you're weak on it, focus on getting comfortable with the other eight topics first and treat DP as a bonus approach.
What's the quickest path to being ready for their assessment?+
Drill Two Sum and Valid Parentheses to warm up hash tables and stacks. Spend most time on Group Anagrams and Longest Substring Without Repeating Characters since they mix multiple topics. Leave Trapping Rain Water for last. You have five problems and a small dataset, so quality reps on the medium tier matter more than coverage.