FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
40
With Videos
0
Easy
0
Medium
40
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1240. Tiling a Rectangle with the Fewest Squares
HardBacktracking
Watch Solutions55.0% acceptance
1246. Palindrome Removal
HardArrayDynamic Programming
Watch Solutions46.4% acceptance
1250. Check If It Is a Good Array
HardArrayMathNumber Theory
Watch Solutions65.6% acceptance
1255. Maximum Score Words Formed by Letters
HardArrayBacktrackingBit Manipulation
Watch Solutions81.9% acceptance
1259. Handshakes That Don't Cross
HardDynamic ProgrammingMath
Watch Solutions61.1% acceptance
1263. Minimum Moves to Move a Box to Their Target Location
HardArrayBreadth-First SearchHeap (Priority Queue)
Watch Solutions49.7% acceptance
1269. Number of Ways to Stay in the Same Place After Some Steps
HardDynamic Programming
Watch Solutions50.2% acceptance
1274. Number of Ships in a Rectangle
HardArrayDivide and ConquerInteractive
Watch Solutions68.7% acceptance
1278. Palindrome Partitioning III
HardDynamic ProgrammingString
Watch Solutions62.2% acceptance
1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
HardArrayBit ManipulationBreadth-First Search
Watch Solutions72.9% acceptance
1289. Minimum Falling Path Sum II
HardArrayDynamic ProgrammingMatrix
Watch Solutions63.2% acceptance
1293. Shortest Path in a Grid with Obstacles Elimination
HardArrayBreadth-First SearchMatrix
Watch Solutions46.2% acceptance
1298. Maximum Candies You Can Get from Boxes
HardArrayBreadth-First SearchGraph
Watch Solutions67.2% acceptance
1307. Verbal Arithmetic Puzzle
HardArrayBacktrackingMath
Watch Solutions33.5% acceptance
1320. Minimum Distance to Type a Word Using Two Fingers
HardDynamic ProgrammingString
Watch Solutions72.2% acceptance
1326. Minimum Number of Taps to Open to Water a Garden
HardArrayDynamic ProgrammingGreedy
Watch Solutions50.7% acceptance
1330. Reverse Subarray To Maximize Array Value
HardArrayGreedyMath
Watch Solutions44.1% acceptance
1335. Minimum Difficulty of a Job Schedule
HardArrayDynamic Programming
Watch Solutions59.6% acceptance
1336. Number of Transactions per Visit
HardDatabase
Watch Solutions47.7% acceptance
1340. Jump Game V
HardArrayDynamic ProgrammingSorting
Watch Solutions75.7% acceptance
1345. Jump Game IV
HardArrayBreadth-First SearchHash Table
Watch Solutions50.9% acceptance
1354. Construct Target Array With Multiple Sums
HardArrayHeap (Priority Queue)
Watch Solutions36.8% acceptance
1359. Count All Valid Pickup and Delivery Options
HardCombinatoricsDynamic ProgrammingMath
Watch Solutions64.9% acceptance
1363. Largest Multiple of Three
HardArrayDynamic ProgrammingGreedy
Watch Solutions33.2% acceptance
1368. Minimum Cost to Make at Least One Valid Path in a Grid
HardArrayBreadth-First SearchGraph
Watch Solutions70.9% acceptance
1369. Get the Second Most Recent Activity
HardDatabase
Watch Solutions67.5% acceptance
1383. Maximum Performance of a Team
HardArrayGreedyHeap (Priority Queue)
Watch Solutions47.6% acceptance
1384. Total Sales Amount by Year
HardDatabase
Watch Solutions61.0% acceptance
1392. Longest Happy Prefix
HardHash FunctionRolling HashString
Watch Solutions53.5% acceptance
1397. Find All Good Strings
HardDynamic ProgrammingStringString Matching
Watch Solutions45.8% acceptance
1402. Reducing Dishes
HardArrayDynamic ProgrammingGreedy
Watch Solutions76.8% acceptance
1411. Number of Ways to Paint N × 3 Grid
HardDynamic Programming
Watch Solutions80.6% acceptance
1412. Find the Quiet Students in All Exams
HardDatabase
Watch Solutions58.7% acceptance
1416. Restore The Array
HardDynamic ProgrammingString
Watch Solutions47.2% acceptance
1425. Constrained Subsequence Sum
HardArrayDynamic ProgrammingHeap (Priority Queue)
Watch Solutions56.5% acceptance
1434. Number of Ways to Wear Different Hats to Each Other
HardArrayBit ManipulationBitmask
Watch Solutions46.4% acceptance
1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows
HardArrayBinary SearchHeap (Priority Queue)
Watch Solutions62.0% acceptance
1444. Number of Ways of Cutting a Pizza
HardArrayDynamic ProgrammingMatrix
Watch Solutions61.8% acceptance
1449. Form Largest Integer With Digits That Add up to Target
HardArrayDynamic Programming
Watch Solutions49.6% acceptance
1458. Max Dot Product of Two Subsequences
HardArrayDynamic Programming
Watch Solutions69.4% acceptance
Learn DSA with Video Solutions
Video solutions provide a visual, step-by-step approach to understanding Data Structures and Algorithms problems. Watching an expert walk through the thought process, from brute force to optimal solution, helps build the intuition needed for coding interviews.
How to Use Video Solutions Effectively
- Try the problem first: Spend at least 20-30 minutes attempting the problem before watching the video
- Pause and think: When the video mentions a key insight, pause and try to work through it yourself
- Code along: After understanding the approach, implement the solution on your own
- Review text solutions: Combine video walkthroughs with detailed text explanations for deeper understanding
Video Solutions by Difficulty
Start with Easy problems to build confidence and learn fundamental patterns. Progress to Medium problems where most interview questions fall. Hard problems help you prepare for the toughest interview rounds at top tech companies.