FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
32
With Videos
9
Easy
20
Medium
3
Hard
1001. Grid Illumination
HardArrayHash Table
Watch Solutions39.7% acceptance
1002. Find Common Characters
EasyArrayHash TableString
Watch Solutions74.6% acceptance
1003. Check If Word Is Valid After Substitutions
MediumStackString
Watch Solutions61.1% acceptance
1004. Max Consecutive Ones III
MediumArrayBinary SearchPrefix Sum
Watch Solutions68.0% acceptance
1007. Minimum Domino Rotations For Equal Row
MediumArrayGreedy
Watch Solutions56.5% acceptance
1008. Construct Binary Search Tree from Preorder Traversal
MediumArrayBinary Search TreeBinary Tree
Watch Solutions84.1% acceptance
1009. Complement of Base 10 Integer
EasyBit Manipulation
Watch Solutions63.3% acceptance
1010. Pairs of Songs With Total Durations Divisible by 60
MediumArrayCountingHash Table
Watch Solutions53.6% acceptance
1011. Capacity To Ship Packages Within D Days
MediumArrayBinary Search
Watch Solutions74.2% acceptance
1013. Partition Array Into Three Parts With Equal Sum
EasyArrayGreedy
Watch Solutions42.6% acceptance
1014. Best Sightseeing Pair
MediumArrayDynamic Programming
Watch Solutions62.7% acceptance
1015. Smallest Integer Divisible by K
MediumHash TableMath
Watch Solutions54.4% acceptance
1016. Binary String With Substrings Representing 1 To N
MediumString
Watch Solutions58.5% acceptance
1018. Binary Prefix Divisible By 5
EasyArrayBit Manipulation
Watch Solutions53.5% acceptance
1022. Sum of Root To Leaf Binary Numbers
EasyBinary TreeDepth-First SearchTree
Watch Solutions76.6% acceptance
1024. Video Stitching
MediumArrayDynamic ProgrammingGreedy
Watch Solutions52.6% acceptance
1026. Maximum Difference Between Node and Ancestor
MediumBinary TreeDepth-First SearchTree
Watch Solutions78.1% acceptance
1027. Longest Arithmetic Subsequence
MediumArrayBinary SearchDynamic Programming
Watch Solutions49.9% acceptance
1028. Recover a Tree From Preorder Traversal
HardBinary TreeDepth-First SearchString
Watch Solutions83.2% acceptance
1033. Moving Stones Until Consecutive
MediumBrainteaserMath
Watch Solutions52.2% acceptance
1034. Coloring A Border
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions51.2% acceptance
1035. Uncrossed Lines
MediumArrayDynamic Programming
Watch Solutions65.1% acceptance
1037. Valid Boomerang
EasyArrayGeometryMath
Watch Solutions39.9% acceptance
1038. Binary Search Tree to Greater Sum Tree
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions88.3% acceptance
1039. Minimum Score Triangulation of Polygon
MediumArrayDynamic Programming
Watch Solutions67.4% acceptance
1041. Robot Bounded In Circle
MediumMathSimulationString
Watch Solutions56.6% acceptance
1043. Partition Array for Maximum Sum
MediumArrayDynamic Programming
Watch Solutions77.4% acceptance
1044. Longest Duplicate Substring
HardBinary SearchHash FunctionRolling Hash
Watch Solutions31.1% acceptance
1045. Customers Who Bought All Products
MediumDatabase
Watch Solutions62.6% acceptance
1046. Last Stone Weight
EasyArrayHeap (Priority Queue)
Watch Solutions66.4% acceptance
1047. Remove All Adjacent Duplicates In String
EasyStackString
Watch Solutions73.6% acceptance
1050. Actors and Directors Who Cooperated At Least Three Times
EasyDatabase
Watch Solutions70.3% 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.