Visa coding interview
questions, leaked.
84 problems reported across recent Visa interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Visa's interview is heavy on arrays. Of 84 problems tracked, 55 are array-based, and 48 of them sit in the medium-to-hard range. You're looking at a lot of two-pointers, hash-table lookups, and matrix manipulation under time pressure. The good news: patterns repeat. Two Sum, 3Sum, and Longest Substring Without Repeating Characters cover most of the fundamentals you'll see. The bad news: they'll dress them up. If you blank on a variant mid-assessment, StealthCoder runs invisibly during your screen share and surfaces a working solution in seconds, letting you move forward.
Top problems at Visa
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Length of Longest V-Shaped Diagonal Segment | HARD | 100.0 | 34% | Array · Dynamic Programming · Memoization |
| 02 | Two Sum | EASY | 96.5 | 56% | Array · Hash Table |
| 03 | Rotating the Box | MEDIUM | 93.8 | 79% | Array · Two Pointers · Matrix |
| 04 | Split the Array | EASY | 93.8 | 59% | Array · Hash Table · Counting |
| 05 | 3Sum | MEDIUM | 87.4 | 37% | Array · Two Pointers · Sorting |
| 06 | Best Time to Buy and Sell Stock | EASY | 85.5 | 55% | Array · Dynamic Programming |
| 07 | Create Target Array in the Given Order | EASY | 85.5 | 86% | Array · Simulation |
| 08 | Longest Substring Without Repeating Characters | MEDIUM | 83.4 | 37% | Hash Table · String · Sliding Window |
| 09 | Maximum Number of Events That Can Be Attended | MEDIUM | 83.4 | 33% | Array · Greedy · Sorting |
| 10 | Block Placement Queries | HARD | 81.1 | 17% | Array · Binary Search · Binary Indexed Tree |
| 11 | Group Anagrams | MEDIUM | 81.1 | 71% | Array · Hash Table · String |
| 12 | Match Alphanumerical Pattern in Matrix I | MEDIUM | 81.1 | 64% | Array · Hash Table · String |
| 13 | Count Nodes With the Highest Score | MEDIUM | 81.1 | 51% | Array · Tree · Depth-First Search |
| 14 | Divisor Game | EASY | 81.1 | 70% | Math · Dynamic Programming · Brainteaser |
| 15 | Two Furthest Houses With Different Colors | EASY | 81.1 | 66% | Array · Greedy |
| 16 | Odd String Difference | EASY | 81.1 | 61% | Array · Hash Table · String |
| 17 | Earliest Possible Day of Full Bloom | HARD | 81.1 | 71% | Array · Greedy · Sorting |
| 18 | LRU Cache | MEDIUM | 75.8 | 45% | Hash Table · Linked List · Design |
| 19 | Longest Common Prefix | EASY | 75.8 | 45% | String · Trie |
| 20 | Valid Parentheses | EASY | 72.6 | 42% | String · Stack |
| 21 | Trapping Rain Water | HARD | 72.6 | 65% | Array · Two Pointers · Dynamic Programming |
| 22 | Search in Rotated Sorted Array | MEDIUM | 72.6 | 43% | Array · Binary Search |
| 23 | Simplify Path | MEDIUM | 68.9 | 48% | String · Stack |
| 24 | Text Justification | HARD | 68.9 | 48% | Array · String · Simulation |
| 25 | Minimum Operations to Write the Letter Y on a Grid | MEDIUM | 64.6 | 62% | Array · Hash Table · Matrix |
| 26 | Number of Adjacent Elements With the Same Color | MEDIUM | 64.6 | 56% | Array |
| 27 | Merge Intervals | MEDIUM | 64.6 | 49% | Array · Sorting |
| 28 | Number of Islands | MEDIUM | 64.6 | 62% | Array · Depth-First Search · Breadth-First Search |
| 29 | Walls and Gates | MEDIUM | 64.6 | 63% | Array · Breadth-First Search · Matrix |
| 30 | Longest Palindromic Substring | MEDIUM | 64.6 | 36% | Two Pointers · String · Dynamic Programming |
| 31 | Reverse Linked List | EASY | 59.3 | 79% | Linked List · Recursion |
| 32 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | MEDIUM | 59.3 | 57% | Array · Queue · Sliding Window |
| 33 | Maximum Subarray | MEDIUM | 59.3 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 34 | Daily Temperatures | MEDIUM | 59.3 | 67% | Array · Stack · Monotonic Stack |
| 35 | Reverse Words in a String | MEDIUM | 59.3 | 52% | Two Pointers · String |
| 36 | Course Schedule | MEDIUM | 59.3 | 49% | Depth-First Search · Breadth-First Search · Graph |
| 37 | Number of Black Blocks | MEDIUM | 52.5 | 39% | Array · Hash Table · Enumeration |
| 38 | Word Ladder | HARD | 52.5 | 43% | Hash Table · String · Breadth-First Search |
| 39 | Top K Frequent Elements | MEDIUM | 52.5 | 65% | Array · Hash Table · Divide and Conquer |
| 40 | Find Peak Element | MEDIUM | 52.5 | 47% | Array · Binary Search |
| 41 | Rotate String | EASY | 52.5 | 64% | String · String Matching |
| 42 | Check If Array Pairs Are Divisible by k | MEDIUM | 52.5 | 46% | Array · Hash Table · Counting |
| 43 | Diameter of Binary Tree | EASY | 52.5 | 64% | Tree · Depth-First Search · Binary Tree |
| 44 | Word Search | MEDIUM | 52.5 | 45% | Array · String · Backtracking |
| 45 | Restore IP Addresses | MEDIUM | 52.5 | 53% | String · Backtracking |
| 46 | Reverse Nodes in k-Group | HARD | 52.5 | 63% | Linked List · Recursion |
| 47 | Shortest Palindrome | HARD | 52.5 | 41% | String · Rolling Hash · String Matching |
| 48 | Roman to Integer | EASY | 52.5 | 65% | Hash Table · Math · String |
| 49 | Number of Matching Subsequences | MEDIUM | 42.9 | 51% | Array · Hash Table · String |
| 50 | Contains Duplicate | EASY | 42.9 | 63% | Array · Hash Table · Sorting |
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 Visa OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- array55 · 65%
- string26 · 31%
- hash table22 · 26%
- sorting14 · 17%
- dynamic programming13 · 15%
- matrix12 · 14%
- two pointers9 · 11%
- math8 · 10%
- binary search7 · 8%
- depth first search7 · 8%
Arrays dominate the assessment because they're the foundation of everything Visa tests: sorting, two-pointers, dynamic programming all live in array space. String problems (26 total) and hash-tables (22 total) are the second and third heaviest hitters. Start with two-pointers and hash-table patterns because they unlock the array problems fast. Dynamic programming shows up 13 times and often combines with arrays or matrices, so drill memoization after you're solid on basic traversals. The hard problems (15 total) cluster around matrix diagonals and advanced data structures like binary indexed trees. You won't have time to memorize every edge case before the OA. That's where StealthCoder becomes your safety net: even if you hit a pattern you haven't drilled, you get a real-time solution that keeps you moving.
Companies with similar patterns
If you prepped for Visa, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Visa.
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 a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Visa interview FAQ
How many array problems should I solve before the Visa OA?+
Array problems make up 65 percent of the tracked set (55 of 84). Aim for 20 to 30 solid reps across easy and medium difficulty before your assessment. Focus on two-pointers, sliding window, and hash-table combos since those appear repeatedly in their actual problems.
Is dynamic programming required for Visa?+
DP appears in 13 problems but usually pairs with arrays or matrices rather than standing alone. It's not the priority. Get comfortable with basic array and string manipulation first, then add DP memoization. Most DP problems here are medium, not hard.
What should I study first for a Visa coding interview?+
Two-pointers and hash-tables. They unlock array and string problems faster than anything else. Two Sum, 3Sum, and Longest Substring Without Repeating Characters are the canonical drills. These patterns repeat across their medium-difficulty set.
Are Visa problems mostly easy or medium?+
57 percent are medium (48 of 84), 25 percent are easy, and 18 percent are hard. Expect medium difficulty to dominate your assessment. Easy problems build confidence but won't prepare you fully. Plan for medium to hard pacing.
Do I need to study matrix and graph problems for Visa?+
Matrix shows up in 12 problems, mostly paired with arrays and DP. Graphs (DFS, BFS) appear in about 7 problems total. They're secondary. If time is tight, focus on array, string, and hash-table first. Matrix drills can come later.