brianchiang-tw/leetcodePublic

NotificationsYou must be signed in to change notification settings
Fork13
Star50

A set of practice note, solution, complexity analysis and test bench to leetcode problem set

License

MIT license

50 stars 13 forks Branches Tags Activity

Star

Notifications

You must be signed in to change notification settings

Branches Tags

Folders and files

Name		Name	Last commit message	Last commit date
Latest commit History 1,262 Commits
.vscode		.vscode
2020_April_Leetcode_30_days_challenge		2020_April_Leetcode_30_days_challenge
2020_August_Leetcode_30_days_challenge		2020_August_Leetcode_30_days_challenge
2020_July_Leetcode_30_days_challenge		2020_July_Leetcode_30_days_challenge
2020_June_Leetcode_30_days_challenge		2020_June_Leetcode_30_days_challenge
2020_May_Leetcode_30_days_challenge		2020_May_Leetcode_30_days_challenge
2020_November_Leetcode_30_days_challenge		2020_November_Leetcode_30_days_challenge
2020_October_Leetcode_30_days_challenge		2020_October_Leetcode_30_days_challenge
2020_September_Leetcode_30_days_challenge		2020_September_Leetcode_30_days_challenge
2021_Feburary_Leetcode_30_days_challenge		2021_Feburary_Leetcode_30_days_challenge
Array		Array
Binary Tree		Binary Tree
Dynamic_Programming_I		Dynamic_Programming_I
Linked List		Linked List
No_0001_Two Sum		No_0001_Two Sum
No_0002_Add Two Numbers		No_0002_Add Two Numbers
No_0003_Longest Substring Without Repeating Characters		No_0003_Longest Substring Without Repeating Characters
No_0007_Reverse Integer		No_0007_Reverse Integer
No_0008_String to Integer_aka_atoi		No_0008_String to Integer_aka_atoi
No_0009_Palindrome Number		No_0009_Palindrome Number
No_0011_Contain With Most Water		No_0011_Contain With Most Water
No_0012_Integer to Roman		No_0012_Integer to Roman
No_0013_Roman to Integer		No_0013_Roman to Integer
No_0014_Longest Common Prefix		No_0014_Longest Common Prefix
No_0015_3 Sum		No_0015_3 Sum
No_0016_3 Sum Closet		No_0016_3 Sum Closet
No_0017_Letter Combinations of a Phone Number		No_0017_Letter Combinations of a Phone Number
No_0018_4 Sum aka four Sum		No_0018_4 Sum aka four Sum
No_0019_Remove Nth Node From End of List		No_0019_Remove Nth Node From End of List
No_0020_Valid Parentheses		No_0020_Valid Parentheses
No_0021_Merge 2 Sorted Lists		No_0021_Merge 2 Sorted Lists
No_0023_Merge k Sorted Lists		No_0023_Merge k Sorted Lists
No_0024_Swap Nodes in Pairs		No_0024_Swap Nodes in Pairs
No_0026_Remove Duplicates from Sorted Array		No_0026_Remove Duplicates from Sorted Array
No_0027_Remove Element		No_0027_Remove Element
No_0028_Implement strStr		No_0028_Implement strStr
No_0029_Divide Two Integers		No_0029_Divide Two Integers
No_0032_Longest Valid Parentheses		No_0032_Longest Valid Parentheses
No_0033_Search in Rotated Sorted Array		No_0033_Search in Rotated Sorted Array
No_0034_Find First and Last Position of Element in Sorted Array		No_0034_Find First and Last Position of Element in Sorted Array
No_0035_Search Insert Position		No_0035_Search Insert Position
No_0038_Count and Say		No_0038_Count and Say
No_0039_Combination Sum		No_0039_Combination Sum
No_0040_Combination Sum II		No_0040_Combination Sum II
No_0041_First Missing Positive		No_0041_First Missing Positive
No_0044_Wildcard Matching		No_0044_Wildcard Matching
No_0045_Jump Game II		No_0045_Jump Game II
No_0046_Permutations		No_0046_Permutations
No_0047_Permutations II		No_0047_Permutations II
No_0048_Rotate Image		No_0048_Rotate Image
No_0049_Group Anagrams		No_0049_Group Anagrams
No_0050_Pow( x , n )		No_0050_Pow( x , n )
No_0053_Maximum Subarray		No_0053_Maximum Subarray
No_0055_Jump_Game		No_0055_Jump_Game
No_0056_Merge Intervals		No_0056_Merge Intervals
No_0058_Length of Last Word		No_0058_Length of Last Word
No_0061_Rotate List		No_0061_Rotate List
No_0062_Unique Path		No_0062_Unique Path
No_0063_Unique Paths II		No_0063_Unique Paths II
No_0064_Minimum Path Sum		No_0064_Minimum Path Sum
No_0065_Valid Number		No_0065_Valid Number
No_0066_Plus One		No_0066_Plus One
No_0067_Add Binary		No_0067_Add Binary
No_0069_Sqrt_x		No_0069_Sqrt_x
No_0070_Climbing Stairs		No_0070_Climbing Stairs
No_0071_Simplify Path		No_0071_Simplify Path
No_0073_Set Matrix Zeroes		No_0073_Set Matrix Zeroes
No_0074_Search a 2D Matrix		No_0074_Search a 2D Matrix
No_0078_Subsets		No_0078_Subsets
No_0080_Remove Duplicates from Sorted Array II		No_0080_Remove Duplicates from Sorted Array II
No_0082_Remove Duplicates from Sorted List II		No_0082_Remove Duplicates from Sorted List II
No_0083_Remove Duplicates from Sorted List		No_0083_Remove Duplicates from Sorted List
No_0086_Partition List		No_0086_Partition List
No_0088_Merge Sorted Array		No_0088_Merge Sorted Array
No_0089_Gray Code		No_0089_Gray Code
No_0090_Subsets II		No_0090_Subsets II
No_0092_Reverse Linked List II		No_0092_Reverse Linked List II
No_0094_Binary Tree Inorder Traversal		No_0094_Binary Tree Inorder Traversal
No_0095_Unique Binary Search Trees II		No_0095_Unique Binary Search Trees II
No_0096_Unique Binary Search Trees		No_0096_Unique Binary Search Trees
No_0098_Validate Binary Search Tree		No_0098_Validate Binary Search Tree
No_0100_Same Tree		No_0100_Same Tree
No_0101_Symmetric Tree		No_0101_Symmetric Tree
No_0102_Binary Tree Level Order Traversal		No_0102_Binary Tree Level Order Traversal
No_0104_Maximum Depth of Binary Tree		No_0104_Maximum Depth of Binary Tree
No_0105_Construct Binary Tree from Preorder and Inorder Traversal		No_0105_Construct Binary Tree from Preorder and Inorder Traversal
No_0106_Construct Binary Tree from Inorder and Postorder Traversal		No_0106_Construct Binary Tree from Inorder and Postorder Traversal
No_0107_Binary Tree Level Order Traversal II		No_0107_Binary Tree Level Order Traversal II
No_0108_Convert Sorted Array to Binary Search Tree		No_0108_Convert Sorted Array to Binary Search Tree
No_0109_Convert Sorted List to Binary Search Tree		No_0109_Convert Sorted List to Binary Search Tree
No_0110_Balanced Binary Tree		No_0110_Balanced Binary Tree
No_0111_Minimum Depth of Binary Tree		No_0111_Minimum Depth of Binary Tree
No_0112_Path Sum		No_0112_Path Sum
No_0113_Path Sum II		No_0113_Path Sum II
No_0114_Flatten Binary Tree to Linked List		No_0114_Flatten Binary Tree to Linked List
No_0116_Populating Next Right Pointers in Each Node		No_0116_Populating Next Right Pointers in Each Node
No_0117_Populating Next Right Pointers in Each Node II		No_0117_Populating Next Right Pointers in Each Node II
No_0118_Pascal's Triangle		No_0118_Pascal's Triangle
No_0119_Pascal's Triangle II		No_0119_Pascal's Triangle II
No_0120_Triangle		No_0120_Triangle

Repository files navigation

leetcode

A set of practice note and source code of solution to leetcode problem set

Leetcode official website:

https://leetcode.com/problems

Python 3 official reference document:

https://docs.python.org/3/

About

A set of practice note, solution, complexity analysis and test bench to leetcode problem set

leetcode.com/brianchiang_tw/

Releases

No releases published

Packages

No packages published

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

License

Uh oh!

Folders and files

Latest commit

History

Repository files navigation

leetcode

Leetcode official website:

Python 3 official reference document:

About

Topics

Resources

License

Uh oh!

Stars

Watchers

Forks

Releases

Packages

Uh oh!

Languages

Movatterモバイル変換

License

brianchiang-tw/leetcode

Folders and files

Latest commit

History

Repository files navigation

leetcode

Leetcode official website:

Python 3 official reference document:

About

Topics

Resources

License

Uh oh!

Stars

Watchers

Forks

Releases

Packages0

Uh oh!

Languages

Packages