FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
29
With Videos
0
Easy
0
Medium
29
Hard
Filter by Difficulty
Browse video solutions by difficulty level
3149. Find the Minimum Cost Array Permutation
HardArrayBit ManipulationBitmask
Watch Solutions26.1% acceptance
3156. Employee Task Duration and Concurrent Tasks
HardDatabase
Watch Solutions54.0% acceptance
3161. Block Placement Queries
HardArrayBinary Indexed TreeBinary Search
Watch Solutions41.6% acceptance
3165. Maximum Sum of Subsequence With Non-adjacent Elements
HardArrayDivide and ConquerDynamic Programming
Watch Solutions15.7% acceptance
3177. Find the Maximum Length of a Good Subsequence II
HardArrayDynamic ProgrammingHash Table
Watch Solutions25.2% acceptance
3181. Maximum Total Reward Using Operations II
HardArrayBit ManipulationDynamic Programming
Watch Solutions21.9% acceptance
3187. Peaks in Array
HardArrayBinary Indexed TreeSegment Tree
Watch Solutions27.9% acceptance
3188. Find Top Scoring Students II
HardDatabase
Watch Solutions37.8% acceptance
3193. Count the Number of Inversions
HardArrayDynamic Programming
Watch Solutions31.9% acceptance
3197. Find the Minimum Area to Cover All Ones II
HardArrayEnumerationMatrix
Watch Solutions63.5% acceptance
3203. Find Minimum Diameter After Merging Two Trees
HardBreadth-First SearchDepth-First SearchGraph
Watch Solutions57.1% acceptance
3209. Number of Subarrays With AND Value of K
HardArrayBinary SearchBit Manipulation
Watch Solutions35.7% acceptance
3213. Construct String with Minimum Cost
HardArrayDynamic ProgrammingString
Watch Solutions19.0% acceptance
3214. Year on Year Growth Rate
HardDatabase
Watch Solutions51.7% acceptance
3229. Minimum Operations to Make Array Equal to Target
HardArrayDynamic ProgrammingGreedy
Watch Solutions41.4% acceptance
3236. CEO Subordinate Hierarchy
HardDatabase
Watch Solutions72.3% acceptance
3244. Shortest Distance After Road Addition Queries II
HardArrayGraphGreedy
Watch Solutions26.5% acceptance
3250. Find the Count of Monotonic Pairs I
HardArrayCombinatoricsDynamic Programming
Watch Solutions47.6% acceptance
3260. Find the Largest Palindrome Divisible by K
HardDynamic ProgrammingGreedyMath
Watch Solutions17.0% acceptance
3261. Count Substrings That Satisfy K-Constraint II
HardArrayBinary SearchPrefix Sum
Watch Solutions23.5% acceptance
3266. Final Array State After K Multiplication Operations II
HardArrayHeap (Priority Queue)Simulation
Watch Solutions13.7% acceptance
3267. Count Almost Equal Pairs II
HardArrayCountingEnumeration
Watch Solutions27.7% acceptance
3268. Find Overlapping Shifts II
HardDatabase
Watch Solutions70.0% acceptance
3272. Find the Count of Good Integers
HardCombinatoricsEnumerationHash Table
Watch Solutions69.5% acceptance
3276. Select Cells in Grid With Maximum Score
HardArrayBit ManipulationBitmask
Watch Solutions15.7% acceptance
3287. Find the Maximum Sequence Value of Array
HardArrayBit ManipulationDynamic Programming
Watch Solutions21.9% acceptance
3303. Find the Occurrence of First Almost Equal Substring
HardStringString Matching
Watch Solutions16.0% acceptance
3307. Find the K-th Character in String Game II
HardBit ManipulationMathRecursion
Watch Solutions48.5% acceptance
3312. Sorted GCD Pair Queries
HardArrayBinary SearchCombinatorics
Watch Solutions58.4% 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.