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

Problems

77 problems

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

Hard · 77 results

Sign in to see which of these you have solved.Sign in
TitleSolutionAcceptDifficultyTopics
3425. Longest Special PathVideo
–23.2%Hard
Array, Depth-First Search +3
3445. Maximum Difference Between Even and Odd Frequency IIVideo
Solution48.7%Hard
Enumeration, Prefix Sum +2· 6 companies
3480. Maximize Subarrays After Removing One Conflicting PairVideo
Solution64.6%Hard
Array, Enumeration +2· 5 companies
3486. Longest Special Path IIVideo
–19.8%Hard
Array, Depth-First Search +3· 1 company
3500. Minimum Cost to Divide Array Into SubarraysVideo
–28.2%Hard
Array, Dynamic Programming +1
3538. Merge Operations for Minimum Travel TimeVideo
–30.5%Hard
Array, Dynamic Programming +1· 1 company
3548. Equal Sum Grid Partition IIVideo
Solution39.5%Hard
Array, Enumeration +3· 2 companies
3632. Subarrays with XOR at Least KPremium
–46.3%Hard
Array, Bit Manipulation +2
3636. Threshold Majority QueriesVideo
–22.5%Hard
Array, Binary Search +4· 4 companies
3699. Number of ZigZag Arrays IVideo
Solution50.2%Hard
Dynamic Programming, Prefix Sum· 5 companies
3721. Longest Balanced Subarray IIVideo
Solution33.7%Hard
Array, Divide and Conquer +3· 2 companies
3729. Count Distinct Subarrays Divisible by K in Sorted ArrayVideo
Solution27.4%Hard
Array, Hash Table +1
3739. Count Subarrays With Majority Element IIVideo
Solution65.2%Hard
Array, Divide and Conquer +4· 2 companies
3748. Count Stable SubarraysVideo
Solution31.9%Hard
Array, Binary Search +1
3797. Count Routes to Climb a Rectangular GridVideo
–23.1%Hard
Array, Dynamic Programming +2· 1 company
3826. Minimum Partition ScoreVideo
–32.6%Hard
Array, Divide and Conquer +4
3845. Maximum Subarray XOR with Bounded RangeVideo
Solution32.3%Hard
Array, Bit Manipulation +5
3864. Minimum Cost to Partition a Binary StringVideo
Solution50.5%Hard
Divide and Conquer, Prefix Sum +1· 1 company
3883. Count Non Decreasing Arrays With Given Digit SumsVideo
–40.3%Hard
Array, Dynamic Programming +1· 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
3981. Count Distinct Ways to Form Target from Two StringsVideo
–46.4%Hard
Dynamic Programming, Prefix Sum +1
3985. Palindromic Subarray SumVideo
–34.6%Hard
Array, Binary Search +2
4013. Count Subarrays With Even Odd Ratio IIVideo
Solution40.9%Hard
Array, Binary Indexed Tree +4
4033. Valid K-Unique Subarrays IVideo
–34.8%Hard
Array, Binary Indexed Tree +4
4051. Count Subarrays with Distant SumsVideo
Solution32.8%Hard
Array, Binary Indexed Tree +3
4064. Longest Subarray Divisible by K with At Most One Negation IIVideo
Solution24.7%Hard
Array, Binary Search +2
Showing 51–77 of 77