FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
38
With Videos
14
Easy
17
Medium
7
Hard
1302. Deepest Leaves Sum
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions86.3% acceptance
1303. Find the Team Size
EasyDatabase
Watch Solutions89.6% acceptance
1304. Find N Unique Integers Sum up to Zero
EasyArrayMath
Watch Solutions78.5% 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
1307. Verbal Arithmetic Puzzle
HardArrayBacktrackingMath
Watch Solutions33.5% acceptance
1308. Running Total for Different Genders
MediumDatabase
Watch Solutions86.3% acceptance
1309. Decrypt String from Alphabet to Integer Mapping
EasyString
Watch Solutions80.6% acceptance
1310. XOR Queries of a Subarray
MediumArrayBit ManipulationPrefix Sum
Watch Solutions78.1% acceptance
1313. Decompress Run-Length Encoded List
EasyArray
Watch Solutions85.9% acceptance
1315. Sum of Nodes with Even-Valued Grandparent
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions85.6% acceptance
1317. Convert Integer to the Sum of Two No-Zero Integers
EasyMath
Watch Solutions59.1% 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
1320. Minimum Distance to Type a Word Using Two Fingers
HardDynamic ProgrammingString
Watch Solutions72.2% acceptance
1321. Restaurant Growth
MediumDatabase
Watch Solutions54.4% acceptance
1322. Ads Performance
EasyDatabase
Watch Solutions59.4% acceptance
1323. Maximum 69 Number
EasyGreedyMath
Watch Solutions84.5% acceptance
1325. Delete Leaves With a Given Value
MediumBinary TreeDepth-First SearchTree
Watch Solutions77.4% acceptance
1326. Minimum Number of Taps to Open to Water a Garden
HardArrayDynamic ProgrammingGreedy
Watch Solutions50.7% acceptance
1327. List the Products Ordered in a Period
EasyDatabase
Watch Solutions71.6% acceptance
1328. Break a Palindrome
MediumGreedyString
Watch Solutions51.6% acceptance
1329. Sort the Matrix Diagonally
MediumArrayMatrixSorting
Watch Solutions82.9% acceptance
1331. Rank Transform of an Array
EasyArrayHash TableSorting
Watch Solutions73.9% acceptance
1332. Remove Palindromic Subsequences
EasyStringTwo Pointers
Watch Solutions77.1% acceptance
1333. Filter Restaurants by Vegan-Friendly, Price and Distance
MediumArraySorting
Watch Solutions64.2% acceptance
1335. Minimum Difficulty of a Job Schedule
HardArrayDynamic Programming
Watch Solutions59.6% acceptance
1336. Number of Transactions per Visit
HardDatabase
Watch Solutions47.7% acceptance
1337. The K Weakest Rows in a Matrix
EasyArrayBinary SearchHeap (Priority Queue)
Watch Solutions74.3% acceptance
1339. Maximum Product of Splitted Binary Tree
MediumBinary TreeDepth-First SearchTree
Watch Solutions55.7% acceptance
1340. Jump Game V
HardArrayDynamic ProgrammingSorting
Watch Solutions75.7% acceptance
1341. Movie Rating
MediumDatabase
Watch Solutions40.8% acceptance
1342. Number of Steps to Reduce a Number to Zero
EasyBit ManipulationMath
Watch Solutions86.0% acceptance
1344. Angle Between Hands of a Clock
MediumMath
Watch Solutions69.6% acceptance
1345. Jump Game IV
HardArrayBreadth-First SearchHash Table
Watch Solutions50.9% acceptance
1346. Check If N and Its Double Exist
EasyArrayBinary SearchHash Table
Watch Solutions41.7% acceptance
1347. Minimum Number of Steps to Make Two Strings Anagram
MediumCountingHash TableString
Watch Solutions82.6% acceptance
1350. Students With Invalid Departments
EasyDatabase
Watch Solutions89.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.