Peraton LeetCode Interview Questions
Practice 42 real coding problems frequently asked in Peraton technical interviews. Master these questions to ace your next Peraton software engineering interview.
Top Topics at Peraton
Ace your Peraton interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Peraton Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Remove All Adjacent Duplicates in String II 100% | MediumM | Solve→ |
String Compression 95% | MediumM | Solve→ |
Longest Arithmetic Subsequence of Given Difference 93% | MediumM | Solve→ |
Shortest Path in Binary Matrix 89% | MediumM | Solve→ |
Generate Parentheses 84% | MediumM | Solve→ |
Maximum Matrix Sum 82% | MediumM | Solve→ |
Max Stack 76% | HardH | Solve→ |
Walls and Gates 75% | MediumM | Solve→ |
Maximize Amount After Two Days of Conversions 74% | MediumM | Solve→ |
Create Hello World Function 73% | EasyE | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 73% | MediumM | Solve→ |
Combination Sum II 72% | MediumM | Solve→ |
Binary Search Tree Iterator 70% | MediumM | Solve→ |
Making A Large Island 67% | HardH | Solve→ |
Flip Columns For Maximum Number of Equal Rows 65% | MediumM | Solve→ |
Subarray Sum Equals K 64% | MediumM | Solve→ |
Largest Number 64% | MediumM | Solve→ |
Open the Lock 63% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 61% | MediumM | Solve→ |
Is Subsequence 60% | EasyE | Solve→ |
Maximum Product Subarray 60% | MediumM | Solve→ |
Range Sum of BST 60% | EasyE | Solve→ |
Valid Word Abbreviation 58% | EasyE | Solve→ |
Add Two Integers 57% | EasyE | Solve→ |
Maximum Beauty of an Array After Applying Operation 56% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
The kth Factor of n 56% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 55% | HardH | Solve→ |
Basic Calculator 55% | HardH | Solve→ |
Digit Operations to Make Two Integers Equal 49% | MediumM | Solve→ |
Word Search 40% | MediumM | Solve→ |
Identify the Largest Outlier in an Array 39% | MediumM | Solve→ |
Binary Tree Right Side View 38% | MediumM | Solve→ |
Isomorphic Strings 35% | EasyE | Solve→ |
Convert Sorted List to Binary Search Tree 33% | MediumM | Solve→ |
Letter Combinations of a Phone Number 31% | MediumM | Solve→ |
Minimum Window Substring 30% | HardH | Solve→ |
Design Snake Game 28% | MediumM | Solve→ |
Subarrays with K Different Integers 27% | HardH | Solve→ |
Find Leaves of Binary Tree 24% | MediumM | Solve→ |
Copy List with Random Pointer 24% | MediumM | Solve→ |
Number of Islands 23% | MediumM | Solve→ |
Valid Sudoku 21% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Peraton ask in interviews?
Peraton commonly asks 42 coding problems in technical interviews, including Remove All Adjacent Duplicates in String II, String Compression, Longest Arithmetic Subsequence of Given Difference. The difficulty breakdown is 6 Easy, 30 Medium, and 6 Hard problems.
How should I prepare for a Peraton coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Peraton interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Peraton coding interviews?
Based on our data, Peraton interviews include 6 Easy (14%), 30 Medium (71%), and 6 Hard (14%) problems.
Ready to ace your Peraton interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required