Interview Intel · Wells Fargo

Wells Fargo coding interview
questions, leaked.

15 problems reported across recent Wells Fargo interviews. Top patterns: array, string, greedy. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.

Founder's read

Wells Fargo's coding screen is heavy on arrays and strings. You're looking at 15 problems across easy to hard, with arrays appearing in more than half of reported questions and strings in most others. The medium tier dominates (10 out of 15), so you won't see many gimmes, but you also won't face a wall of LeetCode Hard problems. Most candidates freeze on greedy or heap problems mid-assessment. That's where StealthCoder becomes your invisible safety net: if you hit a greedy array problem you haven't drilled, it surfaces a working solution in seconds while the proctor sees nothing.

Tracked problems
15
Easy
4/ 27%
Medium
10/ 67%
Hard
1/ 7%

Top problems at Wells Fargo

leaked_problems.csv15 rows
#ProblemDiffFrequency
01Shortest and Lexicographically Smallest Beautiful StringMEDIUM
100.0
02Verbal Arithmetic PuzzleHARD
86.0
03Find the Safest Path in a GridMEDIUM
70.1
04Minimizing Array After Replacing Pairs With Their ProductMEDIUM
70.1
05Maximum Number of Weeks for Which You Can WorkMEDIUM
70.1
06Kth Largest Element in a StreamEASY
60.8
07Count and SayMEDIUM
60.8
08Best Time to Buy and Sell Stock IIMEDIUM
60.8
09Water and Jug ProblemMEDIUM
60.8
10Product of Array Except SelfMEDIUM
60.8
11Rotate StringEASY
60.8
12Spiral MatrixMEDIUM
60.8
133SumMEDIUM
60.8
14Merge Strings AlternatelyEASY
60.8
15Longest Common PrefixEASY
60.8

Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.

The hedge

You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Wells Fargo OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share.

Get StealthCoder
Topic distribution
What this means

The distribution tells you where to spend your prep time. Array problems run the interview: eight reported appearances across sliding windows, prefix sums, two-pointers, and matrix manipulation. Strings come second with six, mixing straightforward matching with harder puzzles like Count and Say and Shortest Lexicographically Smallest Beautiful String. The three greedy problems (stock trading, work weeks, array products) are the trap door. Most candidates know greedy as a concept but crack under pressure when they have to recognize the pattern in the wild. Heap, BST, and BFS each show up twice. Math appears only twice, so don't waste nights on number theory. If you blank on a hard problem like Verbal Arithmetic Puzzle or the safest path grid traversal during your live assessment, StealthCoder runs invisibly and hands you the solution.

Companies with similar patterns

If you prepped for Wells Fargo, these companies recycle ~60% of the same topics.

The honest play

You've seen the list. Now make sure you pass Wells Fargo.

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 by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share. Works on HackerRank, CodeSignal, CoderPad, and Karat.

Wells Fargo interview FAQ

Should I drill greedy problems first for Wells Fargo?+

No. Start with arrays and strings, which appear in 14 of 15 problems. Greedy (3 problems) is real but smaller. After nailing two-pointer array work and string matching, spend the last few days on greedy stock trading and work-scheduling patterns. You'll feel confident on the majority.

How many array problems should I solve before this interview?+

Focus on quality over count. Eight reported problems span prefix sums, two-pointers, and matrix simulation. Solve at least 3-4 in each subpattern. The medium difficulty floor means you can't skip hard-coded solutions. Prefix sum and two-pointer drills hit two birds with one stone.

Is heap knowledge required for Wells Fargo's assessment?+

No. Heap appears in only 2 of 15 reported problems, and one (Kth Largest Element in a Stream) is classified easy. Skip deep heap theory. If you see a priority queue problem, it's usually a bonus question or a hard one. Greedy and arrays will carry you much further.

What string patterns dominate Wells Fargo's screen?+

String matching, simulation, and sequence counting. Rotate String and Longest Common Prefix are foundational. Count and Say is harder but teaches sequence recognition. Shortest Lexicographically Smallest Beautiful String mixes strings with sliding window. Drill basic string iteration and pattern matching before moving to complex variants.

How many hard problems will I actually face in the live assessment?+

One hard problem is reported. Verbal Arithmetic Puzzle (array, math, string, backtracking) is the wildcard. Medium problems (10 total) are your actual interview. Hard might not even appear depending on your loop structure. Don't let hard problems paralyze your prep. Master the 10 medium patterns and you're set.

Problem frequencies sourced from public community-maintained interview-report repos. Problems, ratings, and trademarks are property of LeetCode and Wells Fargo. StealthCoder is not affiliated with Wells Fargo.