FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
43
With Videos
0
Easy
43
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
MediumArrayGreedySorting
Watch Solutions41.1% acceptance
1466. Reorder Routes to Make All Paths Lead to the City Zero
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions65.7% acceptance
1468. Calculate Salaries
MediumDatabase
Watch Solutions78.4% acceptance
1471. The k Strongest Values in an Array
MediumArraySortingTwo Pointers
Watch Solutions62.6% acceptance
1472. Design Browser History
MediumArrayData StreamDesign
Watch Solutions78.3% acceptance
1476. Subrectangle Queries
MediumArrayDesignMatrix
Watch Solutions86.3% acceptance
1481. Least Number of Unique Integers after K Removals
MediumArrayCountingGreedy
Watch Solutions63.8% acceptance
1482. Minimum Number of Days to Make m Bouquets
MediumArrayBinary Search
Watch Solutions56.9% acceptance
1485. Clone Binary Tree With Random Pointer
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions81.2% acceptance
1487. Making File Names Unique
MediumArrayHash TableString
Watch Solutions38.5% acceptance
1488. Avoid Flood in The City
MediumArrayBinary SearchGreedy
Watch Solutions39.0% acceptance
1490. Clone N-ary Tree
MediumBreadth-First SearchDepth-First SearchHash Table
Watch Solutions83.2% acceptance
1493. Longest Subarray of 1's After Deleting One Element
MediumArrayDynamic ProgrammingSliding Window
Watch Solutions71.1% acceptance
1497. Check If Array Pairs Are Divisible by k
MediumArrayCountingHash Table
Watch Solutions46.2% acceptance
1498. Number of Subsequences That Satisfy the Given Sum Condition
MediumArrayBinary SearchSorting
Watch Solutions49.2% acceptance
1501. Countries You Can Safely Invest In
MediumDatabase
Watch Solutions50.3% acceptance
1503. Last Moment Before All Ants Fall Out of a Plank
MediumArrayBrainteaserSimulation
Watch Solutions68.3% acceptance
1504. Count Submatrices With All Ones
MediumArrayDynamic ProgrammingMatrix
Watch Solutions71.0% acceptance
1506. Find Root of N-Ary Tree
MediumBit ManipulationDepth-First SearchHash Table
Watch Solutions78.4% acceptance
1508. Range Sum of Sorted Subarray Sums
MediumArrayBinary SearchSorting
Watch Solutions63.2% acceptance
1509. Minimum Difference Between Largest and Smallest Value in Three Moves
MediumArrayGreedySorting
Watch Solutions59.2% acceptance
1513. Number of Substrings With Only 1s
MediumMathString
Watch Solutions57.4% acceptance
1514. Path with Maximum Probability
MediumArrayGraphHeap (Priority Queue)
Watch Solutions65.4% acceptance
1519. Number of Nodes in the Sub-Tree With the Same Label
MediumBreadth-First SearchCountingDepth-First Search
Watch Solutions55.5% acceptance
1522. Diameter of N-Ary Tree
MediumDepth-First SearchTree
Watch Solutions75.4% acceptance
1524. Number of Sub-arrays With Odd Sum
MediumArrayDynamic ProgrammingMath
Watch Solutions55.7% acceptance
1525. Number of Good Ways to Split a String
MediumBit ManipulationDynamic ProgrammingHash Table
Watch Solutions68.2% acceptance
1529. Minimum Suffix Flips
MediumGreedyString
Watch Solutions73.9% acceptance
1530. Number of Good Leaf Nodes Pairs
MediumBinary TreeDepth-First SearchTree
Watch Solutions71.9% acceptance
1532. The Most Recent Three Orders
MediumDatabase
Watch Solutions68.6% acceptance
1535. Find the Winner of an Array Game
MediumArraySimulation
Watch Solutions56.8% acceptance
1536. Minimum Swaps to Arrange a Binary Grid
MediumArrayGreedyMatrix
Watch Solutions70.1% acceptance
1538. Guess the Majority in a Hidden Array
MediumArrayInteractiveMath
Watch Solutions68.8% acceptance
1540. Can Convert String in K Moves
MediumHash TableString
Watch Solutions37.6% acceptance
1541. Minimum Insertions to Balance a Parentheses String
MediumGreedyStackString
Watch Solutions53.5% acceptance
1545. Find Kth Bit in Nth Binary String
MediumRecursionSimulationString
Watch Solutions73.7% acceptance
1549. The Most Recent Orders for Each Product
MediumDatabase
Watch Solutions64.9% acceptance
1551. Minimum Operations to Make Array Equal
MediumMath
Watch Solutions82.8% acceptance
1554. Strings Differ by One Character
MediumHash FunctionHash TableRolling Hash
Watch Solutions40.0% acceptance
1555. Bank Account Summary
MediumDatabase
Watch Solutions51.5% acceptance
1557. Minimum Number of Vertices to Reach All Nodes
MediumGraph
Watch Solutions81.6% acceptance
1558. Minimum Numbers of Function Calls to Make Target Array
MediumArrayBit ManipulationGreedy
Watch Solutions62.9% acceptance
1559. Detect Cycles in 2D Grid
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions63.2% 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.