FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
37
With Videos
0
Easy
37
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1764. Form Array by Concatenating Subarrays of Another Array
MediumArrayGreedyString Matching
Watch Solutions54.7% acceptance
1769. Minimum Number of Operations to Move All Balls to Each Box
MediumArrayPrefix SumString
Watch Solutions90.1% acceptance
1772. Sort Features by Popularity
MediumArrayHash TableSorting
Watch Solutions66.4% acceptance
1775. Equal Sum Arrays With Minimum Number of Operations
MediumArrayCountingGreedy
Watch Solutions54.6% acceptance
1778. Shortest Path in a Hidden Grid
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions44.5% acceptance
1780. Check if Number is a Sum of Powers of Three
MediumMath
Watch Solutions79.4% acceptance
1783. Grand Slam Titles
MediumDatabase
Watch Solutions83.2% acceptance
1785. Minimum Elements to Add to Form a Given Sum
MediumArrayGreedy
Watch Solutions45.0% acceptance
1792. Maximum Average Pass Ratio
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions74.1% acceptance
1797. Design Authentication Manager
MediumDesignDoubly-Linked ListHash Table
Watch Solutions58.5% acceptance
1802. Maximum Value at a Given Index in a Bounded Array
MediumBinary SearchGreedy
Watch Solutions39.0% acceptance
1804. Implement Trie II (Prefix Tree)
MediumDesignHash TableString
Watch Solutions63.6% acceptance
1806. Minimum Number of Operations to Reinitialize a Permutation
MediumArrayMathSimulation
Watch Solutions72.9% acceptance
1807. Evaluate the Bracket Pairs of a String
MediumArrayHash TableString
Watch Solutions69.4% acceptance
1810. Minimum Path Cost in a Hidden Grid
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions58.7% acceptance
1811. Find Interview Candidates
MediumDatabase
Watch Solutions60.8% acceptance
1813. Sentence Similarity III
MediumArrayStringTwo Pointers
Watch Solutions48.8% acceptance
1814. Count Nice Pairs in an Array
MediumArrayCountingHash Table
Watch Solutions48.6% acceptance
1820. Maximum Number of Accepted Invitations
MediumArrayDepth-First SearchGraph
Watch Solutions52.4% acceptance
1823. Find the Winner of the Circular Game
MediumArrayMathQueue
Watch Solutions81.9% acceptance
1824. Minimum Sideway Jumps
MediumArrayDynamic ProgrammingGreedy
Watch Solutions51.6% acceptance
1828. Queries on Number of Points Inside a Circle
MediumArrayGeometryMath
Watch Solutions86.9% acceptance
1829. Maximum XOR for Each Query
MediumArrayBit ManipulationPrefix Sum
Watch Solutions84.7% acceptance
1831. Maximum Transaction Each Day
MediumDatabase
Watch Solutions82.1% acceptance
1833. Maximum Ice Cream Bars
MediumArrayCounting SortGreedy
Watch Solutions77.2% acceptance
1836. Remove Duplicates From an Unsorted Linked List
MediumHash TableLinked List
Watch Solutions75.6% acceptance
1838. Frequency of the Most Frequent Element
MediumArrayBinary SearchGreedy
Watch Solutions44.7% acceptance
1841. League Statistics
MediumDatabase
Watch Solutions53.4% acceptance
1843. Suspicious Bank Accounts
MediumDatabase
Watch Solutions45.0% acceptance
1845. Seat Reservation Manager
MediumDesignHeap (Priority Queue)
Watch Solutions67.1% acceptance
1846. Maximum Element After Decreasing and Rearranging
MediumArrayGreedySorting
Watch Solutions69.2% acceptance
1849. Splitting a String Into Descending Consecutive Values
MediumBacktrackingString
Watch Solutions37.5% acceptance
1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number
MediumGreedyStringTwo Pointers
Watch Solutions72.0% acceptance
1852. Distinct Numbers in Each Subarray
MediumArrayHash TableSliding Window
Watch Solutions77.3% acceptance
1855. Maximum Distance Between a Pair of Values
MediumArrayBinary SearchTwo Pointers
Watch Solutions61.3% acceptance
1860. Incremental Memory Leak
MediumMathSimulation
Watch Solutions73.0% acceptance
1861. Rotating the Box
MediumArrayMatrixTwo Pointers
Watch Solutions82.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.