DE Shaw LeetCode interview questions

Explore DE Shaw questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

107

Solved

0 / 107

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Binary Tree Cameras Dynamic Programming Tree Depth-First Search +2 HARD	Hard	100.0%	0.5%
Find Minimum Cost to Remove Array Elements Array Dynamic Programming MEDIUM	Medium	88.3%	0.2%
Maximum Number of Subsequences After One Inserting String Dynamic Programming Greedy +1 MEDIUM	Medium	84.4%	0.3%
Minimum Number of Taps to Open to Water a Garden Array Dynamic Programming Greedy HARD	Hard	77.9%	0.5%
Minimum Size Subarray in Infinite Array Array Hash Table Sliding Window +1 MEDIUM	Medium	77.9%	0.3%
Maximum Points After Collecting Coins From All Nodes Array Dynamic Programming Bit Manipulation +4 HARD	Hard	76.0%	0.4%
Removing Minimum Number of Magic Beans Array Greedy Sorting +2 MEDIUM	Medium	76.0%	0.5%
Maximum Subsequence Score Array Greedy Sorting +1 MEDIUM	Medium	76.0%	0.6%
Maximum Points Tourist Can Earn Array Dynamic Programming Matrix MEDIUM	Medium	76.0%	0.5%
Minimum Runes to Add to Cast Spell Array Depth-First Search Breadth-First Search +2 HARD	Hard	73.8%	0.5%
Letter Combinations of a Phone Number Hash Table String Backtracking MEDIUM	Medium	71.4%	0.7%
Relative Sort Array Array Hash Table Sorting +3 EASY	Easy	71.4%	0.8%
Sliding Window Maximum Array Queue Sliding Window +3 HARD	Hard	71.4%	0.5%
Minimum Cost Walk in Weighted Graph Array Bit Manipulation Union-Find +1 HARD	Hard	71.4%	0.7%
Number of Subarrays With AND Value of K Array Binary Search Bit Manipulation +1 HARD	Hard	71.4%	0.4%
Number of Substrings Containing All Three Characters Hash Table String Sliding Window MEDIUM	Medium	71.4%	0.7%
Maximum Strength of K Disjoint Subarrays Array Dynamic Programming Prefix Sum HARD	Hard	68.8%	0.3%
Find the Sum of the Power of All Subsequences Array Dynamic Programming Knapsack Problem +1 HARD	Hard	68.8%	0.4%
Minimum Deletions to Make String K-Special Hash Table String Greedy +2 MEDIUM	Medium	68.8%	0.7%
Greatest Sum Divisible by Three Array Dynamic Programming Greedy +1 MEDIUM	Medium	68.8%	0.6%

Showing 1–20 of 107 matching problems · All Problems

DE Shaw LeetCode Interview Questions | Grind Practice