FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
46
With Videos
10
Easy
25
Medium
11
Hard
2301. Match Substring After Replacement
HardArrayHash TableString
Watch Solutions43.3% acceptance
2302. Count Subarrays With Score Less Than K
HardArrayBinary SearchPrefix Sum
Watch Solutions62.3% acceptance
2303. Calculate Amount Paid in Taxes
EasyArraySimulation
Watch Solutions69.1% acceptance
2304. Minimum Path Cost in a Grid
MediumArrayDynamic ProgrammingMatrix
Watch Solutions68.0% acceptance
2305. Fair Distribution of Cookies
MediumArrayBacktrackingBit Manipulation
Watch Solutions69.8% acceptance
2306. Naming a Company
HardArrayBit ManipulationEnumeration
Watch Solutions46.4% acceptance
2307. Check for Contradictions in Equations
HardArrayDepth-First SearchGraph
Watch Solutions43.8% acceptance
2308. Arrange Table by Gender
MediumDatabase
Watch Solutions69.5% acceptance
2309. Greatest English Letter in Upper and Lower Case
EasyEnumerationHash TableString
Watch Solutions72.6% acceptance
2310. Sum of Numbers With Units Digit K
MediumDynamic ProgrammingEnumerationGreedy
Watch Solutions28.2% acceptance
2311. Longest Binary Subsequence Less Than or Equal to K
MediumDynamic ProgrammingGreedyMemoization
Watch Solutions52.8% acceptance
2312. Selling Pieces of Wood
HardArrayDynamic ProgrammingMemoization
Watch Solutions52.8% acceptance
2313. Minimum Flips in Binary Tree to Get Result
HardBinary TreeDepth-First SearchDynamic Programming
Watch Solutions56.9% acceptance
2314. The First Day of the Maximum Recorded Degree in Each City
MediumDatabase
Watch Solutions72.2% acceptance
2315. Count Asterisks
EasyString
Watch Solutions83.3% acceptance
2316. Count Unreachable Pairs of Nodes in an Undirected Graph
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions49.9% acceptance
2317. Maximum XOR After Operations
MediumArrayBit ManipulationMath
Watch Solutions79.9% acceptance
2318. Number of Distinct Roll Sequences
HardDynamic ProgrammingMemoization
Watch Solutions58.2% acceptance
2320. Count Number of Ways to Place Houses
MediumDynamic Programming
Watch Solutions43.8% acceptance
2322. Minimum Score After Removals on a Tree
HardArrayBit ManipulationDepth-First Search
Watch Solutions76.2% acceptance
2323. Find Minimum Time to Finish All Jobs II
MediumArrayGreedySorting
Watch Solutions65.8% acceptance
2324. Product Sales Analysis IV
MediumDatabase
Watch Solutions74.7% acceptance
2325. Decode the Message
EasyHash TableString
Watch Solutions85.8% acceptance
2326. Spiral Matrix IV
MediumArrayLinked ListMatrix
Watch Solutions82.3% acceptance
2327. Number of People Aware of a Secret
MediumDynamic ProgrammingQueueSimulation
Watch Solutions60.9% acceptance
2328. Number of Increasing Paths in a Grid
HardArrayBreadth-First SearchDepth-First Search
Watch Solutions57.4% acceptance
2329. Product Sales Analysis V
EasyDatabase
Watch Solutions69.9% acceptance
2330. Valid Palindrome IV
MediumStringTwo Pointers
Watch Solutions75.8% acceptance
2331. Evaluate Boolean Binary Tree
EasyBinary TreeDepth-First SearchTree
Watch Solutions82.7% acceptance
2332. The Latest Time to Catch a Bus
MediumArrayBinary SearchSorting
Watch Solutions30.0% acceptance
2333. Minimum Sum of Squared Difference
MediumArrayBinary SearchGreedy
Watch Solutions26.8% acceptance
2335. Minimum Amount of Time to Fill Cups
EasyArrayGreedyHeap (Priority Queue)
Watch Solutions60.1% acceptance
2336. Smallest Number in Infinite Set
MediumDesignHash TableHeap (Priority Queue)
Watch Solutions70.6% acceptance
2337. Move Pieces to Obtain a String
MediumStringTwo Pointers
Watch Solutions56.7% acceptance
2338. Count the Number of Ideal Arrays
HardCombinatoricsDynamic ProgrammingMath
Watch Solutions57.0% acceptance
2339. All the Matches of the League
EasyDatabase
Watch Solutions88.0% acceptance
2340. Minimum Adjacent Swaps to Make a Valid Array
MediumArrayGreedy
Watch Solutions72.6% acceptance
2341. Maximum Number of Pairs in Array
EasyArrayCountingHash Table
Watch Solutions76.0% acceptance
2342. Max Sum of a Pair With Equal Sum of Digits
MediumArrayHash TableHeap (Priority Queue)
Watch Solutions66.0% acceptance
2343. Query Kth Smallest Trimmed Number
MediumArrayDivide and ConquerHeap (Priority Queue)
Watch Solutions47.9% acceptance
2345. Finding the Number of Visible Mountains
MediumArrayMonotonic StackSorting
Watch Solutions37.3% acceptance
2346. Compute the Rank as a Percentage
MediumDatabase
Watch Solutions33.7% acceptance
2347. Best Poker Hand
EasyArrayCountingHash Table
Watch Solutions61.7% acceptance
2348. Number of Zero-Filled Subarrays
MediumArrayMath
Watch Solutions70.1% acceptance
2349. Design a Number Container System
MediumDesignHash TableHeap (Priority Queue)
Watch Solutions57.1% acceptance
2350. Shortest Impossible Sequence of Rolls
HardArrayGreedyHash Table
Watch Solutions69.3% 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.