Amrock LeetCode Interview Questions
Practice 45 real coding problems frequently asked in Amrock technical interviews. Master these questions to ace your next Amrock software engineering interview.
Top Topics at Amrock
Ace your Amrock interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Amrock Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Longest Repeating Character Replacement 100% | MediumM | Solve→ |
Word Break 99% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 99% | MediumM | Solve→ |
Valid Palindrome II 94% | EasyE | Solve→ |
Bus Routes 92% | HardH | Solve→ |
Jump Game II 88% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 84% | MediumM | Solve→ |
Is Subsequence 81% | EasyE | Solve→ |
Find First and Last Position of Element in Sorted Array 76% | MediumM | Solve→ |
Minimum Area Rectangle 74% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 74% | MediumM | Solve→ |
Add Two Integers 74% | EasyE | Solve→ |
Reveal Cards In Increasing Order 69% | MediumM | Solve→ |
Koko Eating Bananas 67% | MediumM | Solve→ |
Zero Array Transformation II 66% | MediumM | Solve→ |
Design an Array Statistics Tracker 65% | HardH | Solve→ |
Check If N and Its Double Exist 64% | EasyE | Solve→ |
Minimum Add to Make Parentheses Valid 61% | MediumM | Solve→ |
Unique Paths 60% | MediumM | Solve→ |
Number of Islands II 56% | HardH | Solve→ |
First Unique Character in a String 55% | EasyE | Solve→ |
LFU Cache 55% | HardH | Solve→ |
Generate Parentheses 54% | MediumM | Solve→ |
Remove Element 53% | EasyE | Solve→ |
Check if One String Swap Can Make Strings Equal 53% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Arithmetic Subsequence of Given Difference 51% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 50% | MediumM | Solve→ |
Coin Change II 49% | MediumM | Solve→ |
Longest Common Prefix 46% | EasyE | Solve→ |
Unique Paths II 45% | MediumM | Solve→ |
Sum Root to Leaf Numbers 42% | MediumM | Solve→ |
Word Ladder 39% | HardH | Solve→ |
Walls and Gates 38% | MediumM | Solve→ |
Same Tree 37% | EasyE | Solve→ |
Find K Pairs with Smallest Sums 35% | MediumM | Solve→ |
Maximum Units on a Truck 32% | EasyE | Solve→ |
Longest Subarray of 1's After Deleting One Element 31% | MediumM | Solve→ |
Find Longest Self-Contained Substring 30% | HardH | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 27% | EasyE | Solve→ |
Sliding Window Maximum 23% | HardH | Solve→ |
Design Hit Counter 22% | MediumM | Solve→ |
Top K Frequent Elements 21% | MediumM | Solve→ |
Expression Add Operators 21% | HardH | Solve→ |
Merge Sorted Array 20% | EasyE | Solve→ |
Coin Change 20% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Amrock ask in interviews?
Amrock commonly asks 45 coding problems in technical interviews, including Longest Repeating Character Replacement, Word Break, Lowest Common Ancestor of a Binary Tree. The difficulty breakdown is 12 Easy, 25 Medium, and 8 Hard problems.
How should I prepare for a Amrock coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Amrock interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Amrock coding interviews?
Based on our data, Amrock interviews include 12 Easy (27%), 25 Medium (56%), and 8 Hard (18%) problems.
Ready to ace your Amrock interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required