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
3269. Constructing Two Increasing ArraysPremium
Solution61.8%Hard
Array, Dynamic Programming
3276. Select Cells in Grid With Maximum ScoreVideo
Solution15.7%Hard
Array, Bit Manipulation +3
3277. Maximum XOR Score Subarray QueriesVideo
Solution43.4%Hard
Array, Dynamic Programming· 1 company
3287. Find the Maximum Sequence Value of ArrayVideo
Solution21.9%Hard
Array, Bit Manipulation +1· 1 company
3292. Minimum Number of Valid Strings to Form Target IIVideo
Solution21.1%Hard
Array, Binary Search +6
3299. Sum of Consecutive SubsequencesVideoPremium
Solution44.1%Hard
Array, Dynamic Programming +1
3317. Find the Number of Possible Ways for an EventVideo
Solution34.8%Hard
Combinatorics, Dynamic Programming +1· 1 company
3320. Count The Number of Winning SequencesVideo
Solution32.4%Hard
Dynamic Programming, String· 1 company
3333. Find the Original Typed String IIVideo
Solution45.6%Hard
Dynamic Programming, Prefix Sum +1· 5 companies
3336. Find the Number of Subsequences With Equal GCDVideo
Solution66.7%Hard
Array, Dynamic Programming +2· 2 companies
3337. Total Characters in String After Transformations IIVideo
Solution58.0%Hard
Counting, Dynamic Programming +3· 2 companies
3343. Count Number of Balanced PermutationsVideo
Solution49.1%Hard
Combinatorics, Dynamic Programming +2· 2 companies
3351. Sum of Good SubsequencesVideo
Solution30.9%Hard
Array, Dynamic Programming +1· 1 company
3352. Count K-Reducible Numbers Less Than NVideo
Solution27.8%Hard
Combinatorics, Dynamic Programming +2· 1 company
3363. Find the Maximum Number of Fruits CollectedVideo
Solution65.1%Hard
Array, Dynamic Programming +1· 2 companies
3367. Maximize Sum of Weights after Edge RemovalsVideo
Solution33.1%Hard
Depth-First Search, Dynamic Programming +2· 1 company
3389. Minimum Operations to Make Character Frequencies EqualVideo
–25.8%Hard
Counting, Dynamic Programming +3· 2 companies
3410. Maximize Subarray Sum After Removing All Occurrences of One ElementVideo
–23.0%Hard
Array, Dynamic Programming +1· 2 companies
3414. Maximum Score of Non-overlapping IntervalsVideo
Solution65.9%Hard
Array, Binary Search +2· 2 companies
3441. Minimum Cost Good CaptionVideo
–20.5%Hard
Dynamic Programming, String· 2 companies
3444. Minimum Increments for Target Multiples in an ArrayVideo
–27.5%Hard
Array, Bit Manipulation +4
3448. Count Substrings Divisible By Last DigitVideo
–23.7%Hard
Dynamic Programming, String· 1 company
3459. Length of Longest V-Shaped Diagonal SegmentVideo
Solution56.3%Hard
Array, Dynamic Programming +2· 5 companies
3490. Count Beautiful NumbersVideo
–24.5%Hard
Dynamic Programming· 1 company
3500. Minimum Cost to Divide Array Into SubarraysVideo
–28.2%Hard
Array, Dynamic Programming +1
3504. Longest Palindrome After Substring Concatenation IIVideo
Solution18.4%Hard
Dynamic Programming, String +1· 1 company
3505. Minimum Operations to Make Elements Within K Subarrays EqualVideo
–27.8%Hard
Array, Dynamic Programming +4
3509. Maximum Product of Subsequences With an Alternating Sum Equal to KVideo
–13.7%Hard
Array, Dynamic Programming +1· 1 company
3519. Count Numbers with Non-Decreasing Digits Video
–37.3%Hard
Dynamic Programming, Math +1
3530. Maximum Profit from Valid Topological Order in DAGVideo
–29.7%Hard
Array, Bit Manipulation +4
3533. Concatenated DivisibilityVideo
–30.6%Hard
Array, Bit Manipulation +2· 1 company
3534. Path Existence Queries in a Graph IIVideo
Solution64.2%Hard
Array, Binary Search +6· 4 companies
3538. Merge Operations for Minimum Travel TimeVideo
–30.5%Hard
Array, Dynamic Programming +1· 1 company
3539. Find Sum of Array Product of Magical SequencesVideo
Solution61.9%Hard
Array, Bit Manipulation +4· 2 companies
3544. Subtree Inversion SumVideo
–41.6%Hard
Array, Depth-First Search +2
3553. Minimum Weighted Subgraph With the Required Paths IIVideo
–48.2%Hard
Array, Bit Manipulation +3
3559. Number of Ways to Assign Edge Weights IIVideo
Solution71.8%Hard
Array, Bit Manipulation +4· 3 companies
3562. Maximum Profit from Trading Stocks with DiscountsVideo
Solution56.1%Hard
Array, Depth-First Search +2· 2 companies
3563. Lexicographically Smallest String After Adjacent RemovalsVideo
–17.9%Hard
Dynamic Programming, String
3575. Maximum Good Subtree ScoreVideo
–44.0%Hard
Array, Bit Manipulation +4· 1 company
3579. Minimum Steps to Convert String with OperationsVideo
Solution42.5%Hard
Dynamic Programming, String
3585. Find Weighted Median Node in TreeVideo
Solution26.7%Hard
Array, Binary Search +4· 1 company
3615. Longest Palindromic Path in GraphVideo
–22.6%Hard
Bit Manipulation, Bitmask +3· 1 company
3620. Network Recovery PathwaysVideo
Solution50.8%Hard
Array, Binary Search +5· 2 companies
3621. Number of Integers With Popcount-Depth Equal to K IVideo
–23.0%Hard
Bit Manipulation, Combinatorics +2
3640. Trionic Array IIVideo
Solution47.3%Hard
Array, Dynamic Programming· 6 companies
3651. Minimum Cost Path with TeleportationsVideo
Solution45.1%Hard
Array, Dynamic Programming +1· 4 companies
3661. Maximum Walls Destroyed by RobotsVideo
Solution48.0%Hard
Array, Binary Search +2· 3 companies
3686. Number of Stable SubsequencesVideo
–58.9%Hard
Array, Dynamic Programming· 1 company
3699. Number of ZigZag Arrays IVideo
Solution50.2%Hard
Dynamic Programming, Prefix Sum· 5 companies
Showing 251–300 of 332