FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
37
With Videos
0
Easy
0
Medium
37
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2968. Apply Operations to Maximize Frequency Score
HardArrayBinary SearchPrefix Sum
Watch Solutions39.3% acceptance
2969. Minimum Number of Coins for Fruits II
HardArrayDynamic ProgrammingHeap (Priority Queue)
Watch Solutions48.2% acceptance
2973. Find Number of Coins to Place in Tree Nodes
HardDepth-First SearchDynamic ProgrammingHeap (Priority Queue)
Watch Solutions37.4% acceptance
2983. Palindrome Rearrangement Queries
HardHash TablePrefix SumString
Watch Solutions25.1% acceptance
2991. Top Three Wineries
HardDatabase
Watch Solutions55.8% acceptance
2994. Friday Purchases II
HardDatabase
Watch Solutions74.6% acceptance
2995. Viewers Turned Streamers
HardDatabase
Watch Solutions43.4% acceptance
2999. Count the Number of Powerful Integers
HardDynamic ProgrammingMathString
Watch Solutions46.3% acceptance
3003. Maximize the Number of Partitions After Operations
HardBit ManipulationBitmaskDynamic Programming
Watch Solutions53.5% acceptance
3008. Find Beautiful Indices in the Given Array II
HardBinary SearchHash FunctionRolling Hash
Watch Solutions28.3% acceptance
3009. Maximum Number of Intersections on the Chart
HardArrayBinary Indexed TreeGeometry
Watch Solutions45.5% acceptance
3013. Divide an Array Into Subarrays With Minimum Cost II
HardArrayHash TableHeap (Priority Queue)
Watch Solutions54.7% acceptance
3017. Count the Number of Houses at a Certain Distance II
HardGraphPrefix Sum
Watch Solutions23.7% acceptance
3018. Maximum Number of Removal Queries That Can Be Processed I
HardArrayDynamic Programming
Watch Solutions44.8% acceptance
3027. Find the Number of Ways to Place People II
HardArrayEnumerationGeometry
Watch Solutions64.4% acceptance
3036. Number of Subarrays That Match a Pattern II
HardArrayHash FunctionRolling Hash
Watch Solutions34.1% acceptance
3037. Find Pattern in Infinite Stream II
HardArrayHash FunctionRolling Hash
Watch Solutions67.5% acceptance
3045. Count Prefix and Suffix Pairs II
HardArrayHash FunctionRolling Hash
Watch Solutions28.2% acceptance
3049. Earliest Second to Mark Indices II
HardArrayBinary SearchGreedy
Watch Solutions22.6% acceptance
3052. Maximize Items
HardDatabase
Watch Solutions72.0% acceptance
3057. Employees Project Allocation
HardDatabase
Watch Solutions68.4% acceptance
3060. User Activities within Time Bounds
HardDatabase
Watch Solutions40.6% acceptance
3061. Calculate Trapping Rain Water
HardDatabase
Watch Solutions81.1% acceptance
3068. Find the Maximum Sum of Node Values
HardArrayBit ManipulationDynamic Programming
Watch Solutions69.5% acceptance
3077. Maximum Strength of K Disjoint Subarrays
HardArrayDynamic ProgrammingPrefix Sum
Watch Solutions28.2% acceptance
3086. Minimum Moves to Pick K Ones
HardArrayGreedyPrefix Sum
Watch Solutions21.6% acceptance
3088. Make String Anti-palindrome
HardCounting SortGreedySorting
Watch Solutions46.6% acceptance
3093. Longest Common Suffix Queries
HardArrayStringTrie
Watch Solutions52.8% acceptance
3098. Find the Sum of Subsequence Powers
HardArrayDynamic ProgrammingSorting
Watch Solutions25.1% 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
3108. Minimum Cost Walk in Weighted Graph
HardArrayBit ManipulationGraph
Watch Solutions68.3% acceptance
3117. Minimum Sum of Values by Dividing Array
HardArrayBinary SearchBit Manipulation
Watch Solutions27.9% acceptance
3123. Find Edges in Shortest Paths
HardBreadth-First SearchDepth-First SearchGraph
Watch Solutions47.0% acceptance
3130. Find All Possible Stable Binary Arrays II
HardDynamic ProgrammingPrefix Sum
Watch Solutions59.0% acceptance
3139. Minimum Cost to Equalize Array
HardArrayEnumerationGreedy
Watch Solutions18.8% 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.