FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
43
With Videos
0
Easy
43
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2139. Minimum Moves to Reach Target Score
MediumGreedyMath
Watch Solutions52.3% acceptance
2140. Solving Questions With Brainpower
MediumArrayDynamic Programming
Watch Solutions60.2% acceptance
2142. The Number of Passengers in Each Bus I
MediumDatabase
Watch Solutions48.8% acceptance
2145. Count the Hidden Sequences
MediumArrayPrefix Sum
Watch Solutions56.7% acceptance
2149. Rearrange Array Elements by Sign
MediumArraySimulationTwo Pointers
Watch Solutions84.7% acceptance
2150. Find All Lonely Numbers in the Array
MediumArrayCountingHash Table
Watch Solutions63.4% acceptance
2152. Minimum Number of Lines to Cover Points
MediumArrayBacktrackingBit Manipulation
Watch Solutions43.9% acceptance
2155. All Divisions With the Highest Score of a Binary Array
MediumArray
Watch Solutions65.5% acceptance
2159. Order Two Columns Independently
MediumDatabase
Watch Solutions60.5% acceptance
2161. Partition Array According to Given Pivot
MediumArraySimulationTwo Pointers
Watch Solutions90.8% acceptance
2165. Smallest Value of the Rearranged Number
MediumMathSorting
Watch Solutions53.5% acceptance
2166. Design Bitset
MediumArrayDesignHash Table
Watch Solutions32.7% acceptance
2168. Unique Substrings With Equal Digit Frequency
MediumCountingHash FunctionHash Table
Watch Solutions64.6% acceptance
2170. Minimum Operations to Make the Array Alternating
MediumArrayCountingGreedy
Watch Solutions35.7% acceptance
2171. Removing Minimum Number of Magic Beans
MediumArrayEnumerationGreedy
Watch Solutions44.5% acceptance
2174. Remove All Ones With Row and Column Flips II
MediumArrayBit ManipulationBreadth-First Search
Watch Solutions67.2% acceptance
2175. The Change in Global Rankings
MediumDatabase
Watch Solutions60.1% acceptance
2177. Find Three Consecutive Integers That Sum to a Given Number
MediumMathSimulation
Watch Solutions65.3% acceptance
2181. Merge Nodes in Between Zeros
MediumLinked ListSimulation
Watch Solutions89.8% acceptance
2182. Construct String With Repeat Limit
MediumCountingGreedyHash Table
Watch Solutions70.9% acceptance
2184. Number of Ways to Build Sturdy Brick Wall
MediumArrayBit ManipulationBitmask
Watch Solutions49.2% acceptance
2186. Minimum Number of Steps to Make Two Strings Anagram II
MediumCountingHash TableString
Watch Solutions72.7% acceptance
2187. Minimum Time to Complete Trips
MediumArrayBinary Search
Watch Solutions39.6% acceptance
2189. Number of Ways to Build House of Cards
MediumDynamic ProgrammingMath
Watch Solutions62.7% acceptance
2191. Sort the Jumbled Numbers
MediumArraySorting
Watch Solutions60.1% acceptance
2192. All Ancestors of a Node in a Directed Acyclic Graph
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions62.1% acceptance
2195. Append K Integers With Minimal Sum
MediumArrayGreedyMath
Watch Solutions26.9% acceptance
2196. Create Binary Tree From Descriptions
MediumArrayBinary TreeHash Table
Watch Solutions83.9% acceptance
2201. Count Artifacts That Can Be Extracted
MediumArrayHash TableSimulation
Watch Solutions57.1% acceptance
2202. Maximize the Topmost Element After K Moves
MediumArrayGreedy
Watch Solutions24.0% acceptance
2207. Maximize Number of Subsequences in a String
MediumGreedyPrefix SumString
Watch Solutions36.0% acceptance
2208. Minimum Operations to Halve Array Sum
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions50.1% acceptance
2211. Count Collisions on a Road
MediumSimulationStackString
Watch Solutions58.1% acceptance
2212. Maximum Points in an Archery Competition
MediumArrayBacktrackingBit Manipulation
Watch Solutions52.2% acceptance
2214. Minimum Health to Beat Game
MediumArrayGreedy
Watch Solutions58.9% acceptance
2217. Find Palindrome With Fixed Length
MediumArrayMath
Watch Solutions38.0% acceptance
2219. Maximum Sum Score of Array
MediumArrayPrefix Sum
Watch Solutions62.6% acceptance
2221. Find Triangular Sum of an Array
MediumArrayCombinatoricsMath
Watch Solutions82.0% acceptance
2222. Number of Ways to Select Buildings
MediumDynamic ProgrammingPrefix SumString
Watch Solutions50.8% acceptance
2225. Find Players With Zero or One Losses
MediumArrayCountingHash Table
Watch Solutions72.4% acceptance
2226. Maximum Candies Allocated to K Children
MediumArrayBinary Search
Watch Solutions49.9% acceptance
2228. Users With Two Purchases Within Seven Days
MediumDatabase
Watch Solutions45.2% acceptance
2233. Maximum Product After K Increments
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions44.0% acceptance
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.