Visa LeetCode Interview Questions
Practice 145 coding problems currently tagged to Visa. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
Top Topics at Visa
Ace your Visa interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Visa Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Text Justification 100% | HardH | Solve→ |
Length of Longest V-Shaped Diagonal Segment 98.9% | HardH | Solve→ |
Two Sum 97.8% | EasyE | Solve→ |
Rotating the Box 96.7% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 95.5% | MediumM | Solve→ |
3Sum 92.9% | MediumM | Solve→ |
Minimum Operations to Write the Letter Y on a Grid 92.9% | MediumM | Solve→ |
Split the Array 90% | EasyE | Solve→ |
Find the Length of the Longest Common Prefix 90% | MediumM | Solve→ |
LRU Cache 86.7% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 84.8% | EasyE | Solve→ |
Group Anagrams 80.7% | MediumM | Solve→ |
Block Placement Queries 80.7% | HardH | Solve→ |
Number of Black Blocks 80.7% | MediumM | Solve→ |
Merge Intervals 80.7% | MediumM | Solve→ |
Create Target Array in the Given Order 78.3% | EasyE | Solve→ |
Simplify Path 78.3% | MediumM | Solve→ |
Number of Adjacent Elements With the Same Color 78.3% | MediumM | Solve→ |
Largest Rectangle in Histogram 75.7% | HardH | Solve→ |
Longest Palindromic Substring 72.8% | MediumM | Solve→ |
Trapping Rain Water 72.8% | HardH | Solve→ |
Maximum Subarray 72.8% | MediumM | Solve→ |
Divisor Game 72.8% | EasyE | Solve→ |
Count Nodes With the Highest Score 72.8% | MediumM | Solve→ |
Two Furthest Houses With Different Colors 72.8% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Earliest Possible Day of Full Bloom 72.8% | HardH | Solve→ |
Match Alphanumerical Pattern in Matrix I 72.8% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended 72.8% | MediumM | Solve→ |
Odd String Difference 72.8% | EasyE | Solve→ |
Number of Islands 72.8% | MediumM | Solve→ |
Number of Divisible Triplet Sums 72.8% | MediumM | Solve→ |
Maximum Sum of Alternating Subsequence With Distance at Least K 72.8% | HardH | Solve→ |
Valid Parentheses 69.5% | EasyE | Solve→ |
Longest Common Prefix 65.7% | EasyE | Solve→ |
Minimum Time Difference 65.7% | MediumM | Solve→ |
Minimum Absolute Difference Between Elements With Constraint 65.7% | MediumM | Solve→ |
Beautiful Arrangement 65.7% | MediumM | Solve→ |
Spiral Matrix 61.2% | MediumM | Solve→ |
Reverse Linked List 61.2% | EasyE | Solve→ |
Grid Teleportation Traversal 61.2% | MediumM | Solve→ |
Subarray Sum Equals K 61.2% | MediumM | Solve→ |
Rotate Image 61.2% | MediumM | Solve→ |
Divide Players Into Teams of Equal Skill 61.2% | MediumM | Solve→ |
Count Palindromic Subsequences 61.2% | HardH | Solve→ |
Exclusive Time of Functions 61.2% | MediumM | Solve→ |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 55.8% | MediumM | Solve→ |
Top K Frequent Elements 55.8% | MediumM | Solve→ |
Restore IP Addresses 55.8% | MediumM | Solve→ |
Container With Most Water 55.8% | MediumM | Solve→ |
Merge Two Sorted Lists 55.8% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Valid Parentheses 55.8% | HardH | Solve→ |
Sort Colors 55.8% | MediumM | Solve→ |
Matrix Block Sum 55.8% | MediumM | Solve→ |
Gas Station 55.8% | MediumM | Solve→ |
Number of Changing Keys 55.8% | EasyE | Solve→ |
Minimum Cost Path with Teleportations 55.8% | HardH | Solve→ |
Number of Perfect Pairs 55.8% | MediumM | Solve→ |
Maximum OR 55.8% | MediumM | Solve→ |
Minimum Number of Swaps to Make the String Balanced 55.8% | MediumM | Solve→ |
Walls and Gates 48.7% | MediumM | Solve→ |
Check If Array Pairs Are Divisible by k 48.7% | MediumM | Solve→ |
Diameter of Binary Tree 48.7% | EasyE | Solve→ |
Image Smoother 48.7% | EasyE | Solve→ |
Word Ladder 48.7% | HardH | Solve→ |
Candy Crush 48.7% | MediumM | Solve→ |
Number of Matching Subsequences 48.7% | MediumM | Solve→ |
Balanced Binary Tree 48.7% | EasyE | Solve→ |
Find Median from Data Stream 48.7% | HardH | Solve→ |
Best Time to Buy and Sell Stock II 48.7% | MediumM | Solve→ |
Happy Number 48.7% | EasyE | Solve→ |
Add Binary 48.7% | EasyE | Solve→ |
Add Strings 48.7% | EasyE | Solve→ |
Best Time to Buy and Sell Stock using Strategy 48.7% | MediumM | Solve→ |
Sell Diminishing-Valued Colored Balls 48.7% | MediumM | Solve→ |
Palindrome Partitioning 48.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Ways To Build Good Strings 48.7% | MediumM | Solve→ |
Plus One 39% | EasyE | Solve→ |
Course Schedule 39% | MediumM | Solve→ |
Find Score of an Array After Marking All Elements 39% | MediumM | Solve→ |
Reverse Nodes in k-Group 39% | HardH | Solve→ |
Rotate Array 39% | MediumM | Solve→ |
Valid Anagram 39% | EasyE | Solve→ |
Best Time to Buy and Sell Stock III 39% | HardH | Solve→ |
Find Peak Element 39% | MediumM | Solve→ |
Sliding Window Maximum 39% | HardH | Solve→ |
Partition Equal Subset Sum 39% | MediumM | Solve→ |
Substrings of Size Three with Distinct Characters 39% | EasyE | Solve→ |
Number of Subarrays That Match a Pattern I 39% | MediumM | Solve→ |
House Robber II 39% | MediumM | Solve→ |
Edit Distance 39% | MediumM | Solve→ |
Brightest Position on Street 39% | MediumM | Solve→ |
Contains Duplicate 39% | EasyE | Solve→ |
Sum Root to Leaf Numbers 39% | MediumM | Solve→ |
LFU Cache 39% | HardH | Solve→ |
Longest Increasing Subsequence 39% | MediumM | Solve→ |
Sort Characters By Frequency 39% | MediumM | Solve→ |
Product of Array Except Self 39% | MediumM | Solve→ |
Check if Array Is Sorted and Rotated 39% | EasyE | Solve→ |
Kth Largest Element in an Array 39% | MediumM | Solve→ |
Reverse Vowels of a String 39% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Valid Palindrome II 39% | EasyE | Solve→ |
Two Sum II - Input Array Is Sorted 39% | MediumM | Solve→ |
Ugly Number II 39% | MediumM | Solve→ |
Unique Paths 39% | MediumM | Solve→ |
Restore the Array From Adjacent Pairs 39% | MediumM | Solve→ |
Letter Combinations of a Phone Number 39% | MediumM | Solve→ |
Reconstruct Itinerary 39% | HardH | Solve→ |
Design Memory Allocator 39% | MediumM | Solve→ |
Last Stone Weight 39% | EasyE | Solve→ |
Count Mentions Per User 39% | MediumM | Solve→ |
Maximal Rectangle 39% | HardH | Solve→ |
Add Digits 39% | EasyE | Solve→ |
Candy 39% | HardH | Solve→ |
Alternating Digit Sum 39% | EasyE | Solve→ |
Next Greater Element II 39% | MediumM | Solve→ |
Word Search 39% | MediumM | Solve→ |
Merge Sorted Array 39% | EasyE | Solve→ |
Rotting Oranges 39% | MediumM | Solve→ |
Subarray Sums Divisible by K 39% | MediumM | Solve→ |
Longest Consecutive Sequence 39% | MediumM | Solve→ |
Valid Palindrome 39% | EasyE | Solve→ |
First Unique Character in a String 39% | EasyE | Solve→ |
Count Good Numbers 39% | MediumM | Solve→ |
Hand of Straights 39% | MediumM | Solve→ |
Non-overlapping Intervals 39% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximal Score After Applying K Operations 39% | MediumM | Solve→ |
Flood Fill 39% | EasyE | Solve→ |
Meeting Rooms II 39% | MediumM | Solve→ |
Word Break 39% | MediumM | Solve→ |
Word Break II 39% | HardH | Solve→ |
Maximum Palindromes After Operations 39% | MediumM | Solve→ |
Jump Game VI 39% | MediumM | Solve→ |
Path With Minimum Effort 39% | MediumM | Solve→ |
Capacity To Ship Packages Within D Days 39% | MediumM | Solve→ |
Minimum Suffix Flips 39% | MediumM | Solve→ |
Longest Common Subsequence 39% | MediumM | Solve→ |
Minimize Maximum of Array 39% | MediumM | Solve→ |
Binary Tree Level Order Traversal 39% | MediumM | Solve→ |
Word Search II 39% | HardH | Solve→ |
Kth Largest Sum in a Binary Tree 39% | MediumM | Solve→ |
Longest Non-decreasing Subarray From Two Arrays 39% | MediumM | Solve→ |
Search in Rotated Sorted Array 39% | MediumM | Solve→ |
Unique Length-3 Palindromic Subsequences 39% | MediumM | Solve→ |
Best Time to Buy and Sell Stock IV 39% | HardH | Solve→ |
Jump Game 39% | MediumM | Solve→ |
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Visa?
Our current Visa practice dataset contains 145 tagged coding problems, including Text Justification, Length of Longest V-Shaped Diagonal Segment, Two Sum. The difficulty breakdown is 32 Easy, 91 Medium, and 22 Hard problems.
How should I prepare for a Visa coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Visa interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Visa coding interviews?
Based on our data, Visa interviews include 32 Easy (22%), 91 Medium (63%), and 22 Hard (15%) problems.
Ready to ace your Visa interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required