Viasat LeetCode Interview Questions
Practice 43 real coding problems frequently asked in Viasat technical interviews. Master these questions to ace your next Viasat software engineering interview.
Top Topics at Viasat
Ace your Viasat interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Viasat Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
All Nodes Distance K in Binary Tree 100% | MediumM | Solve→ |
Valid Anagram 93% | EasyE | Solve→ |
Subarray Sum Equals K 92% | MediumM | Solve→ |
Binary Tree Vertical Order Traversal 89% | MediumM | Solve→ |
Boundary of Binary Tree 87% | MediumM | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 83% | MediumM | Solve→ |
Fraction to Recurring Decimal 81% | MediumM | Solve→ |
Linked List Cycle 81% | EasyE | Solve→ |
Number of Islands 78% | MediumM | Solve→ |
Split Array Largest Sum 78% | HardH | Solve→ |
Longest Increasing Subsequence 74% | MediumM | Solve→ |
Find K Closest Elements 73% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 71% | MediumM | Solve→ |
Flip Columns For Maximum Number of Equal Rows 71% | MediumM | Solve→ |
Longest Increasing Path in a Matrix 66% | HardH | Solve→ |
Find Longest Self-Contained Substring 65% | HardH | Solve→ |
Continuous Subarray Sum 62% | MediumM | Solve→ |
Largest Rectangle in Histogram 61% | HardH | Solve→ |
Sliding Window Maximum 60% | HardH | Solve→ |
Remove All Adjacent Duplicates In String 59% | EasyE | Solve→ |
Count Unhappy Friends 59% | MediumM | Solve→ |
Shortest Word Distance II 59% | MediumM | Solve→ |
Sort Integers by The Power Value 53% | MediumM | Solve→ |
Next Permutation 53% | MediumM | Solve→ |
Word Break II 52% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Area Rectangle With Point Constraints I 51% | MediumM | Solve→ |
Implement Queue using Stacks 50% | EasyE | Solve→ |
Find Peak Element 50% | MediumM | Solve→ |
Remove All Adjacent Duplicates in String II 50% | MediumM | Solve→ |
Coin Change II 44% | MediumM | Solve→ |
Longest Consecutive Sequence 44% | MediumM | Solve→ |
Subarrays with K Different Integers 42% | HardH | Solve→ |
Frequency of the Most Frequent Element 41% | MediumM | Solve→ |
Container With Most Water 41% | MediumM | Solve→ |
Maximum Sum Circular Subarray 39% | MediumM | Solve→ |
Minimum Path Sum 39% | MediumM | Solve→ |
Max Stack 30% | HardH | Solve→ |
Basic Calculator II 30% | MediumM | Solve→ |
Rotting Oranges 27% | MediumM | Solve→ |
Simplify Path 24% | MediumM | Solve→ |
Maximum Product Subarray 24% | MediumM | Solve→ |
Design Hit Counter 23% | MediumM | Solve→ |
Bus Routes 20% | HardH | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Viasat ask in interviews?
Viasat commonly asks 43 coding problems in technical interviews, including All Nodes Distance K in Binary Tree, Valid Anagram, Subarray Sum Equals K. The difficulty breakdown is 4 Easy, 30 Medium, and 9 Hard problems.
How should I prepare for a Viasat coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Viasat interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Viasat coding interviews?
Based on our data, Viasat interviews include 4 Easy (9%), 30 Medium (70%), and 9 Hard (21%) problems.
Ready to ace your Viasat interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required