GitHub - angrybird2013/Leetcode: Problems-Solutions

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 174 Commits
3sum		3sum
3sum closest		3sum closest
4sum		4sum
add binary		add binary
add two numbers		add two numbers
anagrams		anagrams
balanced binary tree		balanced binary tree
best time to buy and sell stock		best time to buy and sell stock
best time to buy and sell stock II		best time to buy and sell stock II
best time to buy and sell stock III		best time to buy and sell stock III
binary tree inorder traversal		binary tree inorder traversal
binary tree level order traversal		binary tree level order traversal
binary tree level order traversal II		binary tree level order traversal II
binary tree maximum path sum		binary tree maximum path sum
binary tree postorder traversal		binary tree postorder traversal
binary tree preorder traversal		binary tree preorder traversal
binary tree zigzag level order traversal		binary tree zigzag level order traversal
candy		candy
climbing stairs		climbing stairs
clone graph		clone graph
combination sum		combination sum
combination sum II		combination sum II
combinations		combinations
construct binary tree from inorder and postorder traversal		construct binary tree from inorder and postorder traversal
construct binary tree from preorder and inorder traversal		construct binary tree from preorder and inorder traversal
container with most water		container with most water
convert sorted array to binary search tree		convert sorted array to binary search tree
convert sorted list to binary search tree		convert sorted list to binary search tree
copy list with random pointer		copy list with random pointer
count and say		count and say
decode ways		decode ways
distinct subsequences		distinct subsequences
divide two integers		divide two integers
edit distance		edit distance
evaluate reverse polish notation		evaluate reverse polish notation
find minimum in rotated Sorted Array		find minimum in rotated Sorted Array
find minimum in rotated sorted array II		find minimum in rotated sorted array II
first missing positive		first missing positive
flatten binary tree to linked list		flatten binary tree to linked list
gas station		gas station
generate parentheses		generate parentheses
gray code		gray code
insert interval		insert interval
insertion sort list		insertion sort list
integer to roman		integer to roman
interleaving string		interleaving string
jump game		jump game
jump game II		jump game II
largest rectangle in histogram		largest rectangle in histogram
length of last word		length of last word
letter combinations of a phone number		letter combinations of a phone number
linked list cycle		linked list cycle
linked list cycle II		linked list cycle II
longest common prefix		longest common prefix
longest consecutive sequence		longest consecutive sequence
longest palindromic substring		longest palindromic substring
longest substring without repeating characters		longest substring without repeating characters
longest valid parentheses		longest valid parentheses
lru cache		lru cache
max points on a line		max points on a line
maximal rectangle		maximal rectangle
maximum depth of binary tree		maximum depth of binary tree
maximum product subarray		maximum product subarray
maximum subarray		maximum subarray
median of two sorted arrays		median of two sorted arrays
merge intervals		merge intervals
merge k sorted lists		merge k sorted lists
merge two sorted array		merge two sorted array
merge two sorted lists		merge two sorted lists
min stack		min stack
minimum depth of binary tree		minimum depth of binary tree
minimum path sum		minimum path sum
minimum window substring		minimum window substring
multiply strings		multiply strings
n-queens		n-queens
n-queens II		n-queens II
next permutation		next permutation
palindrome number		palindrome number
palindrome partitioning		palindrome partitioning
palindrome partitioning II		palindrome partitioning II
partition list		partition list
pascal's triangle		pascal's triangle
pascal's triangle II		pascal's triangle II
path sum		path sum
path sum II		path sum II
permutation sequence		permutation sequence
permutations		permutations
permutations II		permutations II
plus one		plus one
populating next right pointers in each node		populating next right pointers in each node
populating next right pointers in each node II		populating next right pointers in each node II
pow(x, n)		pow(x, n)
recover binary search tree		recover binary search tree
regular expression matching		regular expression matching
remove duplicates from sorted array		remove duplicates from sorted array
remove duplicates from sorted array II		remove duplicates from sorted array II
remove duplicates from sorted list		remove duplicates from sorted list
remove duplicates from sorted list II		remove duplicates from sorted list II
remove element		remove element
remove nth node from end of list		remove nth node from end of list