FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
39
With Videos
0
Easy
39
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1262. Greatest Sum Divisible by Three
MediumArrayDynamic ProgrammingGreedy
Watch Solutions57.1% acceptance
1264. Page Recommendations
MediumDatabase
Watch Solutions65.3% acceptance
1265. Print Immutable Linked List in Reverse
MediumLinked ListRecursionStack
Watch Solutions94.0% acceptance
1267. Count Servers that Communicate
MediumArrayBreadth-First SearchCounting
Watch Solutions73.5% acceptance
1268. Search Suggestions System
MediumArrayBinary SearchHeap (Priority Queue)
Watch Solutions65.1% acceptance
1270. All People Report to the Given Manager
MediumDatabase
Watch Solutions84.5% acceptance
1272. Remove Interval
MediumArray
Watch Solutions67.2% acceptance
1273. Delete Tree Nodes
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions61.2% acceptance
1277. Count Square Submatrices with All Ones
MediumArrayDynamic ProgrammingMatrix
Watch Solutions80.7% acceptance
1282. Group the People Given the Group Size They Belong To
MediumArrayGreedyHash Table
Watch Solutions87.4% acceptance
1285. Find the Start and End Number of Continuous Ranges
MediumDatabase
Watch Solutions82.1% acceptance
1286. Iterator for Combination
MediumBacktrackingDesignIterator
Watch Solutions72.7% acceptance
1288. Remove Covered Intervals
MediumArraySorting
Watch Solutions60.1% acceptance
1291. Sequential Digits
MediumEnumeration
Watch Solutions68.6% acceptance
1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold
MediumArrayBinary SearchMatrix
Watch Solutions65.4% acceptance
1296. Divide Array in Sets of K Consecutive Numbers
MediumArrayGreedyHash Table
Watch Solutions59.2% acceptance
1300. Sum of Mutated Array Closest to Target
MediumArrayBinary SearchSorting
Watch Solutions46.2% acceptance
1302. Deepest Leaves Sum
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions86.3% acceptance
1305. All Elements in Two Binary Search Trees
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions79.9% acceptance
1306. Jump Game III
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions70.1% acceptance
1308. Running Total for Different Genders
MediumDatabase
Watch Solutions86.3% acceptance
1310. XOR Queries of a Subarray
MediumArrayBit ManipulationPrefix Sum
Watch Solutions78.1% acceptance
1315. Sum of Nodes with Even-Valued Grandparent
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions85.6% acceptance
1318. Minimum Flips to Make a OR b Equal to c
MediumBit Manipulation
Watch Solutions71.9% acceptance
1319. Number of Operations to Make Network Connected
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions67.0% acceptance
1321. Restaurant Growth
MediumDatabase
Watch Solutions54.4% acceptance
1325. Delete Leaves With a Given Value
MediumBinary TreeDepth-First SearchTree
Watch Solutions77.4% acceptance
1328. Break a Palindrome
MediumGreedyString
Watch Solutions51.6% acceptance
1329. Sort the Matrix Diagonally
MediumArrayMatrixSorting
Watch Solutions82.9% acceptance
1333. Filter Restaurants by Vegan-Friendly, Price and Distance
MediumArraySorting
Watch Solutions64.2% acceptance
1339. Maximum Product of Splitted Binary Tree
MediumBinary TreeDepth-First SearchTree
Watch Solutions55.7% acceptance
1341. Movie Rating
MediumDatabase
Watch Solutions40.8% acceptance
1344. Angle Between Hands of a Clock
MediumMath
Watch Solutions69.6% acceptance
1347. Minimum Number of Steps to Make Two Strings Anagram
MediumCountingHash TableString
Watch Solutions82.6% acceptance
1352. Product of the Last K Numbers
MediumArrayData StreamDesign
Watch Solutions62.9% acceptance
1353. Maximum Number of Events That Can Be Attended
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions38.9% acceptance
1355. Activity Participants
MediumDatabase
Watch Solutions72.3% acceptance
1358. Number of Substrings Containing All Three Characters
MediumHash TableSliding WindowString
Watch Solutions74.4% acceptance
1361. Validate Binary Tree Nodes
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions43.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.