Talentd
For employersSign in
JobsInternshipsPracticeResume toolsCompaniesArticles
For employers
FleetCode
Make and follow sheets.Sign in

Problems

332 problems

Has videoPremium onlyReset
Array578Dynamic Programming332String191Math187Binary Search136Hash Table134Sorting106Greedy104Bit Manipulation103Graph96Depth-First Search91Heap (Priority Queue)78Prefix Sum77Matrix75Breadth-First Search71All topics

Hard · 332 results

Sign in to see which of these you have solved.Sign in
TitleSolutionAcceptDifficultyTopics
3700. Number of ZigZag Arrays IIVideo
Solution67.7%Hard
Dynamic Programming, Math· 3 companies
3704. Count No-Zero Pairs That Sum to NVideo
Solution15.6%Hard
Dynamic Programming, Math
3725. Count Ways to Choose Coprime Integers from RowsVideo
–46.8%Hard
Array, Combinatorics +4
3743. Maximize Cyclic Partition ScoreVideo
–14.5%Hard
Array, Dynamic Programming· 2 companies
3753. Total Waviness of Numbers in Range IIVideo
Solution56.2%Hard
Dynamic Programming, Math· 4 companies
3757. Number of Effective SubsequencesVideo
–30.4%Hard
Array, Bit Manipulation +3
3772. Maximum Subgraph Score in a TreeVideo
–65.4%Hard
Array, Depth-First Search +2· 1 company
3791. Number of Balanced Integers in a RangeVideo
Solution35.0%Hard
Dynamic Programming
3797. Count Routes to Climb a Rectangular GridVideo
–23.1%Hard
Array, Dynamic Programming +2· 1 company
3801. Minimum Cost to Merge Sorted ListsVideo
Solution33.8%Hard
Array, Binary Search +3
3826. Minimum Partition ScoreVideo
–32.6%Hard
Array, Divide and Conquer +4
3830. Longest Alternating Subarray After Removing At Most One ElementVideo
Solution30.9%Hard
Array, Dynamic Programming +1
3836. Maximum Score Using Exactly K PairsVideo
Solution41.4%Hard
Array, Dynamic Programming
3850. Count Sequences to KVideo
Solution35.6%Hard
Array, Dynamic Programming +3· 2 companies
3869. Count Fancy Numbers in a RangeVideo
Solution26.6%Hard
Dynamic Programming, Math
3883. Count Non Decreasing Arrays With Given Digit SumsVideo
–40.3%Hard
Array, Dynamic Programming +1· 1 company
3892. Minimum Operations to Achieve At Least K PeaksVideo
–29.8%Hard
Array, Dynamic Programming
3906. Count Good Integers on a Grid PathVideo
Solution45.8%Hard
Dynamic Programming
3915. Maximum Sum of Alternating Subsequence With Distance at Least KVideo
Solution30.7%Hard
Array, Dynamic Programming +1· 1 company
3939. Count Non Adjacent Subsets in a Rooted TreeVideo
–51.7%Hard
Array, Depth-First Search +2· 1 company
3956. Maximum Sum of M Non-Overlapping Subarrays IVideo
–26.3%Hard
Array, Binary Search +5
3957. Maximum Sum of M Non-Overlapping Subarrays IIVideo
–16.6%Hard
Array, Binary Search +5
3966. Count Good Integers in a RangeVideo
–49.8%Hard
Dynamic Programming, Math
3977. Minimum Time to Reach Target With Limited PowerVideo
Solution40.4%Hard
Array, Dynamic Programming +3
3981. Count Distinct Ways to Form Target from Two StringsVideo
–46.4%Hard
Dynamic Programming, Prefix Sum +1
3989. Maximum Consistent Columns in a GridVideo
–68.7%Hard
Array, Dynamic Programming +1
3995. Minimum Cost to Convert String IIIVideo
–55.6%Hard
Array, Dynamic Programming +1
4009. Minimum Possible Maximum Waiting TimeVideo
–29.9%Hard
Array, Dynamic Programming +1
4023. Elevator Requests IIVideo
–27.6%Hard
Array, Dynamic Programming +1
4027. Elevator Requests IIIVideo
Solution45.7%Hard
Array, Bit Manipulation +3
4041. Minimum Operations to Form Subset Sum IIVideo
Solution49.3%Hard
Array, Dynamic Programming
4068. Maximize Meeting Earnings with Idle GapsVideo
Solution39.0%Hard
Array, Binary Search +2
Showing 301–332 of 332