FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
42
With Videos
0
Easy
42
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1664. Ways to Make a Fair Array
MediumArrayPrefix Sum
Watch Solutions67.2% acceptance
1669. Merge In Between Linked Lists
MediumLinked List
Watch Solutions82.9% acceptance
1674. Minimum Moves to Make Array Complementary
MediumArrayHash TablePrefix Sum
Watch Solutions65.2% acceptance
1676. Lowest Common Ancestor of a Binary Tree IV
MediumBinary TreeDepth-First SearchHash Table
Watch Solutions79.6% acceptance
1679. Max Number of K-Sum Pairs
MediumArrayHash TableSorting
Watch Solutions56.9% acceptance
1680. Concatenation of Consecutive Binary Numbers
MediumBit ManipulationMathSimulation
Watch Solutions66.6% acceptance
1682. Longest Palindromic Subsequence II
MediumDynamic ProgrammingString
Watch Solutions50.1% acceptance
1685. Sum of Absolute Differences in a Sorted Array
MediumArrayMathPrefix Sum
Watch Solutions68.2% acceptance
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
MediumGreedyString
Watch Solutions90.5% acceptance
1695. Maximum Erasure Value
MediumArrayHash TableSliding Window
Watch Solutions64.2% acceptance
1696. Jump Game VI
MediumArrayDynamic ProgrammingHeap (Priority Queue)
Watch Solutions46.4% acceptance
1698. Number of Distinct Substrings in a String
MediumHash FunctionRolling HashString
Watch Solutions64.4% acceptance
1699. Number of Calls Between Two Persons
MediumDatabase
Watch Solutions81.1% acceptance
1701. Average Waiting Time
MediumArraySimulation
Watch Solutions73.1% acceptance
1702. Maximum Binary String After Change
MediumGreedyString
Watch Solutions48.1% acceptance
1706. Where Will the Ball Fall
MediumArrayMatrixSimulation
Watch Solutions71.9% acceptance
1709. Biggest Window Between Visits
MediumDatabase
Watch Solutions70.3% acceptance
1711. Count Good Meals
MediumArrayHash Table
Watch Solutions32.7% acceptance
1712. Ways to Split Array Into Three Subarrays
MediumArrayBinary SearchPrefix Sum
Watch Solutions34.2% acceptance
1715. Count Apples and Oranges
MediumDatabase
Watch Solutions75.6% acceptance
1717. Maximum Score From Removing Substrings
MediumGreedyStackString
Watch Solutions66.6% acceptance
1718. Construct the Lexicographically Largest Valid Sequence
MediumArrayBacktracking
Watch Solutions72.7% acceptance
1721. Swapping Nodes in a Linked List
MediumLinked ListTwo Pointers
Watch Solutions69.3% acceptance
1722. Minimize Hamming Distance After Swap Operations
MediumArrayDepth-First SearchUnion Find
Watch Solutions69.6% acceptance
1726. Tuple with Same Product
MediumArrayCountingHash Table
Watch Solutions70.1% acceptance
1727. Largest Submatrix With Rearrangements
MediumArrayGreedyMatrix
Watch Solutions80.3% acceptance
1730. Shortest Path to Get Food
MediumArrayBreadth-First SearchMatrix
Watch Solutions57.1% acceptance
1733. Minimum Number of People to Teach
MediumArrayGreedyHash Table
Watch Solutions67.7% acceptance
1734. Decode XORed Permutation
MediumArrayBit Manipulation
Watch Solutions67.0% acceptance
1738. Find Kth Largest XOR Coordinate Value
MediumArrayBit ManipulationDivide and Conquer
Watch Solutions64.3% acceptance
1740. Find Distance in a Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions74.3% acceptance
1743. Restore the Array From Adjacent Pairs
MediumArrayDepth-First SearchHash Table
Watch Solutions74.7% acceptance
1744. Can You Eat Your Favorite Candy on Your Favorite Day?
MediumArrayPrefix Sum
Watch Solutions36.1% acceptance
1746. Maximum Subarray Sum After One Operation
MediumArrayDynamic Programming
Watch Solutions65.2% acceptance
1747. Leetflex Banned Accounts
MediumDatabase
Watch Solutions62.9% acceptance
1749. Maximum Absolute Sum of Any Subarray
MediumArrayDynamic Programming
Watch Solutions71.1% acceptance
1750. Minimum Length of String After Deleting Similar Ends
MediumStringTwo Pointers
Watch Solutions55.9% acceptance
1753. Maximum Score From Removing Stones
MediumGreedyHeap (Priority Queue)Math
Watch Solutions68.6% acceptance
1754. Largest Merge Of Two Strings
MediumGreedyStringTwo Pointers
Watch Solutions54.2% acceptance
1756. Design Most Recently Used Queue
MediumArrayBinary Indexed TreeDesign
Watch Solutions78.0% acceptance
1759. Count Number of Homogenous Substrings
MediumMathString
Watch Solutions57.6% acceptance
1762. Buildings With an Ocean View
MediumArrayMonotonic StackStack
Watch Solutions80.9% 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.