Skip to main content
FleetCode

Video Solutions

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

38
With Videos
0
Easy
38
Medium
0
Hard

Filter by Difficulty

Browse video solutions by difficulty level

Clear filter×

708. Insert into a Sorted Circular Linked List

MediumLinked List
Watch Solutions38.5% acceptance

712. Minimum ASCII Delete Sum for Two Strings

MediumDynamic ProgrammingString
Watch Solutions70.9% acceptance

713. Subarray Product Less Than K

MediumArrayBinary SearchPrefix Sum
Watch Solutions54.8% acceptance

718. Maximum Length of Repeated Subarray

MediumArrayBinary SearchDynamic Programming
Watch Solutions51.5% acceptance

720. Longest Word in Dictionary

MediumArrayHash TableSorting
Watch Solutions55.2% acceptance

721. Accounts Merge

MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions61.6% acceptance

722. Remove Comments

MediumArrayString
Watch Solutions40.1% acceptance

723. Candy Crush

MediumArrayMatrixSimulation
Watch Solutions77.6% acceptance

725. Split Linked List in Parts

MediumLinked List
Watch Solutions70.6% acceptance

729. My Calendar I

MediumArrayBinary SearchDesign
Watch Solutions58.4% acceptance

731. My Calendar II

MediumArrayBinary SearchDesign
Watch Solutions63.3% acceptance

737. Sentence Similarity II

MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions51.2% acceptance

740. Delete and Earn

MediumArrayDynamic ProgrammingHash Table
Watch Solutions57.1% acceptance

742. Closest Leaf in a Binary Tree

MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions47.4% acceptance

743. Network Delay Time

MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions61.1% acceptance

750. Number Of Corner Rectangles

MediumArrayDynamic ProgrammingMath
Watch Solutions67.8% acceptance

751. IP to CIDR

MediumBit ManipulationString
Watch Solutions53.7% acceptance

752. Open the Lock

MediumArrayBreadth-First SearchHash Table
Watch Solutions61.2% acceptance

755. Pour Water

MediumArraySimulation
Watch Solutions49.1% acceptance

756. Pyramid Transition Matrix

MediumBit ManipulationBreadth-First SearchDepth-First Search
Watch Solutions60.6% acceptance

763. Partition Labels

MediumGreedyHash TableString
Watch Solutions81.8% acceptance

764. Largest Plus Sign

MediumArrayDynamic Programming
Watch Solutions49.1% acceptance

769. Max Chunks To Make Sorted

MediumArrayGreedyMonotonic Stack
Watch Solutions64.1% acceptance

775. Global and Local Inversions

MediumArrayMath
Watch Solutions42.9% acceptance

776. Split BST

MediumBinary Search TreeBinary TreeRecursion
Watch Solutions82.5% acceptance

777. Swap Adjacent in LR String

MediumStringTwo Pointers
Watch Solutions37.9% acceptance

781. Rabbits in Forest

MediumArrayGreedyHash Table
Watch Solutions58.0% acceptance

784. Letter Case Permutation

MediumBacktrackingBit ManipulationString
Watch Solutions75.7% acceptance

785. Is Graph Bipartite?

MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions59.6% acceptance

786. K-th Smallest Prime Fraction

MediumArrayBinary SearchHeap (Priority Queue)
Watch Solutions69.0% acceptance

787. Cheapest Flights Within K Stops

MediumBreadth-First SearchDepth-First SearchDynamic Programming
Watch Solutions42.1% acceptance

788. Rotated Digits

MediumDynamic ProgrammingMath
Watch Solutions63.9% acceptance

790. Domino and Tromino Tiling

MediumDynamic Programming
Watch Solutions51.4% acceptance

791. Custom Sort String

MediumHash TableSortingString
Watch Solutions72.3% acceptance

792. Number of Matching Subsequences

MediumArrayBinary SearchDynamic Programming
Watch Solutions50.8% acceptance

794. Valid Tic-Tac-Toe State

MediumArrayMatrix
Watch Solutions34.7% acceptance

797. All Paths From Source to Target

MediumBacktrackingBreadth-First SearchDepth-First Search
Watch Solutions83.6% acceptance

799. Champagne Tower

MediumDynamic Programming
Watch Solutions64.1% acceptance
Page 9 of 43

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.