Checkr LeetCode Interview Questions
Practice 42 real coding problems frequently asked in Checkr technical interviews. Master these questions to ace your next Checkr software engineering interview.
Top Topics at Checkr
Ace your Checkr interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Checkr Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Find Leaves of Binary Tree 100% | MediumM | Solve→ |
Line Reflection 96% | MediumM | Solve→ |
Shortest Path in Binary Matrix 92% | MediumM | Solve→ |
Largest Rectangle in Histogram 88% | HardH | Solve→ |
Maximum Size Subarray Sum Equals k 81% | MediumM | Solve→ |
Fraction to Recurring Decimal 81% | MediumM | Solve→ |
Flood Fill 80% | EasyE | Solve→ |
K-diff Pairs in an Array 75% | MediumM | Solve→ |
Vertical Order Traversal of a Binary Tree 74% | HardH | Solve→ |
Maximum Number of Occurrences of a Substring 69% | MediumM | Solve→ |
Valid Number 68% | HardH | Solve→ |
Find Longest Self-Contained Substring 67% | HardH | Solve→ |
Insert Delete GetRandom O(1) 67% | MediumM | Solve→ |
House Robber 65% | MediumM | Solve→ |
Maximum Sum Circular Subarray 65% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended 65% | MediumM | Solve→ |
Design an Array Statistics Tracker 63% | HardH | Solve→ |
Valid Anagram 62% | EasyE | Solve→ |
Walls and Gates 62% | MediumM | Solve→ |
Maximum Value at a Given Index in a Bounded Array 57% | MediumM | Solve→ |
Shortest Palindrome 54% | HardH | Solve→ |
Unique Paths II 54% | MediumM | Solve→ |
Add Two Integers 51% | EasyE | Solve→ |
Gas Station 49% | MediumM | Solve→ |
Random Pick Index 45% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sum Root to Leaf Numbers 44% | MediumM | Solve→ |
Reverse Integer 44% | MediumM | Solve→ |
Asteroid Collision 40% | MediumM | Solve→ |
Zero Array Transformation I 38% | MediumM | Solve→ |
Find Peak Element 38% | MediumM | Solve→ |
Closest Binary Search Tree Value 33% | EasyE | Solve→ |
Reverse Linked List 32% | EasyE | Solve→ |
Search in Rotated Sorted Array 31% | MediumM | Solve→ |
Palindrome Number 31% | EasyE | Solve→ |
Course Schedule 30% | MediumM | Solve→ |
Design Snake Game 27% | MediumM | Solve→ |
Reverse Words in a String 26% | MediumM | Solve→ |
Zero Array Transformation II 25% | MediumM | Solve→ |
Palindrome Linked List 25% | EasyE | Solve→ |
Maximum Nesting Depth of the Parentheses 23% | EasyE | Solve→ |
All Nodes Distance K in Binary Tree 22% | MediumM | Solve→ |
Kth Smallest Element in a BST 21% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Checkr ask in interviews?
Checkr commonly asks 42 coding problems in technical interviews, including Find Leaves of Binary Tree, Line Reflection, Shortest Path in Binary Matrix. The difficulty breakdown is 8 Easy, 28 Medium, and 6 Hard problems.
How should I prepare for a Checkr coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Checkr interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Checkr coding interviews?
Based on our data, Checkr interviews include 8 Easy (19%), 28 Medium (67%), and 6 Hard (14%) problems.
Ready to ace your Checkr interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required