Skip to content

Noba1anc3/Leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

787 Commits
Queue
Queue
 
 
Stack
Stack
 
 
.gitignore
.gitignore
 
 
001 Two Sum.md
001 Two Sum.md
 
 
002 Add Two Numbers.md
002 Add Two Numbers.md
 
 
003 Longest Substring.md
003 Longest Substring.md
 
 
004 Median of Two Sorted Arrays.md
004 Median of Two Sorted Arrays.md
 
 
005 Longest Palindromic Substring.md
005 Longest Palindromic Substring.md
 
 
014 Longest Common Prefix.md
014 Longest Common Prefix.md
 
 
015 ThreeSum.md
015 ThreeSum.md
 
 
017 Letter Combination of a Phone Number.md
017 Letter Combination of a Phone Number.md
 
 
020 Valid Parentheses.md
020 Valid Parentheses.md
 
 
021 Merge Two Sorted Lists.md
021 Merge Two Sorted Lists.md
 
 
022 Generate Parenthesis.md
022 Generate Parenthesis.md
 
 
023 Merge K Sorted Lists.md
023 Merge K Sorted Lists.md
 
 
032 Longest Valid Parentheses.md
032 Longest Valid Parentheses.md
 
 
037 Sudoku Solver.md
037 Sudoku Solver.md
 
 
039 Combination Sum.md
039 Combination Sum.md
 
 
040 Combination Sum II.md
040 Combination Sum II.md
 
 
045 Jump Game II.md
045 Jump Game II.md
 
 
046 Permutations.md
046 Permutations.md
 
 
047 Permutation II.md
047 Permutation II.md
 
 
051 N-Queens.md
051 N-Queens.md
 
 
053 Maximum Contiguous Subarray.md
053 Maximum Contiguous Subarray.md
 
 
055 Jump Game.md
055 Jump Game.md
 
 
056 Merge Intervals.md
056 Merge Intervals.md
 
 
057 Insert Interval.md
057 Insert Interval.md
 
 
060 Permutation Sequence.md
060 Permutation Sequence.md
 
 
070 Climbing Stairs.md
070 Climbing Stairs.md
 
 
072 Edit Distance.md
072 Edit Distance.md
 
 
075 Sort Colors.md
075 Sort Colors.md
 
 
077 Combinations.md
077 Combinations.md
 
 
078 Subsets.md
078 Subsets.md
 
 
090 Subsets II.md
090 Subsets II.md
 
 
092 Reverse Linked List II.md
092 Reverse Linked List II.md
 
 
093 Restore IP Addresses.md
093 Restore IP Addresses.md
 
 
094 Binary Tree Inorder Traversal.md
094 Binary Tree Inorder Traversal.md
 
 
100 Same Tree.md
100 Same Tree.md
 
 
1004 Max Consecutive Ones III.md
1004 Max Consecutive Ones III.md
 
 
105 Construct Binary Tree from Preorder and Inorder.md
105 Construct Binary Tree from Preorder and Inorder.md
 
 
1094 Car Pooling.md
1094 Car Pooling.md
 
 
1099. Two Sum Less Than K.md
1099. Two Sum Less Than K.md
 
 
110 Balanced Binary Tree.md
110 Balanced Binary Tree.md
 
 
1143 Longest Common Subsequence.md
1143 Longest Common Subsequence.md
 
 
1167 Minimum Cost to Connect Sticks.md
1167 Minimum Cost to Connect Sticks.md
 
 
121 Best Time to Buy and Sell Stock.md
121 Best Time to Buy and Sell Stock.md
 
 
122 Best Time to Buy and Sell Stock II.md
122 Best Time to Buy and Sell Stock II.md
 
 
1227 Airplane Seat Assignment Probability.md
1227 Airplane Seat Assignment Probability.md
 
 
125 Valid Palindrome.md
125 Valid Palindrome.md
 
 
128 Longest Consecutive Sequence.md
128 Longest Consecutive Sequence.md
 
 
130 Surrounded Regions.md
130 Surrounded Regions.md
 
 
135 Candy.md
135 Candy.md
 
 
136 Single Number.md
136 Single Number.md
 
 
1403 Minimum Subsequence in Non-Increasing Order.md
1403 Minimum Subsequence in Non-Increasing Order.md
 
 
144 Binary Tree Preorder Traversal.md
144 Binary Tree Preorder Traversal.md
 
 
145 Binary Tree Postorder Traversal.md
145 Binary Tree Postorder Traversal.md
 
 
146 LRU Cache.md
146 LRU Cache.md
 
 
148 Sort List.md
148 Sort List.md
 
 
150 Evaluate Reverse Polish Notation.md
150 Evaluate Reverse Polish Notation.md
 
 
153 Find Minimum in Rotated Sorted Array.md
153 Find Minimum in Rotated Sorted Array.md
 
 
154 Find Minimum in Rotated Sorted Array II.md
154 Find Minimum in Rotated Sorted Array II.md
 
 
155 Min Stack.md
155 Min Stack.md
 
 
200 Number of Islands.md
200 Number of Islands.md
 
 
207 Course Schedule.md
207 Course Schedule.md
 
 
210 Course Schedule II.md
210 Course Schedule II.md
 
 
215 Kth Largest Element in an Array.md
215 Kth Largest Element in an Array.md
 
 
236 Lowest Common Ancestor of a Binary Tree.md
236 Lowest Common Ancestor of a Binary Tree.md
 
 
242 Valid Anagram.md
242 Valid Anagram.md
 
 
252 Meeting Rooms.md
252 Meeting Rooms.md
 
 
253 Meeting Rooms II.md
253 Meeting Rooms II.md
 
 
261 Graph Valid Tree.md
261 Graph Valid Tree.md
 
 
279 Perfect Squares.md
279 Perfect Squares.md
 
 
292 Nim Game.md
292 Nim Game.md
 
 
300 Longest Increasing Subsequence.md
300 Longest Increasing Subsequence.md
 
 
322 Coin Change.md
322 Coin Change.md
 
 
323 Number of Connected Components in an Undirected Graph.md
323 Number of Connected Components in an Undirected Graph.md
 
 
329 Longest Increasing Path in a Metrix.md
329 Longest Increasing Path in a Metrix.md
 
 
334 Increasing Triplet Subsequence.md
334 Increasing Triplet Subsequence.md
 
 
349 Intersection of Two Arrays.md
349 Intersection of Two Arrays.md
 
 
350 Intersection of Two Arrays II.md
350 Intersection of Two Arrays II.md
 
 
392 Is Subsequence.md
392 Is Subsequence.md
 
 
416 Partition Equal Subset Sum.md
416 Partition Equal Subset Sum.md
 
 
435 Non-overlapping Intervals.md
435 Non-overlapping Intervals.md
 
 
452 Minimum Number of Arrays to Burst Balloons.md
452 Minimum Number of Arrays to Burst Balloons.md
 
 
463 Island Perimeter.md
463 Island Perimeter.md
 
 
474 Ones and Zeroes.md
474 Ones and Zeroes.md
 
 
494 Target Sum.md
494 Target Sum.md
 
 
518 Coin Change 2.md
518 Coin Change 2.md
 
 
537 Complex Number Multiplication.md
537 Complex Number Multiplication.md
 
 
547 Number of Provinces.md
547 Number of Provinces.md
 
 
572 Subtree of Another Tree.md
572 Subtree of Another Tree.md
 
 
622 Design Circular Queue.md
622 Design Circular Queue.md
 
 
662 Maximum Width of Binary Tree.md
662 Maximum Width of Binary Tree.md
 
 
684 Redundant Connection.md
684 Redundant Connection.md
 
 
695 Max Area Of Islands.md
695 Max Area Of Islands.md
 
 
706 Design HashMap.md
706 Design HashMap.md
 
 
721 Accounts Merge.md
721 Accounts Merge.md
 
 
739 Daily Temperatures.md
739 Daily Temperatures.md
 
 
743 Network Delay Time.md
743 Network Delay Time.md
 
 
752 Open the Lock.md
752 Open the Lock.md
 
 

Repository files navigation

Data Structure

Queue

Stack

Heap

Map

Set

Union-Find Set

Linked-List

Tree

Graph

Algorithm

BFS

DFS

Slide Window

Split-Search

Double Pointer

Sort

Backtracking

Recursive

It has been concealed due to the recursive category is inessential.
If u want to check out the questions belong to this category, please check the raw data of this markdown file.

Divide & Conquer

Greedy

Dynamic Programming

Mathematics

Questions

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

2 stars

Watchers

2 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published