Skip to main content
FleetCode

Video Solutions

Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.

36
With Videos
7
Easy
20
Medium
9
Hard

Filter by Difficulty

Browse video solutions by difficulty level

951. Flip Equivalent Binary Trees

MediumBinary TreeDepth-First SearchTree
Watch Solutions69.8% acceptance

953. Verifying an Alien Dictionary

EasyArrayHash TableString
Watch Solutions55.9% acceptance

954. Array of Doubled Pairs

MediumArrayGreedyHash Table
Watch Solutions39.7% acceptance

955. Delete Columns to Make Sorted II

MediumArrayGreedyString
Watch Solutions49.7% acceptance

956. Tallest Billboard

HardArrayDynamic Programming
Watch Solutions52.0% acceptance

957. Prison Cells After N Days

MediumArrayBit ManipulationHash Table
Watch Solutions39.0% acceptance

959. Regions Cut By Slashes

MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions77.8% acceptance

960. Delete Columns to Make Sorted III

HardArrayDynamic ProgrammingString
Watch Solutions72.7% acceptance

961. N-Repeated Element in Size 2N Array

EasyArrayHash Table
Watch Solutions79.9% acceptance

962. Maximum Width Ramp

MediumArrayMonotonic StackStack
Watch Solutions55.5% acceptance

963. Minimum Area Rectangle II

MediumArrayGeometryMath
Watch Solutions55.9% acceptance

964. Least Operators to Express Number

HardDynamic ProgrammingMathMemoization
Watch Solutions48.3% acceptance

965. Univalued Binary Tree

EasyBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions72.9% acceptance

966. Vowel Spellchecker

MediumArrayHash TableString
Watch Solutions61.4% acceptance

967. Numbers With Same Consecutive Differences

MediumBacktrackingBreadth-First Search
Watch Solutions59.1% acceptance

968. Binary Tree Cameras

HardBinary TreeDepth-First SearchDynamic Programming
Watch Solutions47.7% acceptance

969. Pancake Sorting

MediumArrayGreedySorting
Watch Solutions71.7% acceptance

970. Powerful Integers

MediumEnumerationHash TableMath
Watch Solutions44.5% acceptance

971. Flip Binary Tree To Match Preorder Traversal

MediumBinary TreeDepth-First SearchTree
Watch Solutions51.9% acceptance

975. Odd Even Jump

HardArrayDynamic ProgrammingMonotonic Stack
Watch Solutions41.1% acceptance

976. Largest Perimeter Triangle

EasyArrayGreedyMath
Watch Solutions62.1% acceptance

977. Squares of a Sorted Array

EasyArraySortingTwo Pointers
Watch Solutions73.7% acceptance

978. Longest Turbulent Subarray

MediumArrayDynamic ProgrammingSliding Window
Watch Solutions49.0% acceptance

979. Distribute Coins in Binary Tree

MediumBinary TreeDepth-First SearchTree
Watch Solutions77.2% acceptance

980. Unique Paths III

HardArrayBacktrackingBit Manipulation
Watch Solutions82.8% acceptance

981. Time Based Key-Value Store

MediumBinary SearchDesignHash Table
Watch Solutions49.8% acceptance

982. Triples with Bitwise AND Equal To Zero

HardArrayBit ManipulationHash Table
Watch Solutions60.1% acceptance

983. Minimum Cost For Tickets

MediumArrayDynamic Programming
Watch Solutions67.4% acceptance

985. Sum of Even Numbers After Queries

MediumArraySimulation
Watch Solutions68.8% acceptance

986. Interval List Intersections

MediumArrayTwo Pointers
Watch Solutions73.0% acceptance

987. Vertical Order Traversal of a Binary Tree

HardBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions54.6% acceptance

988. Smallest String Starting From Leaf

MediumBacktrackingBinary TreeDepth-First Search
Watch Solutions61.2% acceptance

989. Add to Array-Form of Integer

EasyArrayMath
Watch Solutions45.6% acceptance

991. Broken Calculator

MediumGreedyMath
Watch Solutions56.0% acceptance

995. Minimum Number of K Consecutive Bit Flips

HardArrayBit ManipulationPrefix Sum
Watch Solutions62.7% acceptance

997. Find the Town Judge

EasyArrayGraphHash Table
Watch Solutions50.6% acceptance
Page 20 of 81

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.