- Interview Questions
- /
- Goodrx
Goodrx LeetCode Interview Questions
Practice 46 real coding problems frequently asked in Goodrx technical interviews. Master these questions to ace your next Goodrx software engineering interview.
Top Topics at Goodrx
Ace your Goodrx interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Goodrx Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Remove All Occurrences of a Substring 100% | MediumM | Solve→ |
Sort Colors 92% | MediumM | Solve→ |
Minimum Difference in Sums After Removal of Elements 86% | HardH | Solve→ |
Create Hello World Function 84% | EasyE | Solve→ |
Longest Subarray of 1's After Deleting One Element 84% | MediumM | Solve→ |
Spiral Matrix 81% | MediumM | Solve→ |
Count Unhappy Friends 77% | MediumM | Solve→ |
Continuous Subarrays 73% | MediumM | Solve→ |
Minimum Path Sum 73% | MediumM | Solve→ |
Missing Ranges 72% | EasyE | Solve→ |
Largest Number 72% | MediumM | Solve→ |
Number of Distinct Islands 70% | MediumM | Solve→ |
Nested List Weight Sum 70% | MediumM | Solve→ |
Analyze User Website Visit Pattern 69% | MediumM | Solve→ |
Ways to Make a Fair Array 68% | MediumM | Solve→ |
N-Queens 68% | HardH | Solve→ |
Subarrays with K Different Integers 68% | HardH | Solve→ |
Design Snake Game 68% | MediumM | Solve→ |
Find K Closest Elements 67% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 65% | MediumM | Solve→ |
Sliding Window Maximum 63% | HardH | Solve→ |
Fraction to Recurring Decimal 61% | MediumM | Solve→ |
Accounts Merge 60% | MediumM | Solve→ |
LFU Cache 60% | HardH | Solve→ |
Generate Parentheses 59% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Merge k Sorted Lists 57% | HardH | Solve→ |
Find K Pairs with Smallest Sums 57% | MediumM | Solve→ |
Valid Sudoku 56% | MediumM | Solve→ |
Combination Sum II 54% | MediumM | Solve→ |
Subsets II 53% | MediumM | Solve→ |
Binary Tree Vertical Order Traversal 49% | MediumM | Solve→ |
Number of Islands 45% | MediumM | Solve→ |
Group Anagrams 43% | MediumM | Solve→ |
House Robber II 42% | MediumM | Solve→ |
Number of Ships in a Rectangle 42% | HardH | Solve→ |
Populating Next Right Pointers in Each Node 40% | MediumM | Solve→ |
First Missing Positive 39% | HardH | Solve→ |
Basic Calculator 39% | HardH | Solve→ |
K Closest Points to Origin 32% | MediumM | Solve→ |
Diagonal Traverse 30% | MediumM | Solve→ |
Find Leaves of Binary Tree 28% | MediumM | Solve→ |
Check if One String Swap Can Make Strings Equal 27% | EasyE | Solve→ |
Minimum Array Sum 24% | MediumM | Solve→ |
Longest Consecutive Sequence 23% | MediumM | Solve→ |
Daily Temperatures 22% | MediumM | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 20% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Goodrx ask in interviews?
Goodrx commonly asks 46 coding problems in technical interviews, including Remove All Occurrences of a Substring, Sort Colors, Minimum Difference in Sums After Removal of Elements. The difficulty breakdown is 4 Easy, 33 Medium, and 9 Hard problems.
How should I prepare for a Goodrx coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Goodrx interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Goodrx coding interviews?
Based on our data, Goodrx interviews include 4 Easy (9%), 33 Medium (72%), and 9 Hard (20%) problems.
Ready to ace your Goodrx interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required