Springworks Therapeutics LeetCode Interview Questions

Practice 45 coding problems currently tagged to Springworks Therapeutics. Use the frequency and topic signals to build a focused software engineering interview practice plan.

14 Easy

27 Medium

4 Hard

Using AI during your Springworks Therapeutics interview

AI Interview Copilot →

How the copilot answers coding, system design and behavioral questions live.

Coding Interview Copilot →

Screenshot the problem, get the approach, complexity and code.

AI Interview Assistant →

Listens to the interviewer and answers spoken questions, even from your phone.

Problem	DifficultyDiff	Frequency	Topics	Action
Walls and Gates 100%	MediumM	100%	Array Breadth-First Search+1	Solve→
Recyclable and Low Fat Products 99%	EasyE	99%	Database	Solve→
Two Sum II - Input Array Is Sorted 96%	MediumM	96%	Array Two Pointers+1	Solve→
Remove Stones to Minimize the Total 96%	MediumM	96%	Array Greedy+1	Solve→
Word Search 95%	MediumM	95%	Array String+2	Solve→
Valid Palindrome II 90%	EasyE	90%	Two Pointers String+1	Solve→
Remove All Adjacent Duplicates In String 84%	EasyE	84%	String Stack	Solve→
Maximum Nesting Depth of the Parentheses 84%	EasyE	84%	String Stack	Solve→
Subarrays with K Different Integers 83%	HardH	83%	Array Hash Table+2	Solve→
Product of Array Except Self 83%	MediumM	83%	Array Prefix Sum	Solve→
Valid Anagram 81%	EasyE	81%	Hash Table String+1	Solve→
Merge Strings Alternately 78%	EasyE	78%	Two Pointers String	Solve→
Adding Spaces to a String 76%	MediumM	76%	Array Two Pointers+2	Solve→
Lowest Common Ancestor of a Binary Search Tree 70%	MediumM	70%	Tree Depth-First Search+2	Solve→
Find K Closest Elements 69%	MediumM	69%	Array Two Pointers+4	Solve→
First Unique Character in a String 68%	EasyE	68%	Hash Table String+2	Solve→
Invalid Transactions 67%	MediumM	67%	Array Hash Table+2	Solve→
Permutations 67%	MediumM	67%	Array Backtracking	Solve→
Flip Columns For Maximum Number of Equal Rows 66%	MediumM	66%	Array Hash Table+1	Solve→
Longest Palindromic Substring 66%	MediumM	66%	Two Pointers String+1	Solve→
Single Number 65%	EasyE	65%	Array Bit Manipulation	Solve→
Shortest Word Distance II 65%	MediumM	65%	Array Hash Table+3	Solve→
Maximum Profit in Job Scheduling 61%	HardH	61%	Array Binary Search+2	Solve→
Buildings With an Ocean View 59%	MediumM	59%	Array Stack+1	Solve→
K Closest Points to Origin 57%	MediumM	57%	Array Math+5	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Kth Missing Positive Number 57%	EasyE	57%	Array Binary Search	Solve→
Subsets 54%	MediumM	54%	Array Backtracking+1	Solve→
Maximum Number of Occurrences of a Substring 53%	MediumM	53%	Hash Table String+1	Solve→
Check if One String Swap Can Make Strings Equal 51%	EasyE	51%	Hash Table String+1	Solve→
Unique Paths 49%	MediumM	49%	Math Dynamic Programming+1	Solve→
Ransom Note 47%	EasyE	47%	Hash Table String+1	Solve→
Kth Smallest Element in a Sorted Matrix 46%	MediumM	46%	Array Binary Search+3	Solve→
Longest Substring Without Repeating Characters 46%	MediumM	46%	Hash Table String+1	Solve→
Longest Common Prefix 43%	EasyE	43%	String Trie	Solve→
Maximize Amount After Two Days of Conversions 40%	MediumM	40%	Array String+3	Solve→
Find Leaves of Binary Tree 36%	MediumM	36%	Tree Depth-First Search+1	Solve→
Binary Tree Right Side View 34%	MediumM	34%	Tree Depth-First Search+2	Solve→
Integer to Roman 33%	MediumM	33%	Hash Table Math+1	Solve→
Course Schedule 33%	MediumM	33%	Depth-First Search Breadth-First Search+2	Solve→
Palindrome Number 32%	EasyE	32%	Math	Solve→
Longest Increasing Path in a Matrix 32%	HardH	32%	Array Dynamic Programming+6	Solve→
Kth Smallest Element in a BST 25%	MediumM	25%	Tree Depth-First Search+2	Solve→
Open the Lock 24%	MediumM	24%	Array Hash Table+2	Solve→
Binary Tree Maximum Path Sum 23%	HardH	23%	Dynamic Programming Tree+2	Solve→
Pascal's Triangle 20%	EasyE	20%	Array Dynamic Programming	Solve→

Explore company practice sets with a similar number of tagged coding questions.

Frequently Asked Questions

What LeetCode problems are tagged to Springworks Therapeutics?

Our current Springworks Therapeutics practice dataset contains 45 tagged coding problems, including Walls and Gates, Recyclable and Low Fat Products, Two Sum II - Input Array Is Sorted. The difficulty breakdown is 14 Easy, 27 Medium, and 4 Hard problems.

How should I prepare for a Springworks Therapeutics coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Springworks Therapeutics interviews typically emphasize Array and String. Practice explaining your thought process while coding.

What is the difficulty level of Springworks Therapeutics coding interviews?

Based on our data, Springworks Therapeutics interviews include 14 Easy (31%), 27 Medium (60%), and 4 Hard (9%) problems.

Ready to ace your Springworks Therapeutics interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

Springworks Therapeutics LeetCode Interview Questions

Practice 45 coding problems currently tagged to Springworks Therapeutics. Use the frequency and topic signals to build a focused software engineering interview practice plan.

14 Easy

27 Medium

4 Hard

Using AI during your Springworks Therapeutics interview

Problem	DifficultyDiff	Frequency	Topics	Action
Walls and Gates 100%	MediumM	100%	Array Breadth-First Search+1	Solve→
Recyclable and Low Fat Products 99%	EasyE	99%	Database	Solve→
Two Sum II - Input Array Is Sorted 96%	MediumM	96%	Array Two Pointers+1	Solve→
Remove Stones to Minimize the Total 96%	MediumM	96%	Array Greedy+1	Solve→
Word Search 95%	MediumM	95%	Array String+2	Solve→
Valid Palindrome II 90%	EasyE	90%	Two Pointers String+1	Solve→
Remove All Adjacent Duplicates In String 84%	EasyE	84%	String Stack	Solve→
Maximum Nesting Depth of the Parentheses 84%	EasyE	84%	String Stack	Solve→
Subarrays with K Different Integers 83%	HardH	83%	Array Hash Table+2	Solve→
Product of Array Except Self 83%	MediumM	83%	Array Prefix Sum	Solve→
Valid Anagram 81%	EasyE	81%	Hash Table String+1	Solve→
Merge Strings Alternately 78%	EasyE	78%	Two Pointers String	Solve→
Adding Spaces to a String 76%	MediumM	76%	Array Two Pointers+2	Solve→
Lowest Common Ancestor of a Binary Search Tree 70%	MediumM	70%	Tree Depth-First Search+2	Solve→
Find K Closest Elements 69%	MediumM	69%	Array Two Pointers+4	Solve→
First Unique Character in a String 68%	EasyE	68%	Hash Table String+2	Solve→
Invalid Transactions 67%	MediumM	67%	Array Hash Table+2	Solve→
Permutations 67%	MediumM	67%	Array Backtracking	Solve→
Flip Columns For Maximum Number of Equal Rows 66%	MediumM	66%	Array Hash Table+1	Solve→
Longest Palindromic Substring 66%	MediumM	66%	Two Pointers String+1	Solve→
Single Number 65%	EasyE	65%	Array Bit Manipulation	Solve→
Shortest Word Distance II 65%	MediumM	65%	Array Hash Table+3	Solve→
Maximum Profit in Job Scheduling 61%	HardH	61%	Array Binary Search+2	Solve→
Buildings With an Ocean View 59%	MediumM	59%	Array Stack+1	Solve→
K Closest Points to Origin 57%	MediumM	57%	Array Math+5	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Kth Missing Positive Number 57%	EasyE	57%	Array Binary Search	Solve→
Subsets 54%	MediumM	54%	Array Backtracking+1	Solve→
Maximum Number of Occurrences of a Substring 53%	MediumM	53%	Hash Table String+1	Solve→
Check if One String Swap Can Make Strings Equal 51%	EasyE	51%	Hash Table String+1	Solve→
Unique Paths 49%	MediumM	49%	Math Dynamic Programming+1	Solve→
Ransom Note 47%	EasyE	47%	Hash Table String+1	Solve→
Kth Smallest Element in a Sorted Matrix 46%	MediumM	46%	Array Binary Search+3	Solve→
Longest Substring Without Repeating Characters 46%	MediumM	46%	Hash Table String+1	Solve→
Longest Common Prefix 43%	EasyE	43%	String Trie	Solve→
Maximize Amount After Two Days of Conversions 40%	MediumM	40%	Array String+3	Solve→
Find Leaves of Binary Tree 36%	MediumM	36%	Tree Depth-First Search+1	Solve→
Binary Tree Right Side View 34%	MediumM	34%	Tree Depth-First Search+2	Solve→
Integer to Roman 33%	MediumM	33%	Hash Table Math+1	Solve→
Course Schedule 33%	MediumM	33%	Depth-First Search Breadth-First Search+2	Solve→
Palindrome Number 32%	EasyE	32%	Math	Solve→
Longest Increasing Path in a Matrix 32%	HardH	32%	Array Dynamic Programming+6	Solve→
Kth Smallest Element in a BST 25%	MediumM	25%	Tree Depth-First Search+2	Solve→
Open the Lock 24%	MediumM	24%	Array Hash Table+2	Solve→
Binary Tree Maximum Path Sum 23%	HardH	23%	Dynamic Programming Tree+2	Solve→
Pascal's Triangle 20%	EasyE	20%	Array Dynamic Programming	Solve→