DSA Doctor
Verified Company Vault
Wells Fargo DSA Interview Questions
24 curated coding interview questions directly asked in Wells Fargo technical rounds, sorted by frequency with recency and difficulty diagnostics.
24
Total Questions
10 (42%)
Easy Problems
12 (50%)
Medium Problems
2 (8%)
Hard Problems
🔥 Most Tested Topics:
Arrays (10)Strings (8)Trees (3)Core DSA (3)Graphs (2)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2696 | Minimum String Length After Removing Substrings | Easy | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS | 77.2% | 100.0% | 3m |
| 2904 | Shortest and Lexicographically Smallest Beautiful String | Medium | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 41.1% | 100.0% | all |
| 696 | Count Binary Substrings | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 70.4% | 87.5% | 6m |
| 1307 | Verbal Arithmetic Puzzle | Hard | Core DSA | Implementation / Reasoning | 34.9% | 87.5% | all |
| 2892 | Minimizing Array After Replacing Pairs With Their Product | Medium | Arrays | Sorting / Prefix / Scan | 40.7% | 75.0% | all |
| 796 | Rotate String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 66.6% | 75.0% | all |
| 1768 | Merge Strings Alternately | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 82.1% | 75.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 75.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 75.0% | all |
| 1953 | Maximum Number of Weeks for Which You Can Work | Medium | Arrays | Sorting / Prefix / Scan | 42.5% | 62.5% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 62.5% | all |
| 703 | Kth Largest Element in a Stream | Easy | Heap | Priority Queue | 61.0% | 62.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 62.5% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | all |
| 2062 | Count Vowel Substrings of a String | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 73.2% | 62.5% | all |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 62.5% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 62.5% | all |
| 844 | Backspace String Compare | Easy | Strings | Hashing / Sliding Window | 49.9% | 62.5% | all |
| 160 | Intersection of Two Linked Lists | Easy | Linked List | Two Pointers | 63.7% | 62.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | all |
| 2008 | Maximum Earnings From Taxi | Medium | Arrays | Sorting / Prefix / Scan | 46.5% | 62.5% | all |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 62.5% | all |