DE Shaw
107 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 968. Binary Tree Cameras | Hard | 100% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
| 3469. Find Minimum Cost to Remove Array Elements | Medium | 88.3% | TopicsArrayDynamic Programming |
| 3628. Maximum Number of Subsequences After One Inserting | Medium | 84.4% | TopicsStringDynamic ProgrammingGreedyPrefix Sum |
| 1326. Minimum Number of Taps to Open to Water a Garden | Hard | 77.9% | TopicsArrayDynamic ProgrammingGreedy |
| 2875. Minimum Size Subarray in Infinite Array | Medium | 77.9% | TopicsArrayHash TableSliding WindowPrefix Sum |
| 2920. Maximum Points After Collecting Coins From All Nodes | Hard | 76% | TopicsArrayDynamic ProgrammingBit ManipulationTreeDepth-First SearchMemoizationDP on Trees |
| 2171. Removing Minimum Number of Magic Beans | Medium | 76% | TopicsArrayGreedySortingEnumerationPrefix Sum |
| 2542. Maximum Subsequence Score | Medium | 76% | TopicsArrayGreedySortingHeap (Priority Queue) |
| 3332. Maximum Points Tourist Can Earn | Medium | 76% | TopicsArrayDynamic ProgrammingMatrix |
| Minimum Runes to Add to Cast Spell | Hard | 73.8% | TopicsArrayDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort |
| 17. Letter Combinations of a Phone Number | Medium | 71.4% | TopicsHash TableStringBacktracking |
| 1122. Relative Sort Array | Easy | 71.4% | TopicsArrayHash TableSortingCounting SortQuicksortBubble Sort |
| Sliding Window Maximum | Hard | 71.4% | TopicsArrayQueueSliding WindowHeap (Priority Queue)Monotonic QueueRange Minimum/Maximum Query |
| 3108. Minimum Cost Walk in Weighted Graph | Hard | 71.4% | TopicsArrayBit ManipulationUnion-FindGraph Theory |
| 3209. Number of Subarrays With AND Value of K | Hard | 71.4% | TopicsArrayBinary SearchBit ManipulationSegment Tree |
| 1358. Number of Substrings Containing All Three Characters | Medium | 71.4% | TopicsHash TableStringSliding Window |
| 3077. Maximum Strength of K Disjoint Subarrays | Hard | 68.8% | TopicsArrayDynamic ProgrammingPrefix Sum |
| 3082. Find the Sum of the Power of All Subsequences | Hard | 68.8% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 3085. Minimum Deletions to Make String K-Special | Medium | 68.8% | TopicsHash TableStringGreedySortingCounting |
| 1262. Greatest Sum Divisible by Three | Medium | 68.8% | TopicsArrayDynamic ProgrammingGreedySorting |
| 2343. Query Kth Smallest Trimmed Number | Medium | 68.8% | TopicsArrayStringDivide and ConquerSortingHeap (Priority Queue)Radix SortQuickselect |
| 2352. Equal Row and Column Pairs | Medium | 68.8% | TopicsArrayHash TableMatrixSimulation |
| 2430. Maximum Deletions on a String | Hard | 68.8% | TopicsStringDynamic ProgrammingRolling HashString MatchingHash Function |
| Median of a Row Wise Sorted Matrix | Medium | 68.8% | TopicsArrayBinary SearchMatrix |
| 2660. Determine the Winner of a Bowling Game | Easy | 68.8% | TopicsArraySimulation |
