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
701. Insert into a Binary Search Tree	Medium	73.6%	Binary Search Tree Binary Tree+1	Read
702. Search in a Sorted Array of Unknown Size	Medium	73.1%	Array Binary Search+1	Read
703. Kth Largest Element in a Stream	Easy	61.4%	Binary Search Tree Binary Tree+4	Read
704. Binary Search	Easy	61.2%	Array Binary Search	Read
705. Design HashSet	Easy	67.9%	Array Design+3	Read
706. Design HashMap	Easy	66.5%	Array Design+3	Read
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
709. To Lower Case	Easy	84.8%	String	Read
710. Random Pick with Blacklist	Hard	35.4%	Array Binary Search+4	Read
711. Number of Distinct Islands II	Hard	55.3%	Breadth-First Search Depth-First Search+3	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
715. Range Module	Hard	45.4%	Design Ordered Set+1	Read
716. Max Stack	Hard	45.9%	Design Doubly-Linked List+3	Read
717. 1-bit and 2-bit Characters	Easy	49.5%	Array	Read
718. Maximum Length of Repeated Subarray	Medium	51.5%	Array Binary Search+4	Read
719. Find K-th Smallest Pair Distance	Hard	46.4%	Array Binary Search+2	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
724. Find Pivot Index	Easy	63.6%	Array Prefix Sum	Read
725. Split Linked List in Parts	Medium	70.6%	Linked List	Read
726. Number of Atoms	Hard	65.1%	Hash Table Sorting+2	Read
727. Minimum Window Subsequence	Hard	43.5%	Dynamic Programming Sliding Window+1	Read
728. Self Dividing Numbers	Easy	81.3%	Math	Read
729. My Calendar I	Medium	58.4%	Array Binary Search+3	Read
730. Count Different Palindromic Subsequences	Hard	48.2%	Dynamic Programming String	Read
731. My Calendar II	Medium	63.3%	Array Binary Search+4	Read
732. My Calendar III	Hard	71.9%	Binary Search Design+3	Read
733. Flood Fill	Easy	68.6%	Array Breadth-First Search+2	Read
734. Sentence Similarity	Easy	44.5%	Array Hash Table+1	Read
735. Asteroid Collision	Medium	48.6%	Array Simulation+1	Read
736. Parse Lisp Expression	Hard	53.5%	Hash Table Recursion+2	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
741. Cherry Pickup	Hard	40.4%	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
744. Find Smallest Letter Greater Than Target	Easy	59.6%	Array Binary Search	Read
745. Prefix and Suffix Search	Hard	41.2%	Array Design+3	Read
746. Min Cost Climbing Stairs	Easy	68.7%	Array Dynamic Programming	Read
747. Largest Number At Least Twice of Others	Easy	52.8%	Array Sorting	Read
748. Shortest Completing Word	Easy	63.5%	Array Hash Table+1	Read
749. Contain Virus	Hard	55.9%	Array Breadth-First Search+3	Read
750. Number Of Corner Rectangles	Medium	67.8%	Array Dynamic Programming+2	Read

#701Medium

Insert into a Binary Search Tree

Binary Search TreeBinary TreeTree

Acceptance: 73.6%

#702Medium

Search in a Sorted Array of Unknown Size

ArrayBinary SearchInteractive

Acceptance: 73.1%

#703Easy

Kth Largest Element in a Stream

Binary Search TreeBinary TreeData Stream+3

Acceptance: 61.4%

#704Easy

Binary Search

ArrayBinary Search

Acceptance: 61.2%

#705Easy

Design HashSet

ArrayDesignHash Function+2

Acceptance: 67.9%

#706Easy

Design HashMap

ArrayDesignHash Function+2

Acceptance: 66.5%

#707Medium

Design Linked List

DesignLinked List

Acceptance: 30.6%

#708Medium

Insert into a Sorted Circular Linked List

Linked List

Acceptance: 38.5%

#709Easy

To Lower Case

String

Acceptance: 84.8%

#710Hard

Random Pick with Blacklist

ArrayBinary SearchHash Table+3

Acceptance: 35.4%

#711Hard

Number of Distinct Islands II

Breadth-First SearchDepth-First SearchHash Function+2

Acceptance: 55.3%

#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%

#715Hard

Range Module

DesignOrdered SetSegment Tree

Acceptance: 45.4%

#716Hard

Max Stack

DesignDoubly-Linked ListLinked List+2

Acceptance: 45.9%

#717Easy

1-bit and 2-bit Characters

Array

Acceptance: 49.5%

#718Medium

Maximum Length of Repeated Subarray

ArrayBinary SearchDynamic Programming+3

Acceptance: 51.5%

#719Hard

Find K-th Smallest Pair Distance

ArrayBinary SearchSorting+1

Acceptance: 46.4%

#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%

#724Easy

Find Pivot Index

ArrayPrefix Sum

Acceptance: 63.6%

#725Medium

Split Linked List in Parts

Linked List

Acceptance: 70.6%

#726Hard

Number of Atoms

Hash TableSortingStack+1

Acceptance: 65.1%

#727Hard

Minimum Window Subsequence

Dynamic ProgrammingSliding WindowString

Acceptance: 43.5%

#728Easy

Self Dividing Numbers

Math

Acceptance: 81.3%

#729Medium

My Calendar I

ArrayBinary SearchDesign+2

Acceptance: 58.4%

#730Hard

Count Different Palindromic Subsequences

Dynamic ProgrammingString

Acceptance: 48.2%

#731Medium

My Calendar II

ArrayBinary SearchDesign+3

Acceptance: 63.3%

#732Hard

My Calendar III

Binary SearchDesignOrdered Set+2

Acceptance: 71.9%

#733Easy

Flood Fill

ArrayBreadth-First SearchDepth-First Search+1

Acceptance: 68.6%

#734Easy

Sentence Similarity

ArrayHash TableString

Acceptance: 44.5%

#735Medium

Asteroid Collision

ArraySimulationStack

Acceptance: 48.6%

#736Hard

Parse Lisp Expression

Hash TableRecursionStack+1

Acceptance: 53.5%

#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%

#741Hard

Cherry Pickup

ArrayDynamic ProgrammingMatrix

Acceptance: 40.4%

#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%

#744Easy

Find Smallest Letter Greater Than Target

ArrayBinary Search

Acceptance: 59.6%

#745Hard

Prefix and Suffix Search

ArrayDesignHash Table+2

Acceptance: 41.2%

#746Easy

Min Cost Climbing Stairs

ArrayDynamic Programming

Acceptance: 68.7%

#747Easy

Largest Number At Least Twice of Others

ArraySorting

Acceptance: 52.8%

#748Easy

Shortest Completing Word

ArrayHash TableString

Acceptance: 63.5%

#749Hard

Contain Virus

ArrayBreadth-First SearchDepth-First Search+2

Acceptance: 55.9%

#750Medium

Number Of Corner Rectangles

ArrayDynamic ProgrammingMath+1

Acceptance: 67.8%

1 2 314 15 1679 80 81

Page 15 of 81

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