Skip to content
Talentd
Jobs
Internships
Practice
Resume tools
Companies
Articles
Search
⌘K
For employers
Sign in
Jobs
Internships
Practice
Resume tools
Companies
Articles
For employers
FleetCode
Dashboard
Problems
Solutions
Companies
Topics
Sheets
Revise
My progress
Make and follow sheets.
Sign in
Problems
666 problems
Search
All levels
666
Easy
14
Medium
324
Hard
328
Has video
Premium only
Reset
Array
2,209
String
870
Hash Table
786
Math
682
Dynamic Programming
666
Sorting
504
Greedy
480
Binary Search
352
Depth-First Search
335
Database
303
Bit Manipulation
283
Matrix
278
Tree
261
Breadth-First Search
255
Two Pointers
249
All topics
Asked at
Any company
Google
Amazon
Microsoft
Meta
Bloomberg
Uber
Tiktok
Oracle
Apple
Goldman Sachs
TCS
Salesforce
Infosys
IBM
LinkedIn
Zoho
Adobe
Visa
Walmart Labs
Accenture
NVIDIA
Yandex
Flipkart
D. E. Shaw
PayPal
Snowflake
PhonePe
Citadel
Cisco
Snapchat
Sort
Number
Acceptance
Apply
With video ·
666 results
Sign in to see which of these you have solved.
Sign in
Title
Solution
Accept
Difficulty
Topics
3183.
The Number of Ways to Make the Sum
Video
Premium
Solution
50.8%
Medium
Array
,
Dynamic Programming
3186.
Maximum Total Damage With Spell Casting
Video
Solution
45.1%
Medium
Array
,
Binary Search
+5
· 7 companies
3192.
Minimum Operations to Make Binary Array Elements Equal to One II
Video
Solution
65.1%
Medium
Array
,
Dynamic Programming
+1
· 1 company
3193.
Count the Number of Inversions
Video
Solution
31.9%
Hard
Array
,
Dynamic Programming
· 5 companies
3196.
Maximize Total Cost of Alternating Subarrays
Video
Solution
29.6%
Medium
Array
,
Dynamic Programming
· 1 company
3201.
Find the Maximum Length of Valid Subsequence I
Video
Solution
54.9%
Medium
Array
,
Dynamic Programming
· 4 companies
3202.
Find the Maximum Length of Valid Subsequence II
Video
Solution
57.2%
Medium
Array
,
Dynamic Programming
· 6 companies
3205.
Maximum Array Hopping Score I
Video
Premium
Solution
77.0%
Medium
Array
,
Dynamic Programming
+3
· 1 company
3213.
Construct String with Minimum Cost
Video
Solution
19.0%
Hard
Array
,
Dynamic Programming
+2
· 1 company
3218.
Minimum Cost for Cutting Cake I
Video
Solution
58.5%
Medium
Array
,
Dynamic Programming
+2
3225.
Maximum Score From Grid Operations
Video
Solution
63.5%
Hard
Array
,
Dynamic Programming
+2
· 3 companies
3229.
Minimum Operations to Make Array Equal to Target
Video
Solution
42.0%
Hard
Array
,
Dynamic Programming
+3
· 3 companies
3241.
Time Taken to Mark All Nodes
Video
Solution
29.5%
Hard
Depth-First Search
,
Dynamic Programming
+2
3247.
Number of Subsequences with Odd Sum
Video
Premium
Solution
47.6%
Medium
Array
,
Combinatorics
+2
3250.
Find the Count of Monotonic Pairs I
Video
Solution
47.6%
Hard
Array
,
Combinatorics
+3
· 2 companies
3251.
Find the Count of Monotonic Pairs II
Video
Solution
24.7%
Hard
Array
,
Combinatorics
+3
· 1 company
3256.
Maximum Value Sum by Placing Three Rooks I
Video
Solution
17.0%
Hard
Array
,
Dynamic Programming
+2
3257.
Maximum Value Sum by Placing Three Rooks II
Video
Solution
26.1%
Hard
Array
,
Dynamic Programming
+2
3259.
Maximum Energy Boost From Two Drinks
Video
Solution
50.0%
Medium
Array
,
Dynamic Programming
· 1 company
3260.
Find the Largest Palindrome Divisible by K
Video
Solution
17.0%
Hard
Dynamic Programming
,
Greedy
+3
· 2 companies
3276.
Select Cells in Grid With Maximum Score
Video
Solution
15.7%
Hard
Array
,
Bit Manipulation
+3
3277.
Maximum XOR Score Subarray Queries
Video
Solution
43.4%
Hard
Array
,
Dynamic Programming
· 1 company
3284.
Sum of Consecutive Subarrays
Video
Premium
Solution
43.4%
Medium
Array
,
Dynamic Programming
+1
3287.
Find the Maximum Sequence Value of Array
Video
Solution
21.9%
Hard
Array
,
Bit Manipulation
+1
· 1 company
3290.
Maximum Multiplication Score
Video
Solution
41.3%
Medium
Array
,
Dynamic Programming
3291.
Minimum Number of Valid Strings to Form Target I
Video
Solution
22.4%
Medium
Array
,
Binary Search
+7
· 1 company
3292.
Minimum Number of Valid Strings to Form Target II
Video
Solution
21.1%
Hard
Array
,
Binary Search
+6
3299.
Sum of Consecutive Subsequences
Video
Premium
Solution
44.1%
Hard
Array
,
Dynamic Programming
+1
3302.
Find the Lexicographically Smallest Valid Sequence
Video
Solution
57.9%
Medium
Dynamic Programming
,
Greedy
+2
3316.
Find Maximum Removals From Source String
Video
Solution
39.3%
Medium
Array
,
Dynamic Programming
+3
· 1 company
3317.
Find the Number of Possible Ways for an Event
Video
Solution
34.8%
Hard
Combinatorics
,
Dynamic Programming
+1
· 1 company
3320.
Count The Number of Winning Sequences
Video
Solution
32.4%
Hard
Dynamic Programming
,
String
· 1 company
3332.
Maximum Points Tourist Can Earn
Video
Solution
47.3%
Medium
Array
,
Dynamic Programming
+1
· 1 company
3333.
Find the Original Typed String II
Video
Solution
45.6%
Hard
Dynamic Programming
,
Prefix Sum
+1
· 5 companies
3335.
Total Characters in String After Transformations I
Video
Solution
45.7%
Medium
Counting
,
Dynamic Programming
+3
· 4 companies
3336.
Find the Number of Subsequences With Equal GCD
Video
Solution
66.7%
Hard
Array
,
Dynamic Programming
+2
· 2 companies
3337.
Total Characters in String After Transformations II
Video
Solution
58.0%
Hard
Counting
,
Dynamic Programming
+3
· 2 companies
3339.
Find the Number of K-Even Arrays
Video
Premium
Solution
61.3%
Medium
Dynamic Programming
3343.
Count Number of Balanced Permutations
Video
Solution
49.1%
Hard
Combinatorics
,
Dynamic Programming
+2
· 2 companies
3351.
Sum of Good Subsequences
Video
Solution
30.9%
Hard
Array
,
Dynamic Programming
+1
· 1 company
3352.
Count K-Reducible Numbers Less Than N
Video
Solution
27.8%
Hard
Combinatorics
,
Dynamic Programming
+2
· 1 company
3363.
Find the Maximum Number of Fruits Collected
Video
Solution
65.1%
Hard
Array
,
Dynamic Programming
+1
· 2 companies
3366.
Minimum Array Sum
Video
Solution
31.7%
Medium
Array
,
Dynamic Programming
· 5 companies
3367.
Maximize Sum of Weights after Edge Removals
Video
Solution
33.1%
Hard
Depth-First Search
,
Dynamic Programming
+2
· 1 company
3376.
Minimum Time to Break Locks I
Video
Solution
32.8%
Medium
Array
,
Backtracking
+4
· 1 company
3388.
Count Beautiful Splits in an Array
Video
Solution
19.3%
Medium
Array
,
Dynamic Programming
· 2 companies
3389.
Minimum Operations to Make Character Frequencies Equal
Video
–
25.8%
Hard
Counting
,
Dynamic Programming
+3
· 2 companies
3393.
Count Paths With the Given XOR Value
Video
–
40.6%
Medium
Array
,
Bit Manipulation
+2
· 1 company
3409.
Longest Subsequence With Decreasing Adjacent Difference
Video
–
17.3%
Medium
Array
,
Dynamic Programming
· 2 companies
3410.
Maximize Subarray Sum After Removing All Occurrences of One Element
Video
–
23.0%
Hard
Array
,
Dynamic Programming
+1
· 2 companies
Showing 501–550 of 666
Previous
‹
1
…
9
10
11
12
13
…
14
Next
›