FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
39
With Videos
10
Easy
20
Medium
9
Hard
3101. Count Alternating Subarrays
MediumArrayMath
Watch Solutions57.6% acceptance
3102. Minimize Manhattan Distances
HardArrayGeometryMath
Watch Solutions32.9% acceptance
3103. Find Trending Hashtags II
HardDatabase
Watch Solutions64.7% acceptance
3104. Find Longest Self-Contained Substring
HardBinary SearchHash TablePrefix Sum
Watch Solutions58.6% acceptance
3105. Longest Strictly Increasing or Strictly Decreasing Subarray
EasyArray
Watch Solutions64.9% acceptance
3107. Minimum Operations to Make Median of Array Equal to K
MediumArrayGreedySorting
Watch Solutions47.7% acceptance
3108. Minimum Cost Walk in Weighted Graph
HardArrayBit ManipulationGraph
Watch Solutions68.3% acceptance
3109. Find the Index of Permutation
MediumArrayBinary Indexed TreeBinary Search
Watch Solutions37.1% acceptance
3110. Score of a String
EasyString
Watch Solutions91.4% acceptance
3112. Minimum Time to Visit Disappearing Nodes
MediumArrayGraphHeap (Priority Queue)
Watch Solutions38.2% acceptance
3114. Latest Time You Can Obtain After Replacing Characters
EasyEnumerationString
Watch Solutions35.4% acceptance
3115. Maximum Prime Difference
MediumArrayMathNumber Theory
Watch Solutions59.3% acceptance
3117. Minimum Sum of Values by Dividing Array
HardArrayBinary SearchBit Manipulation
Watch Solutions27.9% acceptance
3118. Friday Purchase III
MediumDatabase
Watch Solutions58.0% acceptance
3119. Maximum Number of Potholes That Can Be Fixed
MediumGreedySortingString
Watch Solutions53.3% acceptance
3120. Count the Number of Special Characters I
EasyHash TableString
Watch Solutions77.2% acceptance
3121. Count the Number of Special Characters II
MediumHash TableString
Watch Solutions60.3% acceptance
3122. Minimum Number of Operations to Satisfy Conditions
MediumArrayDynamic ProgrammingMatrix
Watch Solutions42.4% acceptance
3123. Find Edges in Shortest Paths
HardBreadth-First SearchDepth-First SearchGraph
Watch Solutions47.0% acceptance
3124. Find Longest Calls
MediumDatabase
Watch Solutions62.6% acceptance
3125. Maximum Number That Makes Result of Bitwise AND Zero
MediumGreedySortingString
Watch Solutions70.0% acceptance
3126. Server Utilization Time
MediumDatabase
Watch Solutions60.3% acceptance
3127. Make a Square with the Same Color
EasyArrayEnumerationMatrix
Watch Solutions53.0% acceptance
3129. Find All Possible Stable Binary Arrays I
MediumDynamic ProgrammingPrefix Sum
Watch Solutions53.8% acceptance
3130. Find All Possible Stable Binary Arrays II
HardDynamic ProgrammingPrefix Sum
Watch Solutions59.0% acceptance
3131. Find the Integer Added to Array I
EasyArray
Watch Solutions82.9% acceptance
3132. Find the Integer Added to Array II
MediumArrayEnumerationSorting
Watch Solutions32.9% acceptance
3133. Minimum Array End
MediumBit Manipulation
Watch Solutions55.5% acceptance
3136. Valid Word
EasyString
Watch Solutions50.9% acceptance
3138. Minimum Length of Anagram Concatenation
MediumCountingHash TableString
Watch Solutions39.8% acceptance
3139. Minimum Cost to Equalize Array
HardArrayEnumerationGreedy
Watch Solutions18.8% acceptance
3140. Consecutive Available Seats II
MediumDatabase
Watch Solutions58.6% acceptance
3142. Check if Grid Satisfies Conditions
EasyArrayMatrix
Watch Solutions45.7% acceptance
3143. Maximum Points Inside the Square
MediumArrayBinary SearchHash Table
Watch Solutions39.9% acceptance
3144. Minimum Substring Partition of Equal Character Frequency
MediumCountingDynamic ProgrammingHash Table
Watch Solutions40.5% acceptance
3146. Permutation Difference between Two Strings
EasyHash TableString
Watch Solutions87.9% acceptance
3147. Taking Maximum Energy From the Mystic Dungeon
MediumArrayPrefix Sum
Watch Solutions61.0% acceptance
3149. Find the Minimum Cost Array Permutation
HardArrayBit ManipulationBitmask
Watch Solutions26.1% acceptance
3150. Invalid Tweets II
EasyDatabase
Watch Solutions87.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.