FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
36
With Videos
0
Easy
36
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2939. Maximum Xor Product
MediumBit ManipulationGreedyMath
Watch Solutions30.3% acceptance
2943. Maximize Area of Square Hole in Grid
MediumArraySorting
Watch Solutions61.9% acceptance
2950. Number of Divisible Substrings
MediumCountingHash TablePrefix Sum
Watch Solutions74.6% acceptance
2955. Number of Same-End Substrings
MediumArrayCountingHash Table
Watch Solutions61.6% acceptance
2957. Remove Adjacent Almost-Equal Characters
MediumDynamic ProgrammingGreedyString
Watch Solutions53.6% acceptance
2961. Double Modular Exponentiation
MediumArrayMathSimulation
Watch Solutions47.9% acceptance
2962. Count Subarrays Where Max Element Appears at Least K Times
MediumArraySliding Window
Watch Solutions62.4% acceptance
2964. Number of Divisible Triplet Sums
MediumArrayHash Table
Watch Solutions67.5% acceptance
2966. Divide Array Into Arrays With Max Difference
MediumArrayGreedySorting
Watch Solutions79.0% acceptance
2967. Minimum Cost to Make Array Equalindromic
MediumArrayBinary SearchGreedy
Watch Solutions23.4% acceptance
2971. Find Polygon With the Largest Perimeter
MediumArrayGreedyPrefix Sum
Watch Solutions65.7% acceptance
2975. Maximum Square Area by Removing Fences From a Field
MediumArrayEnumerationHash Table
Watch Solutions49.5% acceptance
2976. Minimum Cost to Convert String I
MediumArrayGraphShortest Path
Watch Solutions63.2% acceptance
2978. Symmetric Coordinates
MediumDatabase
Watch Solutions40.8% acceptance
2979. Most Expensive Item That Can Not Be Bought
MediumDynamic ProgrammingMathNumber Theory
Watch Solutions80.2% acceptance
2981. Find Longest Special Substring That Occurs Thrice I
MediumBinary SearchCountingHash Table
Watch Solutions61.9% acceptance
2982. Find Longest Special Substring That Occurs Thrice II
MediumBinary SearchCountingHash Table
Watch Solutions39.2% acceptance
2984. Find Peak Calling Hours for Each City
MediumDatabase
Watch Solutions61.1% acceptance
2986. Find Third Transaction
MediumDatabase
Watch Solutions53.0% acceptance
2988. Manager of the Largest Department
MediumDatabase
Watch Solutions79.4% acceptance
2989. Class Performance
MediumDatabase
Watch Solutions89.9% acceptance
2992. Number of Self-Divisible Permutations
MediumArrayBacktrackingBit Manipulation
Watch Solutions72.0% acceptance
2993. Friday Purchases I
MediumDatabase
Watch Solutions79.1% acceptance
3001. Minimum Moves to Capture The Queen
MediumArrayEnumeration
Watch Solutions22.3% acceptance
3011. Find if Array Can Be Sorted
MediumArrayBit ManipulationSorting
Watch Solutions66.4% acceptance
3012. Minimize Length of Array Using Operations
MediumArrayGreedyMath
Watch Solutions35.7% acceptance
3015. Count the Number of Houses at a Certain Distance I
MediumBreadth-First SearchGraphPrefix Sum
Watch Solutions58.2% acceptance
3020. Find the Maximum Number of Elements in Subset
MediumArrayEnumerationHash Table
Watch Solutions42.2% acceptance
3021. Alice and Bob Playing Flower Game
MediumMath
Watch Solutions60.2% acceptance
3023. Find Pattern in Infinite Stream I
MediumArrayHash FunctionRolling Hash
Watch Solutions57.5% acceptance
3025. Find the Number of Ways to Place People I
MediumArrayEnumerationGeometry
Watch Solutions64.0% acceptance
3026. Maximum Good Subarray Sum
MediumArrayHash TablePrefix Sum
Watch Solutions22.1% acceptance
3029. Minimum Time to Revert Word to Initial State I
MediumHash FunctionRolling HashString
Watch Solutions42.4% acceptance
3035. Maximum Palindromes After Operations
MediumArrayCountingGreedy
Watch Solutions47.2% acceptance
3039. Apply Operations to Make String Empty
MediumArrayCountingHash Table
Watch Solutions57.5% acceptance
3040. Maximum Number of Operations With the Same Score II
MediumArrayDynamic ProgrammingMemoization
Watch Solutions34.1% 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.