Problem database last updated: June 20, 2025
14 problems · 4 Easy, 9 Medium, 1 Hard · Ranked #114 of 458
4 Easy
29% · avg 23%
9 Medium
64% · avg 59%
1 Hard
7% · avg 18%
Based on 14 reported problems, Wells Fargo interviews are easier than average - only 7% Hard compared to 18% across all companies. The majority (64%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Wells Fargo puts unusual emphasis on heap-priority-queue (14.3% of problems, 2.4x the industry average), breadth-first-search (14.3% of problems, 1.7x the industry average), greedy (14.3% of problems, 1.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (57.1%), string (42.9%), math (14.3%), breadth-first-search (14.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Shortest and Lexicographically Smallest Beautiful String You are given a binary string s and a positive integer k. | Medium | Very Likely | stringsliding-window | Solve |
Verbal Arithmetic Puzzle Given an equation, represented by words on the left side and the result on the right side. | Hard | Very Likely | arraymathstring | Solve |
Find the Safest Path in a Grid You are given a 0-indexed 2D matrix grid of size n x n, where (r, c) represents: | Medium | Likely | arraybinary-searchbreadth-first-search | Solve |
Maximum Number of Weeks for Which You Can Work There are n projects numbered from 0 to n - 1. You are given an integer array milestones where each milestones[i] denotes the number of milestones the ith proje... | Medium | Likely | arraygreedy | Solve |
Count and Say The count-and-say sequence is a sequence of digit strings defined by the recursive formula: | Medium | Likely | string | Solve |
Best Time to Buy and Sell Stock II You are given an integer array prices where prices[i] is the price of a given stock on the ith day. | Medium | Likely | arraydynamic-programminggreedy | Solve |
Rotate String Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s. | Easy | Likely | stringstring-matching | Solve |
Kth Largest Element in a Stream You are part of a university admissions office and need to keep track of the kth highest test score from applicants in real-time. This helps to determine cut-of... | Easy | Likely | treedesignbinary-search-tree | Solve |
Water and Jug Problem You are given two jugs with capacities x liters and y liters. You have an infinite water supply. Return whether the total amount of water in both jugs may reach... | Medium | Likely | mathdepth-first-searchbreadth-first-search | Solve |
Spiral Matrix Given an m x n matrix, return all elements of the matrix in spiral order. | Medium | Likely | arraymatrixsimulation | Solve |
Merge Strings Alternately You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other,... | Easy | Likely | two-pointersstring | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Likely | arraytwo-pointerssorting | Solve |
Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. | Easy | Likely | arraystringtrie | Solve |
Product of Array Except Self Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. | Medium | Likely | arrayprefix-sum | Solve |
Shortest and Lexicographically Smallest Beautiful String
SolveYou are given a binary string s and a positive integer k.
Verbal Arithmetic Puzzle
SolveGiven an equation, represented by words on the left side and the result on the right side.
Find the Safest Path in a Grid
SolveYou are given a 0-indexed 2D matrix grid of size n x n, where (r, c) represents:
Maximum Number of Weeks for Which You Can Work
SolveThere are n projects numbered from 0 to n - 1. You are given an integer array milestones where each milestones[i] denotes the number of milestones the ith proje...
Count and Say
SolveThe count-and-say sequence is a sequence of digit strings defined by the recursive formula:
Best Time to Buy and Sell Stock II
SolveYou are given an integer array prices where prices[i] is the price of a given stock on the ith day.
Rotate String
SolveGiven two strings s and goal, return true if and only if s can become goal after some number of shifts on s.
Kth Largest Element in a Stream
SolveYou are part of a university admissions office and need to keep track of the kth highest test score from applicants in real-time. This helps to determine cut-of...
Water and Jug Problem
SolveYou are given two jugs with capacities x liters and y liters. You have an infinite water supply. Return whether the total amount of water in both jugs may reach...
Spiral Matrix
SolveGiven an m x n matrix, return all elements of the matrix in spiral order.
Merge Strings Alternately
SolveYou are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other,...
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Longest Common Prefix
SolveWrite a function to find the longest common prefix string amongst an array of strings.
Product of Array Except Self
SolveGiven an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Wells Fargo interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Wells Fargo interviews focus heavily on array, string, math 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. Wells Fargo 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.
Wells Fargo has been reported to ask 14 distinct coding problems. The most common topics are array, string, math. 4 are Easy difficulty, 9 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 14 reported problems, Wells Fargo interviews are easier than average - only 7% Hard compared to 18% across all companies. 64% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, math. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Wells Fargo coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Wells Fargo interview with AIarrow_forward
