Skip to main content
FleetCode

Video Solutions

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

35
With Videos
0
Easy
35
Medium
0
Hard

Filter by Difficulty

Browse video solutions by difficulty level

Clear filter×

988. Smallest String Starting From Leaf

MediumBacktrackingBinary TreeDepth-First Search
Watch Solutions61.2% acceptance

991. Broken Calculator

MediumGreedyMath
Watch Solutions56.0% acceptance

1003. Check If Word Is Valid After Substitutions

MediumStackString
Watch Solutions61.1% acceptance

1004. Max Consecutive Ones III

MediumArrayBinary SearchPrefix Sum
Watch Solutions68.0% acceptance

1007. Minimum Domino Rotations For Equal Row

MediumArrayGreedy
Watch Solutions56.5% acceptance

1008. Construct Binary Search Tree from Preorder Traversal

MediumArrayBinary Search TreeBinary Tree
Watch Solutions84.1% acceptance

1010. Pairs of Songs With Total Durations Divisible by 60

MediumArrayCountingHash Table
Watch Solutions53.1% acceptance

1011. Capacity To Ship Packages Within D Days

MediumArrayBinary Search
Watch Solutions74.2% acceptance

1014. Best Sightseeing Pair

MediumArrayDynamic Programming
Watch Solutions62.7% acceptance

1015. Smallest Integer Divisible by K

MediumHash TableMath
Watch Solutions54.4% acceptance

1016. Binary String With Substrings Representing 1 To N

MediumString
Watch Solutions58.5% acceptance

1024. Video Stitching

MediumArrayDynamic ProgrammingGreedy
Watch Solutions52.6% acceptance

1026. Maximum Difference Between Node and Ancestor

MediumBinary TreeDepth-First SearchTree
Watch Solutions78.1% acceptance

1027. Longest Arithmetic Subsequence

MediumArrayBinary SearchDynamic Programming
Watch Solutions49.9% acceptance

1033. Moving Stones Until Consecutive

MediumBrainteaserMath
Watch Solutions52.2% acceptance

1034. Coloring A Border

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

1035. Uncrossed Lines

MediumArrayDynamic Programming
Watch Solutions65.1% acceptance

1038. Binary Search Tree to Greater Sum Tree

MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions88.3% acceptance

1039. Minimum Score Triangulation of Polygon

MediumArrayDynamic Programming
Watch Solutions67.4% acceptance

1041. Robot Bounded In Circle

MediumMathSimulationString
Watch Solutions56.6% acceptance

1043. Partition Array for Maximum Sum

MediumArrayDynamic Programming
Watch Solutions77.4% acceptance

1045. Customers Who Bought All Products

MediumDatabase
Watch Solutions62.6% acceptance

1052. Grumpy Bookstore Owner

MediumArraySliding Window
Watch Solutions64.2% acceptance

1053. Previous Permutation With One Swap

MediumArrayGreedy
Watch Solutions49.5% acceptance

1055. Shortest Way to Form String

MediumBinary SearchGreedyString
Watch Solutions61.6% acceptance

1057. Campus Bikes

MediumArrayGreedySorting
Watch Solutions58.8% acceptance

1058. Minimize Rounding Error to Meet Target

MediumArrayGreedyMath
Watch Solutions45.9% acceptance

1059. All Paths from Source Lead to Destination

MediumGraphTopological Sort
Watch Solutions37.2% acceptance

1060. Missing Element in Sorted Array

MediumArrayBinary Search
Watch Solutions59.7% acceptance

1061. Lexicographically Smallest Equivalent String

MediumStringUnion Find
Watch Solutions81.1% acceptance

1062. Longest Repeating Substring

MediumBinary SearchDynamic ProgrammingHash Function
Watch Solutions63.4% acceptance

1066. Campus Bikes II

MediumArrayBacktrackingBit Manipulation
Watch Solutions55.9% acceptance

1070. Product Sales Analysis III

MediumDatabase
Watch Solutions44.3% acceptance

1072. Flip Columns For Maximum Number of Equal Rows

MediumArrayHash TableMatrix
Watch Solutions78.5% acceptance

1073. Adding Two Negabinary Numbers

MediumArrayMath
Watch Solutions37.7% acceptance
Page 12 of 42

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.