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

Problems

673 problems

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

673 results

Sign in to see which of these you have solved.Sign in
TitleSolutionAcceptDifficultyTopics
3176. Find the Maximum Length of a Good Subsequence IVideo
Solution32.6%Medium
Array, Dynamic Programming +1· 1 company
3177. Find the Maximum Length of a Good Subsequence IIVideo
Solution25.2%Hard
Array, Dynamic Programming +1· 1 company
3180. Maximum Total Reward Using Operations IVideo
Solution30.8%Medium
Array, Dynamic Programming· 1 company
3181. Maximum Total Reward Using Operations IIVideo
Solution21.9%Hard
Array, Bit Manipulation +1· 1 company
3183. The Number of Ways to Make the SumVideoPremium
Solution50.8%Medium
Array, Dynamic Programming
3186. Maximum Total Damage With Spell CastingVideo
Solution45.1%Medium
Array, Binary Search +5· 7 companies
3192. Minimum Operations to Make Binary Array Elements Equal to One IIVideo
Solution65.1%Medium
Array, Dynamic Programming +1· 1 company
3193. Count the Number of InversionsVideo
Solution31.9%Hard
Array, Dynamic Programming· 5 companies
3196. Maximize Total Cost of Alternating SubarraysVideo
Solution29.6%Medium
Array, Dynamic Programming· 1 company
3201. Find the Maximum Length of Valid Subsequence IVideo
Solution54.9%Medium
Array, Dynamic Programming· 4 companies
3202. Find the Maximum Length of Valid Subsequence IIVideo
Solution57.2%Medium
Array, Dynamic Programming· 6 companies
3205. Maximum Array Hopping Score IVideoPremium
Solution77.0%Medium
Array, Dynamic Programming +3· 1 company
3213. Construct String with Minimum CostVideo
Solution19.0%Hard
Array, Dynamic Programming +2· 1 company
3218. Minimum Cost for Cutting Cake IVideo
Solution58.5%Medium
Array, Dynamic Programming +2
3225. Maximum Score From Grid OperationsVideo
Solution63.5%Hard
Array, Dynamic Programming +2· 3 companies
3229. Minimum Operations to Make Array Equal to TargetVideo
Solution42.0%Hard
Array, Dynamic Programming +3· 3 companies
3241. Time Taken to Mark All NodesVideo
Solution29.5%Hard
Depth-First Search, Dynamic Programming +2
3247. Number of Subsequences with Odd SumVideoPremium
Solution47.6%Medium
Array, Combinatorics +2
3250. Find the Count of Monotonic Pairs IVideo
Solution47.6%Hard
Array, Combinatorics +3· 2 companies
3251. Find the Count of Monotonic Pairs IIVideo
Solution24.7%Hard
Array, Combinatorics +3· 1 company
3256. Maximum Value Sum by Placing Three Rooks IVideo
Solution17.0%Hard
Array, Dynamic Programming +2
3257. Maximum Value Sum by Placing Three Rooks IIVideo
Solution26.1%Hard
Array, Dynamic Programming +2
3259. Maximum Energy Boost From Two DrinksVideo
Solution50.0%Medium
Array, Dynamic Programming· 1 company
3260. Find the Largest Palindrome Divisible by KVideo
Solution17.0%Hard
Dynamic Programming, Greedy +3· 2 companies
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
3284. Sum of Consecutive SubarraysVideoPremium
Solution43.4%Medium
Array, Dynamic Programming +1
3287. Find the Maximum Sequence Value of ArrayVideo
Solution21.9%Hard
Array, Bit Manipulation +1· 1 company
3290. Maximum Multiplication ScoreVideo
Solution41.3%Medium
Array, Dynamic Programming
3291. Minimum Number of Valid Strings to Form Target IVideo
Solution22.4%Medium
Array, Binary Search +7· 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
3302. Find the Lexicographically Smallest Valid SequenceVideo
Solution57.9%Medium
Dynamic Programming, Greedy +2
3316. Find Maximum Removals From Source StringVideo
Solution39.3%Medium
Array, Dynamic Programming +3· 1 company
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
3332. Maximum Points Tourist Can EarnVideo
Solution47.3%Medium
Array, Dynamic Programming +1· 1 company
3333. Find the Original Typed String IIVideo
Solution45.6%Hard
Dynamic Programming, Prefix Sum +1· 5 companies
3335. Total Characters in String After Transformations IVideo
Solution45.7%Medium
Counting, Dynamic Programming +3· 4 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
3339. Find the Number of K-Even ArraysVideoPremium
Solution61.3%Medium
Dynamic Programming
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
3366. Minimum Array SumVideo
Solution31.7%Medium
Array, Dynamic Programming· 5 companies
3367. Maximize Sum of Weights after Edge RemovalsVideo
Solution33.1%Hard
Depth-First Search, Dynamic Programming +2· 1 company
3376. Minimum Time to Break Locks IVideo
Solution32.8%Medium
Array, Backtracking +4· 1 company
Showing 501–550 of 673