Skip to main content
FleetCode

Video Solutions

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

36
With Videos
6
Easy
25
Medium
5
Hard

Filter by Difficulty

Browse video solutions by difficulty level

502. IPO

HardArrayGreedyHeap (Priority Queue)
Watch Solutions53.6% acceptance

503. Next Greater Element II

MediumArrayMonotonic StackStack
Watch Solutions68.7% acceptance

505. The Maze II

MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions55.0% acceptance

510. Inorder Successor in BST II

MediumBinary Search TreeBinary TreeTree
Watch Solutions60.9% acceptance

511. Game Play Analysis I

EasyDatabase
Watch Solutions75.1% acceptance

512. Game Play Analysis II

EasyDatabase
Watch Solutions53.4% acceptance

513. Find Bottom Left Tree Value

MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions72.2% acceptance

514. Freedom Trail

HardBreadth-First SearchDepth-First SearchDynamic Programming
Watch Solutions59.4% acceptance

515. Find Largest Value in Each Tree Row

MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions66.3% acceptance

518. Coin Change II

MediumArrayDynamic Programming
Watch Solutions59.7% acceptance

520. Detect Capital

EasyString
Watch Solutions56.8% acceptance

522. Longest Uncommon Subsequence II

MediumArrayHash TableSorting
Watch Solutions45.2% acceptance

523. Continuous Subarray Sum

MediumArrayHash TableMath
Watch Solutions31.3% acceptance

524. Longest Word in Dictionary through Deleting

MediumArraySortingString
Watch Solutions52.6% acceptance

526. Beautiful Arrangement

MediumArrayBacktrackingBit Manipulation
Watch Solutions64.9% acceptance

527. Word Abbreviation

HardArrayGreedySorting
Watch Solutions62.7% acceptance

528. Random Pick with Weight

MediumArrayBinary SearchMath
Watch Solutions49.0% acceptance

529. Minesweeper

MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions68.7% acceptance

530. Minimum Absolute Difference in BST

EasyBinary Search TreeBinary TreeBreadth-First Search
Watch Solutions59.3% acceptance

531. Lonely Pixel I

MediumArrayHash TableMatrix
Watch Solutions62.3% acceptance

533. Lonely Pixel II

MediumArrayHash TableMatrix
Watch Solutions48.7% acceptance

534. Game Play Analysis III

MediumDatabase
Watch Solutions81.0% acceptance

535. Encode and Decode TinyURL

MediumDesignHash FunctionHash Table
Watch Solutions86.5% acceptance

536. Construct Binary Tree from String

MediumBinary TreeDepth-First SearchStack
Watch Solutions58.7% acceptance

537. Complex Number Multiplication

MediumMathSimulationString
Watch Solutions73.3% acceptance

538. Convert BST to Greater Tree

MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions71.5% acceptance

540. Single Element in a Sorted Array

MediumArrayBinary Search
Watch Solutions59.3% acceptance

541. Reverse String II

EasyStringTwo Pointers
Watch Solutions54.1% acceptance

543. Diameter of Binary Tree

EasyBinary TreeDepth-First SearchTree
Watch Solutions65.8% acceptance

544. Output Contest Matches

MediumRecursionSimulationString
Watch Solutions77.3% acceptance

545. Boundary of Binary Tree

MediumBinary TreeDepth-First SearchTree
Watch Solutions48.0% acceptance

546. Remove Boxes

HardArrayDynamic ProgrammingMemoization
Watch Solutions49.4% acceptance

547. Number of Provinces

MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions70.8% acceptance

548. Split Array with Equal Sum

HardArrayHash TablePrefix Sum
Watch Solutions50.1% acceptance

549. Binary Tree Longest Consecutive Sequence II

MediumBinary TreeDepth-First SearchTree
Watch Solutions50.1% acceptance

550. Game Play Analysis IV

MediumDatabase
Watch Solutions38.4% acceptance
Page 11 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.