Skip to main content
FleetCode

Video Solutions

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

39
With Videos
9
Easy
21
Medium
9
Hard

Filter by Difficulty

Browse video solutions by difficulty level

1151. Minimum Swaps to Group All 1's Together

MediumArraySliding Window
Watch Solutions61.2% acceptance

1152. Analyze User Website Visit Pattern

MediumArrayHash TableSorting
Watch Solutions44.3% acceptance

1153. String Transforms Into Another String

HardHash TableString
Watch Solutions34.9% acceptance

1155. Number of Dice Rolls With Target Sum

MediumDynamic Programming
Watch Solutions62.2% acceptance

1158. Market Analysis I

MediumDatabase
Watch Solutions57.2% acceptance

1159. Market Analysis II

HardDatabase
Watch Solutions57.4% acceptance

1160. Find Words That Can Be Formed by Characters

EasyArrayCountingHash Table
Watch Solutions71.5% acceptance

1161. Maximum Level Sum of a Binary Tree

MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions70.0% acceptance

1162. As Far from Land as Possible

MediumArrayBreadth-First SearchDynamic Programming
Watch Solutions52.2% acceptance

1163. Last Substring in Lexicographical Order

HardStringTwo Pointers
Watch Solutions35.1% acceptance

1164. Product Price at a Given Date

MediumDatabase
Watch Solutions57.0% acceptance

1165. Single-Row Keyboard

EasyHash TableString
Watch Solutions87.6% acceptance

1166. Design File System

MediumDesignHash TableString
Watch Solutions65.1% acceptance

1167. Minimum Cost to Connect Sticks

MediumArrayGreedyHeap (Priority Queue)
Watch Solutions71.8% acceptance

1168. Optimize Water Distribution in a Village

HardGraphHeap (Priority Queue)Minimum Spanning Tree
Watch Solutions65.5% acceptance

1169. Invalid Transactions

MediumArrayHash TableSorting
Watch Solutions32.1% acceptance

1170. Compare Strings by Frequency of the Smallest Character

MediumArrayBinary SearchHash Table
Watch Solutions63.3% acceptance

1172. Dinner Plate Stacks

HardDesignHash TableHeap (Priority Queue)
Watch Solutions33.6% acceptance

1173. Immediate Food Delivery I

EasyDatabase
Watch Solutions80.9% acceptance

1174. Immediate Food Delivery II

MediumDatabase
Watch Solutions53.1% acceptance

1176. Diet Plan Performance

EasyArraySliding Window
Watch Solutions55.9% acceptance

1178. Number of Valid Words for Each Puzzle

HardArrayBit ManipulationHash Table
Watch Solutions47.8% acceptance

1179. Reformat Department Table

EasyDatabase
Watch Solutions76.9% acceptance

1180. Count Substrings with Only One Distinct Letter

EasyMathString
Watch Solutions80.9% acceptance

1181. Before and After Puzzle

MediumArrayHash TableSorting
Watch Solutions51.8% acceptance

1182. Shortest Distance to Target Color

MediumArrayBinary SearchDynamic Programming
Watch Solutions56.5% acceptance

1183. Maximum Number of Ones

HardGreedyHeap (Priority Queue)
Watch Solutions70.6% acceptance

1187. Make Array Strictly Increasing

HardArrayBinary SearchDynamic Programming
Watch Solutions58.0% acceptance

1188. Design Bounded Blocking Queue

MediumConcurrency
Watch Solutions72.6% acceptance

1189. Maximum Number of Balloons

EasyCountingHash TableString
Watch Solutions64.1% acceptance

1190. Reverse Substrings Between Each Pair of Parentheses

MediumStackString
Watch Solutions71.8% acceptance

1191. K-Concatenation Maximum Sum

MediumArrayDynamic Programming
Watch Solutions25.9% acceptance

1193. Monthly Transactions I

MediumDatabase
Watch Solutions58.3% acceptance

1194. Tournament Winners

HardDatabase
Watch Solutions49.3% acceptance

1195. Fizz Buzz Multithreaded

MediumConcurrency
Watch Solutions73.2% acceptance

1196. How Many Apples Can You Put into the Basket

EasyArrayGreedySorting
Watch Solutions67.0% acceptance

1197. Minimum Knight Moves

MediumBreadth-First Search
Watch Solutions41.8% acceptance

1198. Find Smallest Common Element in All Rows

MediumArrayBinary SearchCounting
Watch Solutions76.5% acceptance

1200. Minimum Absolute Difference

EasyArraySorting
Watch Solutions75.1% acceptance
Page 24 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.