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

Problems

2,237 problems

Has videoPremium onlyReset
Array2,237String877Hash Table797Math691Dynamic Programming673Sorting508Greedy485Binary Search357Depth-First Search338Database308Bit Manipulation286Matrix279Tree264Breadth-First Search257Prefix Sum252All topics

2,237 results

Sign in to see which of these you have solved.Sign in
TitleSolutionAcceptDifficultyTopics
3938. Maximum Path Intersection Sum in a GridVideo
–25.6%Medium
Array, Dynamic Programming +2
3939. Count Non Adjacent Subsets in a Rooted TreeVideo
–51.7%Hard
Array, Depth-First Search +2· 1 company
3940. Limit Occurrences in Sorted ArrayVideo
Solution72.6%Easy
Array, Two Pointers
3942. Minimum Operations to Sort a PermutationVideo
Solution52.7%Medium
Array· 1 company
3943. Number of Pairs After IncrementVideo
–20.9%Hard
Array, Counting +2
3946. Maximum Number of Items From Sale IVideo
Solution37.3%Medium
Array, Dynamic Programming +1· 1 company
3947. Maximum Number of Items From Sale IIVideo
–30.2%Medium
Array, Greedy +2
3948. Lexicographically Maximum MEX ArrayVideo
–53.6%Hard
Array, Greedy +2· 2 companies
3951. Minimum Energy to Maintain BrightnessVideo
Solution53.4%Medium
Array, Sorting
3952. Maximum Total Value of Covered IndicesVideo
–28.5%Medium
Array, Dynamic Programming +2· 1 company
3953. Maximum Score with Co-Prime ElementVideo
–27.5%Hard
Array, Combinatorics +4· 2 companies
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
3960. Frequency Balance SubarrayVideo
Solution29.5%Medium
Array, Counting +1· 1 company
3961. Maximize Sum of Device RatingsVideo
Solution39.4%Medium
Array, Greedy +2· 2 companies
3962. Maximum Subarray Sum After at Most K SwapsVideo
Solution14.2%Hard
Array, Binary Indexed Tree +5· 1 company
3964. Minimum Lights to Illuminate a RoadVideo
Solution37.8%Medium
Array, Prefix Sum
3965. Finish Time of Tasks IVideo
Solution60.3%Medium
Array, Depth-First Search +2
3969. Valid Subarrays With Matching Sum Digits IVideo
Solution46.8%Medium
Array, Enumeration +3· 1 company
3971. Maximum Total ValueVideo
–29.7%Hard
Array, Binary Search +2· 1 company
3974. Maximum Total Sum of K Selected ElementsVideo
Solution49.1%Medium
Array, Greedy +1
3975. Filter Occupied IntervalsVideo
Solution44.6%Medium
Array, Sorting· 1 company
3976. Maximum Subarray Sum After MultiplierVideo
Solution25.9%Medium
Array, Dynamic Programming· 2 companies
3977. Minimum Time to Reach Target With Limited PowerVideo
Solution40.4%Hard
Array, Dynamic Programming +3
3978. Unique Middle ElementVideo
Solution72.3%Easy
Array, Counting
3979. Maximum Valid Pair SumVideo
Solution49.2%Medium
Array, Enumeration
3982. Sum of Integers with Maximum Digit RangeVideo
Solution72.9%Easy
Array, Math
3984. Divisible GameVideo
–42.3%Medium
Array, Dynamic Programming +3
3985. Palindromic Subarray SumVideo
–34.6%Hard
Array, Binary Search +2
3987. Minimum Total Cost to Process All ElementsVideo
Solution24.7%Medium
Array, Math +1
3988. Create Grid With Exactly K Paths IVideo
–33.1%Medium
Array, Combinatorics +2
3989. Maximum Consistent Columns in a GridVideo
–68.7%Hard
Array, Dynamic Programming +1
3994. Minimum Adjacent Swaps to Partition ArrayVideo
–57.4%Medium
Array, Greedy
3995. Minimum Cost to Convert String IIIVideo
–55.6%Hard
Array, Dynamic Programming +1
3996. Even Number of Knight MovesVideo
Solution75.1%Easy
Array, Math
3998. Transform Binary String Using Subsequence SortVideo
–37.9%Medium
Array, Greedy +2
4001. Aggregate Two Time SeriesVideo
Solution57.9%Medium
Array, Two Pointers
4003. Minimum Cost Path with Alternating Directions IIIVideo
Solution61.4%Hard
Array, Graph +3
4007. Widest Possible FenceVideo
Solution16.9%Hard
Array, Counting +2
4008. Minimum Initial Strength to Defeat All MonstersVideo
Solution50.1%Medium
Array, Binary Search +2
4009. Minimum Possible Maximum Waiting TimeVideo
–29.9%Hard
Array, Dynamic Programming +1
4010. Maximize Pair Strength Using GCDVideo
Solution48.6%Easy
Array, Enumeration +2
4011. Count Subarrays With Even Odd Ratio IVideo
Solution60.6%Medium
Array, Binary Indexed Tree +4
4012. Count of Unfinished Tasks After Each ShiftVideo
Solution41.9%Medium
Array, Binary Search +1
4013. Count Subarrays With Even Odd Ratio IIVideo
Solution40.9%Hard
Array, Binary Indexed Tree +4
4014. Minimum Total Price After Applying DiscountsVideo
Solution71.8%Medium
Array, Greedy +2
4015. Weighted Sum of a TreeVideo
Solution41.7%Medium
Array, Depth-First Search +1
4016. Maximum Area of Two Non-Overlapping Square SubmatricesVideo
Solution40.9%Medium
Array, Binary Search +2
4017. Peaks in Array IIVideo
–28.4%Hard
Array, Divide and Conquer +1
4020. Elevator Requests IVideo
Solution84.1%Easy
Array, Simulation
Showing 2,151–2,200 of 2,237