FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
39
With Videos
12
Easy
22
Medium
5
Hard
1501. Countries You Can Safely Invest In
MediumDatabase
Watch Solutions50.3% acceptance
1502. Can Make Arithmetic Progression From Sequence
EasyArraySorting
Watch Solutions68.9% 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
1511. Customer Order Frequency
EasyDatabase
Watch Solutions67.3% acceptance
1512. Number of Good Pairs
EasyArrayCountingHash Table
Watch Solutions89.9% 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
1516. Move Sub-Tree of N-Ary Tree
HardDepth-First SearchTree
Watch Solutions59.7% acceptance
1517. Find Users With Valid E-Mails
EasyDatabase
Watch Solutions44.0% acceptance
1518. Water Bottles
EasyMathSimulation
Watch Solutions72.6% 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
1523. Count Odd Numbers in an Interval Range
EasyMath
Watch Solutions54.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
1526. Minimum Number of Increments on Subarrays to Form a Target Array
HardArrayDynamic ProgrammingGreedy
Watch Solutions78.2% acceptance
1527. Patients With a Condition
EasyDatabase
Watch Solutions40.0% acceptance
1528. Shuffle String
EasyArrayString
Watch Solutions85.5% 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
1531. String Compression II
HardDynamic ProgrammingString
Watch Solutions52.2% acceptance
1532. The Most Recent Three Orders
MediumDatabase
Watch Solutions68.6% acceptance
1534. Count Good Triplets
EasyArrayEnumeration
Watch Solutions85.5% 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
1543. Fix Product Name Format
EasyDatabase
Watch Solutions59.1% acceptance
1544. Make The String Great
EasyStackString
Watch Solutions68.2% acceptance
1545. Find Kth Bit in Nth Binary String
MediumRecursionSimulationString
Watch Solutions73.7% acceptance
1547. Minimum Cost to Cut a Stick
HardArrayDynamic ProgrammingSorting
Watch Solutions62.9% acceptance
1548. The Most Similar Path in a Graph
HardDynamic ProgrammingGraph
Watch Solutions59.2% acceptance
1549. The Most Recent Orders for Each Product
MediumDatabase
Watch Solutions64.9% acceptance
1550. Three Consecutive Odds
EasyArray
Watch Solutions69.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.