Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. The D E Shaw Group

The D E Shaw Group LeetCode Interview Questions

Practice 116 coding problems currently tagged to The D E Shaw Group. Use the frequency and topic signals to build a focused software engineering interview practice plan.

Last updated: September 28, 2026

14 Easy
71 Medium
31 Hard

Top Topics at The D E Shaw Group

ArrayDynamic ProgrammingStringHash TableSorting

Ace your The D E Shaw Group interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

The D E Shaw Group Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Binary Tree Cameras
100%
HardH
100%
Dynamic ProgrammingTree+3
Solve→
Find Minimum Cost to Remove Array Elements
87%
MediumM
87%
ArrayDynamic Programming
Solve→
Maximum Number of Subsequences After One Inserting
83.1%
MediumM
83.1%
StringDynamic Programming+2
Solve→
Minimum Number of Taps to Open to Water a Garden
78.5%
HardH
78.5%
ArrayDynamic Programming+1
Solve→
Minimum Size Subarray in Infinite Array
76.7%
MediumM
76.7%
ArrayHash Table+2
Solve→
Letter Combinations of a Phone Number
74.7%
MediumM
74.7%
Hash TableString+1
Solve→
Maximum Points After Collecting Coins From All Nodes
74.7%
HardH
74.7%
ArrayDynamic Programming+5
Solve→
Maximum Subsequence Score
74.7%
MediumM
74.7%
ArrayGreedy+2
Solve→
Maximum Points Tourist Can Earn
74.7%
MediumM
74.7%
ArrayDynamic Programming+1
Solve→
Find Peak Calling Hours for Each City
72.6%
MediumM
72.6%
Database
Solve→
Minimize Connected Groups by Inserting Interval
72.6%
MediumM
72.6%
ArrayBinary Search+2
Solve→
Minimum Runes to Add to Cast Spell
72.6%
HardH
72.6%
ArrayDepth-First Search+3
Solve→
Relative Sort Array
70.3%
EasyE
70.3%
ArrayHash Table+4
Solve→
Removing Minimum Number of Magic Beans
70.3%
MediumM
70.3%
ArrayGreedy+3
Solve→
Minimum Cost Walk in Weighted Graph
70.3%
HardH
70.3%
ArrayBit Manipulation+2
Solve→
Number of Subarrays With AND Value of K
70.3%
HardH
70.3%
ArrayBinary Search+2
Solve→
Number of Substrings Containing All Three Characters
70.3%
MediumM
70.3%
Hash TableString+1
Solve→
Max Number of K-Sum Pairs
70.3%
MediumM
70.3%
ArrayHash Table+2
Solve→
Sum Game
70.3%
MediumM
70.3%
MathString+2
Solve→
Sliding Window Maximum
67.6%
HardH
67.6%
ArrayQueue+4
Solve→
Maximum Strength of K Disjoint Subarrays
67.6%
HardH
67.6%
ArrayDynamic Programming+1
Solve→
Find the Sum of the Power of All Subsequences
67.6%
HardH
67.6%
ArrayDynamic Programming+2
Solve→
Minimum Deletions to Make String K-Special
67.6%
MediumM
67.6%
Hash TableString+3
Solve→
Greatest Sum Divisible by Three
67.6%
MediumM
67.6%
ArrayDynamic Programming+2
Solve→
Query Kth Smallest Trimmed Number
67.6%
MediumM
67.6%
ArrayString+5
Solve→

Pass your interview with AI assistance

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

Start Free Trial
Equal Row and Column Pairs
67.6%
MediumM
67.6%
ArrayHash Table+2
Solve→
Maximum Deletions on a String
67.6%
HardH
67.6%
StringDynamic Programming+3
Solve→
Median of a Row Wise Sorted Matrix
67.6%
MediumM
67.6%
ArrayBinary Search+1
Solve→
Determine the Winner of a Bowling Game
67.6%
EasyE
67.6%
ArraySimulation
Solve→
Take Gifts From the Richest Pile
67.6%
EasyE
67.6%
ArrayHeap (Priority Queue)+1
Solve→
Find the Maximum Divisibility Score
67.6%
EasyE
67.6%
Array
Solve→
Shortest String That Contains Three Strings
67.6%
MediumM
67.6%
StringGreedy+1
Solve→
Minimum Number of Refueling Stops
67.6%
HardH
67.6%
ArrayDynamic Programming+2
Solve→
Reorganize String
64.6%
MediumM
64.6%
Hash TableString+4
Solve→
Kth Smallest Number in Multiplication Table
61.2%
HardH
61.2%
MathBinary Search
Solve→
Count Binary Substrings
61.2%
EasyE
61.2%
Two PointersString
Solve→
Median of Two Sorted Arrays
57.1%
HardH
57.1%
ArrayBinary Search+1
Solve→
Trapping Rain Water
57.1%
HardH
57.1%
ArrayTwo Pointers+3
Solve→
Maximum Product Subarray
57.1%
MediumM
57.1%
ArrayDynamic Programming
Solve→
Insert Delete GetRandom O(1)
57.1%
MediumM
57.1%
ArrayHash Table+3
Solve→
Count the Number of Incremovable Subarrays II
57.1%
HardH
57.1%
ArrayTwo Pointers+1
Solve→
Majority Element
57.1%
EasyE
57.1%
ArrayHash Table+4
Solve→
Using a Robot to Print the Lexicographically Smallest String
57.1%
MediumM
57.1%
Hash TableString+2
Solve→
Asteroid Collision
57.1%
MediumM
57.1%
ArrayStack+1
Solve→
Furthest Building You Can Reach
57.1%
MediumM
57.1%
ArrayGreedy+1
Solve→
Longest Repeating Character Replacement
57.1%
MediumM
57.1%
Hash TableString+1
Solve→
Valid Parentheses
52.2%
EasyE
52.2%
StringStack+1
Solve→
K-th Symbol in Grammar
52.2%
MediumM
52.2%
MathBit Manipulation+1
Solve→
LRU Cache
52.2%
MediumM
52.2%
Hash TableLinked List+2
Solve→
Longest Substring Without Repeating Characters
52.2%
MediumM
52.2%
Hash TableString+1
Solve→

Pass your interview with AI assistance

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

Start Free Trial
Longest Consecutive Sequence
45.8%
MediumM
45.8%
ArrayHash Table+1
Solve→
K-th Smallest in Lexicographical Order
45.8%
HardH
45.8%
Trie
Solve→
Put Marbles in Bags
45.8%
HardH
45.8%
ArrayGreedy+2
Solve→
Minimum Number of Visited Cells in a Grid
45.8%
HardH
45.8%
ArrayDynamic Programming+6
Solve→
Find the Smallest Divisor Given a Threshold
45.8%
MediumM
45.8%
ArrayBinary Search
Solve→
Heaters
45.8%
MediumM
45.8%
ArrayTwo Pointers+2
Solve→
Shortest Subarray to be Removed to Make Array Sorted
45.8%
MediumM
45.8%
ArrayTwo Pointers+3
Solve→
Consecutive Numbers Sum
45.8%
HardH
45.8%
MathEnumeration
Solve→
Coin Change II
45.8%
MediumM
45.8%
ArrayDynamic Programming+2
Solve→
Longest String Chain
45.8%
MediumM
45.8%
ArrayHash Table+4
Solve→
Maximize Score of Numbers in Ranges
45.8%
MediumM
45.8%
ArrayBinary Search+2
Solve→
Sum of Subarray Ranges
45.8%
MediumM
45.8%
ArrayStack+1
Solve→
Text Justification
45.8%
HardH
45.8%
ArrayString+1
Solve→
Find Triangular Sum of an Array
45.8%
MediumM
45.8%
ArrayMath+3
Solve→
Number of Islands
45.8%
MediumM
45.8%
ArrayDepth-First Search+3
Solve→
Rotting Oranges
45.8%
MediumM
45.8%
ArrayBreadth-First Search+1
Solve→
Minimum Cost to Merge Stones
45.8%
HardH
45.8%
ArrayDynamic Programming+1
Solve→
Search a 2D Matrix
45.8%
MediumM
45.8%
ArrayBinary Search+1
Solve→
Count Vowel Substrings of a String
45.8%
EasyE
45.8%
Hash TableString
Solve→
House Robber
37%
MediumM
37%
ArrayDynamic Programming
Solve→
Basic Calculator II
37%
MediumM
37%
MathString+1
Solve→
Peak Index in a Mountain Array
37%
MediumM
37%
ArrayBinary Search+1
Solve→
Open the Lock
37%
MediumM
37%
ArrayHash Table+3
Solve→
Best Time to Buy and Sell Stock II
37%
MediumM
37%
ArrayDynamic Programming+1
Solve→
Koko Eating Bananas
37%
MediumM
37%
ArrayBinary Search
Solve→

Pass your interview with AI assistance

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

Start Free Trial
Minimum Size Subarray Sum
37%
MediumM
37%
ArrayBinary Search+2
Solve→
4Sum
37%
MediumM
37%
ArrayTwo Pointers+1
Solve→
Find the Shortest Superstring
37%
HardH
37%
ArrayString+4
Solve→
Find First and Last Position of Element in Sorted Array
37%
MediumM
37%
ArrayBinary Search
Solve→
Split Array Largest Sum
37%
HardH
37%
ArrayBinary Search+3
Solve→
Flatten Nested List Iterator
37%
MediumM
37%
StackTree+4
Solve→
Excel Sheet Column Title
37%
EasyE
37%
MathString
Solve→
Design A Leaderboard
37%
MediumM
37%
Hash TableDesign+1
Solve→
Decode Ways
37%
MediumM
37%
StringDynamic Programming
Solve→
Number of Ways to Wear Different Hats to Each Other
37%
HardH
37%
ArrayDynamic Programming+5
Solve→
Longest Valid Parentheses
37%
HardH
37%
StringDynamic Programming+2
Solve→
Wildcard Matching
37%
HardH
37%
StringDynamic Programming+2
Solve→
Number of Ways to Select Buildings
37%
MediumM
37%
StringDynamic Programming+1
Solve→
Maximum Width Ramp
37%
MediumM
37%
ArrayTwo Pointers+2
Solve→
Loud and Rich
37%
MediumM
37%
ArrayDepth-First Search+3
Solve→
Two Sum
37%
EasyE
37%
ArrayHash Table
Solve→
Merge Sorted Array
37%
EasyE
37%
ArrayTwo Pointers+1
Solve→
Remove Duplicate Letters
37%
MediumM
37%
StringStack+2
Solve→
House Robber II
37%
MediumM
37%
ArrayDynamic Programming
Solve→
Container With Most Water
37%
MediumM
37%
ArrayTwo Pointers+1
Solve→
Recover Binary Search Tree
37%
MediumM
37%
TreeDepth-First Search+2
Solve→
Valid Anagram
37%
EasyE
37%
Hash TableString+1
Solve→
Boats to Save People
37%
MediumM
37%
ArrayTwo Pointers+3
Solve→
All Nodes Distance K in Binary Tree
37%
MediumM
37%
Hash TableTree+3
Solve→
Coin Change
37%
MediumM
37%
ArrayDynamic Programming+3
Solve→

Pass your interview with AI assistance

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

Start Free Trial
Palindrome Partitioning
37%
MediumM
37%
StringDynamic Programming+1
Solve→
Shortest Path in a Grid with Obstacles Elimination
37%
HardH
37%
ArrayBreadth-First Search+1
Solve→
Maximum Number of Removable Characters
37%
MediumM
37%
ArrayTwo Pointers+2
Solve→
Maximal Rectangle
37%
HardH
37%
ArrayDynamic Programming+3
Solve→
Max Consecutive Ones III
37%
MediumM
37%
ArrayBinary Search+2
Solve→
Kth Largest Element in an Array
37%
MediumM
37%
ArrayDivide and Conquer+3
Solve→
Maximal Square
37%
MediumM
37%
ArrayDynamic Programming+1
Solve→
Find Maximum Removals From Source String
37%
MediumM
37%
ArrayHash Table+3
Solve→
Diameter of Binary Tree
37%
EasyE
37%
TreeDepth-First Search+2
Solve→
Predict the Winner
37%
MediumM
37%
ArrayMath+5
Solve→
Find K Closest Elements
37%
MediumM
37%
ArrayTwo Pointers+4
Solve→
Best Time to Buy and Sell Stock
37%
EasyE
37%
ArrayDynamic Programming
Solve→
Remove Max Number of Edges to Keep Graph Fully Traversable
37%
HardH
37%
Union-FindGraph Theory
Solve→
Find Median from Data Stream
37%
HardH
37%
Two PointersDesign+3
Solve→
Meeting Rooms II
37%
MediumM
37%
ArrayTwo Pointers+4
Solve→
Create Maximum Number
37%
HardH
37%
ArrayTwo Pointers+3
Solve→

Similar Companies

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

Flipkart
108 problems
Accenture
129 problems
PayPal
103 problems
Snowflake
101 problems
Yandex
131 problems
NVIDIA
136 problems

Frequently Asked Questions

What LeetCode problems are tagged to The D E Shaw Group?

Our current The D E Shaw Group practice dataset contains 116 tagged coding problems, including Binary Tree Cameras, Find Minimum Cost to Remove Array Elements, Maximum Number of Subsequences After One Inserting. The difficulty breakdown is 14 Easy, 71 Medium, and 31 Hard problems.

How should I prepare for a The D E Shaw Group coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. The D E Shaw Group interviews typically emphasize Array and Dynamic Programming. Practice explaining your thought process while coding.

What is the difficulty level of The D E Shaw Group coding interviews?

Based on our data, The D E Shaw Group interviews include 14 Easy (12%), 71 Medium (61%), and 31 Hard (27%) problems.

Ready to ace your The D E Shaw Group interview?

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

Get Started Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • About
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Developers
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Refund & Cancellation
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.