Solutions & Explanations

Browse 4,029+ detailed solutions with multiple approaches, code in Python, Java, C++ and more.

4,029 Solutions961 Easy2102 Medium966 Hard

Title	Difficulty	Acceptance	Topics	Solution
707. Design Linked List	Medium	30.6%	Design Linked List	Read
708. Insert into a Sorted Circular Linked List	Medium	38.5%	Linked List	Read
712. Minimum ASCII Delete Sum for Two Strings	Medium	70.9%	Dynamic Programming String	Read
713. Subarray Product Less Than K	Medium	54.8%	Array Binary Search+2	Read
714. Best Time to Buy and Sell Stock with Transaction Fee	Medium	72.4%	Array Dynamic Programming+1	Read
718. Maximum Length of Repeated Subarray	Medium	51.5%	Array Binary Search+4	Read
720. Longest Word in Dictionary	Medium	55.2%	Array Hash Table+3	Read
721. Accounts Merge	Medium	61.6%	Array Breadth-First Search+5	Read
722. Remove Comments	Medium	40.1%	Array String	Read
723. Candy Crush	Medium	77.6%	Array Matrix+2	Read
725. Split Linked List in Parts	Medium	70.6%	Linked List	Read
729. My Calendar I	Medium	58.4%	Array Binary Search+3	Read
731. My Calendar II	Medium	63.3%	Array Binary Search+4	Read
735. Asteroid Collision	Medium	48.6%	Array Simulation+1	Read
737. Sentence Similarity II	Medium	51.2%	Array Breadth-First Search+4	Read
738. Monotone Increasing Digits	Medium	50.1%	Greedy Math	Read
739. Daily Temperatures	Medium	69.1%	Array Monotonic Stack+1	Read
740. Delete and Earn	Medium	57.1%	Array Dynamic Programming+1	Read
742. Closest Leaf in a Binary Tree	Medium	47.4%	Binary Tree Breadth-First Search+2	Read
743. Network Delay Time	Medium	61.1%	Breadth-First Search Depth-First Search+3	Read
750. Number Of Corner Rectangles	Medium	67.8%	Array Dynamic Programming+2	Read
751. IP to CIDR	Medium	53.7%	Bit Manipulation String	Read
752. Open the Lock	Medium	61.2%	Array Breadth-First Search+2	Read
754. Reach a Number	Medium	45.5%	Binary Search Math	Read
755. Pour Water	Medium	49.1%	Array Simulation	Read
756. Pyramid Transition Matrix	Medium	60.6%	Bit Manipulation Breadth-First Search+1	Read
758. Bold Words in String	Medium	53.2%	Array Hash Table+3	Read
763. Partition Labels	Medium	81.8%	Greedy Hash Table+2	Read
764. Largest Plus Sign	Medium	49.1%	Array Dynamic Programming	Read
767. Reorganize String	Medium	57.5%	Counting Greedy+4	Read
769. Max Chunks To Make Sorted	Medium	64.1%	Array Greedy+3	Read
775. Global and Local Inversions	Medium	42.9%	Array Math	Read
776. Split BST	Medium	82.5%	Binary Search Tree Binary Tree+2	Read
777. Swap Adjacent in LR String	Medium	37.9%	String Two Pointers	Read
779. K-th Symbol in Grammar	Medium	48.7%	Bit Manipulation Math+1	Read
781. Rabbits in Forest	Medium	58.0%	Array Greedy+2	Read
784. Letter Case Permutation	Medium	75.7%	Backtracking Bit Manipulation+1	Read
785. Is Graph Bipartite?	Medium	59.6%	Breadth-First Search Depth-First Search+2	Read
786. K-th Smallest Prime Fraction	Medium	69.0%	Array Binary Search+3	Read
787. Cheapest Flights Within K Stops	Medium	42.1%	Breadth-First Search Depth-First Search+4	Read
788. Rotated Digits	Medium	63.9%	Dynamic Programming Math	Read
789. Escape The Ghosts	Medium	64.2%	Array Math	Read
790. Domino and Tromino Tiling	Medium	51.4%	Dynamic Programming	Read
791. Custom Sort String	Medium	72.3%	Hash Table Sorting+1	Read
792. Number of Matching Subsequences	Medium	50.8%	Array Binary Search+5	Read
794. Valid Tic-Tac-Toe State	Medium	34.7%	Array Matrix	Read
795. Number of Subarrays with Bounded Maximum	Medium	55.4%	Array Two Pointers	Read
797. All Paths From Source to Target	Medium	83.6%	Backtracking Breadth-First Search+2	Read
799. Champagne Tower	Medium	64.1%	Dynamic Programming	Read
802. Find Eventual Safe States	Medium	71.6%	Breadth-First Search Depth-First Search+2	Read

#707Medium

Design Linked List

DesignLinked List

Acceptance: 30.6%

#708Medium

Insert into a Sorted Circular Linked List

Linked List

Acceptance: 38.5%

#712Medium

Minimum ASCII Delete Sum for Two Strings

Dynamic ProgrammingString

Acceptance: 70.9%

#713Medium

Subarray Product Less Than K

ArrayBinary SearchPrefix Sum+1

Acceptance: 54.8%

#714Medium

Best Time to Buy and Sell Stock with Transaction Fee

ArrayDynamic ProgrammingGreedy

Acceptance: 72.4%

#718Medium

Maximum Length of Repeated Subarray

ArrayBinary SearchDynamic Programming+3

Acceptance: 51.5%

#720Medium

Longest Word in Dictionary

ArrayHash TableSorting+2

Acceptance: 55.2%

#721Medium

Accounts Merge

ArrayBreadth-First SearchDepth-First Search+4

Acceptance: 61.6%

#722Medium

Remove Comments

ArrayString

Acceptance: 40.1%

#723Medium

Candy Crush

ArrayMatrixSimulation+1

Acceptance: 77.6%

#725Medium

Split Linked List in Parts

Linked List

Acceptance: 70.6%

#729Medium

My Calendar I

ArrayBinary SearchDesign+2

Acceptance: 58.4%

#731Medium

My Calendar II

ArrayBinary SearchDesign+3

Acceptance: 63.3%

#735Medium

Asteroid Collision

ArraySimulationStack

Acceptance: 48.6%

#737Medium

Sentence Similarity II

ArrayBreadth-First SearchDepth-First Search+3

Acceptance: 51.2%

#738Medium

Monotone Increasing Digits

GreedyMath

Acceptance: 50.1%

#739Medium

Daily Temperatures

ArrayMonotonic StackStack

Acceptance: 69.1%

#740Medium

Delete and Earn

ArrayDynamic ProgrammingHash Table

Acceptance: 57.1%

#742Medium

Closest Leaf in a Binary Tree

Binary TreeBreadth-First SearchDepth-First Search+1

Acceptance: 47.4%

#743Medium

Network Delay Time

Breadth-First SearchDepth-First SearchGraph+2

Acceptance: 61.1%

#750Medium

Number Of Corner Rectangles

ArrayDynamic ProgrammingMath+1

Acceptance: 67.8%

#751Medium

IP to CIDR

Bit ManipulationString

Acceptance: 53.7%

#752Medium

Open the Lock

ArrayBreadth-First SearchHash Table+1

Acceptance: 61.2%

#754Medium

Reach a Number

Binary SearchMath

Acceptance: 45.5%

#755Medium

Pour Water

ArraySimulation

Acceptance: 49.1%

#756Medium

Pyramid Transition Matrix

Bit ManipulationBreadth-First SearchDepth-First Search

Acceptance: 60.6%

#758Medium

Bold Words in String

ArrayHash TableString+2

Acceptance: 53.2%

#763Medium

Partition Labels

GreedyHash TableString+1

Acceptance: 81.8%

#764Medium

Largest Plus Sign

ArrayDynamic Programming

Acceptance: 49.1%

#767Medium

Reorganize String

CountingGreedyHash Table+3

Acceptance: 57.5%

#769Medium

Max Chunks To Make Sorted

ArrayGreedyMonotonic Stack+2

Acceptance: 64.1%

#775Medium

Global and Local Inversions

ArrayMath

Acceptance: 42.9%

#776Medium

Split BST

Binary Search TreeBinary TreeRecursion+1

Acceptance: 82.5%

#777Medium

Swap Adjacent in LR String

StringTwo Pointers

Acceptance: 37.9%

#779Medium

K-th Symbol in Grammar

Bit ManipulationMathRecursion

Acceptance: 48.7%

#781Medium

Rabbits in Forest

ArrayGreedyHash Table+1

Acceptance: 58.0%

#784Medium

Letter Case Permutation

BacktrackingBit ManipulationString

Acceptance: 75.7%

#785Medium

Is Graph Bipartite?

Breadth-First SearchDepth-First SearchGraph+1

Acceptance: 59.6%

#786Medium

K-th Smallest Prime Fraction

ArrayBinary SearchHeap (Priority Queue)+2

Acceptance: 69.0%

#787Medium

Cheapest Flights Within K Stops

Breadth-First SearchDepth-First SearchDynamic Programming+3

Acceptance: 42.1%

#788Medium

Rotated Digits

Dynamic ProgrammingMath

Acceptance: 63.9%

#789Medium

Escape The Ghosts

ArrayMath

Acceptance: 64.2%

#790Medium

Domino and Tromino Tiling

Dynamic Programming

Acceptance: 51.4%

#791Medium

Custom Sort String

Hash TableSortingString

Acceptance: 72.3%

#792Medium

Number of Matching Subsequences

ArrayBinary SearchDynamic Programming+4

Acceptance: 50.8%

#794Medium

Valid Tic-Tac-Toe State

ArrayMatrix

Acceptance: 34.7%

#795Medium

Number of Subarrays with Bounded Maximum

ArrayTwo Pointers

Acceptance: 55.4%

#797Medium

All Paths From Source to Target

BacktrackingBreadth-First SearchDepth-First Search+1

Acceptance: 83.6%

#799Medium

Champagne Tower

Dynamic Programming

Acceptance: 64.1%

#802Medium

Find Eventual Safe States

Breadth-First SearchDepth-First SearchGraph+1

Acceptance: 71.6%

1 2 38 9 1041 42 43

Page 9 of 43

Master DSA with Step-by-Step Solutions

Each solution article on FleetCode breaks down the problem into multiple approaches, from brute force to optimal, with detailed explanations and code in Python, Java, C++ and more. Understanding why an approach works - not just copying code - is what separates candidates who clear interviews from those who don't.

How to Use These Solutions

Try the problem first: Spend at least 20 minutes before reading the solution
Read all approaches: Start from brute force to understand the problem fully, then study the optimized solution
Understand the complexity: Pay attention to time and space analysis for each approach
Code it yourself: After understanding the approach, close the solution and implement from memory
Revisit after a week: Spaced repetition helps retain problem-solving patterns