Skip to main content
FleetCode

Video Solutions

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

42
With Videos
8
Easy
25
Medium
9
Hard

Filter by Difficulty

Browse video solutions by difficulty level

2101. Detonate the Maximum Bombs

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

2102. Sequentially Ordinal Rank Tracker

HardData StreamDesignHeap (Priority Queue)
Watch Solutions61.5% acceptance

2103. Rings and Rods

EasyHash TableString
Watch Solutions81.5% acceptance

2104. Sum of Subarray Ranges

MediumArrayMonotonic StackStack
Watch Solutions61.6% acceptance

2105. Watering Plants II

MediumArraySimulationTwo Pointers
Watch Solutions48.8% acceptance

2106. Maximum Fruits Harvested After at Most K Steps

HardArrayBinary SearchPrefix Sum
Watch Solutions61.0% acceptance

2107. Number of Unique Flavors After Sharing K Candies

MediumArrayHash TableSliding Window
Watch Solutions62.4% acceptance

2108. Find First Palindromic String in the Array

EasyArrayStringTwo Pointers
Watch Solutions83.9% acceptance

2109. Adding Spaces to a String

MediumArraySimulationString
Watch Solutions71.8% acceptance

2110. Number of Smooth Descent Periods of a Stock

MediumArrayDynamic ProgrammingMath
Watch Solutions67.7% acceptance

2111. Minimum Operations to Make the Array K-Increasing

HardArrayBinary Search
Watch Solutions40.5% acceptance

2112. The Airport With the Most Traffic

MediumDatabase
Watch Solutions70.6% acceptance

2114. Maximum Number of Words Found in Sentences

EasyArrayString
Watch Solutions86.6% acceptance

2115. Find All Possible Recipes from Given Supplies

MediumArrayGraphHash Table
Watch Solutions56.8% acceptance

2116. Check if a Parentheses String Can Be Valid

MediumGreedyStackString
Watch Solutions45.1% acceptance

2117. Abbreviating the Product of a Range

HardMath
Watch Solutions25.0% acceptance

2118. Build the Equation

HardDatabase
Watch Solutions55.9% acceptance

2120. Execution of All Suffix Instructions Staying in a Grid

MediumSimulationString
Watch Solutions82.4% acceptance

2121. Intervals Between Identical Elements

MediumArrayHash TablePrefix Sum
Watch Solutions47.8% acceptance

2124. Check if All A's Appears Before All B's

EasyString
Watch Solutions73.2% acceptance

2125. Number of Laser Beams in a Bank

MediumArrayMathMatrix
Watch Solutions87.0% acceptance

2126. Destroying Asteroids

MediumArrayGreedySorting
Watch Solutions59.7% acceptance

2127. Maximum Employees to Be Invited to a Meeting

HardDepth-First SearchGraphTopological Sort
Watch Solutions61.8% acceptance

2128. Remove All Ones With Row and Column Flips

MediumArrayBit ManipulationMath
Watch Solutions76.2% acceptance

2130. Maximum Twin Sum of a Linked List

MediumLinked ListStackTwo Pointers
Watch Solutions83.2% acceptance

2131. Longest Palindrome by Concatenating Two Letter Words

MediumArrayCountingGreedy
Watch Solutions53.5% acceptance

2133. Check if Every Row and Column Contains All Numbers

EasyArrayHash TableMatrix
Watch Solutions54.0% acceptance

2134. Minimum Swaps to Group All 1's Together II

MediumArraySliding Window
Watch Solutions65.5% acceptance

2135. Count Words Obtained After Adding a Letter

MediumArrayBit ManipulationHash Table
Watch Solutions44.0% acceptance

2136. Earliest Possible Day of Full Bloom

HardArrayGreedySorting
Watch Solutions71.4% acceptance

2137. Pour Water Between Buckets to Make Water Levels Equal

MediumArrayBinary Search
Watch Solutions68.4% acceptance

2138. Divide a String Into Groups of Size k

EasySimulationString
Watch Solutions77.1% acceptance

2139. Minimum Moves to Reach Target Score

MediumGreedyMath
Watch Solutions52.3% acceptance

2140. Solving Questions With Brainpower

MediumArrayDynamic Programming
Watch Solutions60.2% acceptance

2141. Maximum Running Time of N Computers

HardArrayBinary SearchGreedy
Watch Solutions56.4% acceptance

2142. The Number of Passengers in Each Bus I

MediumDatabase
Watch Solutions48.8% acceptance

2144. Minimum Cost of Buying Candies With Discount

EasyArrayGreedySorting
Watch Solutions71.5% acceptance

2145. Count the Hidden Sequences

MediumArrayPrefix Sum
Watch Solutions56.7% acceptance

2147. Number of Ways to Divide a Long Corridor

HardDynamic ProgrammingMathString
Watch Solutions54.6% acceptance

2148. Count Elements With Strictly Smaller and Greater Elements

EasyArrayCountingSorting
Watch Solutions59.9% 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
Page 43 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.