-
Notifications
You must be signed in to change notification settings - Fork 47
Pull requests: keep-practicing/leetcode-go
Author
Label
Projects
Milestones
Reviews
Assignee
Sort
Pull requests list
1021. Remove Outermost Parentheses
stack
LIFO, a stack is an abstract data type that serves as a collection of elements (push, pop)
string
A string is used to represent text. It is comprised of a set of characters.
#86
by zwfang
was merged May 5, 2020
Loading…
add brute force solution for 0001-two-sum
array
An array is stored such that the position of each element can be computed from its index
#85
by zwfang
was merged Oct 4, 2019
Loading…
another code for subarray product less than k sliding window solution
array
An array is stored such that the position of each element can be computed from its index
Medium
Coefficient of difficulty medium
sliding window
A sliding window is a sub-list that runs over an underlying collection.
148. Sort List
Linked List
A Linked list is a linear data structure where each element is a separate object.
Medium
Coefficient of difficulty medium
sort
Sorting algorithm is an algorithm that puts elements of a list in a certain order.
#79
by zwfang
was merged Mar 5, 2019
Loading…
304. Range Sum Query 2D - Immutable
dynamic programming
optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.
Medium
Coefficient of difficulty medium
#77
by zwfang
was merged Feb 27, 2019
Loading…
236. Lowest Common Ancestor of a Binary Tree
binary tree
a binary tree is a tree data structure in which each node has at most two children
Medium
Coefficient of difficulty medium
#76
by zwfang
was merged Feb 21, 2019
Loading…
677. Map Sum Pairs
Medium
Coefficient of difficulty medium
Trie
trie,又称前缀树或字典树,是一种有序树,用于保存关联数组,其中的键通常是字符串。
#75
by zwfang
was merged Feb 12, 2019
Loading…
136. Single Number🖖
array
An array is stored such that the position of each element can be computed from its index
bit manipulation
the act of algorithmically manipulating bits or other pieces of data shorter than a word
Easy
Coefficient of difficulty easy
Hash Table(Map)
a structure that can map keys to values.
#74
by zwfang
was merged Feb 1, 2019
Loading…
211. Add and Search Word - Data structure design💥.
Medium
Coefficient of difficulty medium
Trie
trie,又称前缀树或字典树,是一种有序树,用于保存关联数组,其中的键通常是字符串。
#73
by zwfang
was merged Feb 12, 2019
Loading…
208. Implement Trie (Prefix Tree) 💫
Medium
Coefficient of difficulty medium
Trie
trie,又称前缀树或字典树,是一种有序树,用于保存关联数组,其中的键通常是字符串。
#72
by zwfang
was merged Jan 31, 2019
Loading…
307 solved
Medium
Coefficient of difficulty medium
Segment Tree
storing information about intervals, or segments.
#71
by zwfang
was merged Jan 29, 2019
Loading…
recursive solution for 203
Recursion
solution depends on solutions to smaller instances of the same problem.
#69
by zwfang
was merged Jan 14, 2019
Loading…
179. Largest Number
array
An array is stored such that the position of each element can be computed from its index
Medium
Coefficient of difficulty medium
sort
Sorting algorithm is an algorithm that puts elements of a list in a certain order.
string
A string is used to represent text. It is comprised of a set of characters.
#68
by zwfang
was merged Jan 14, 2019
Loading…
735. Asteroid Collision
Medium
Coefficient of difficulty medium
stack
LIFO, a stack is an abstract data type that serves as a collection of elements (push, pop)
#67
by zwfang
was merged Jan 14, 2019
Loading…
155. Min Stack
Easy
Coefficient of difficulty easy
stack
LIFO, a stack is an abstract data type that serves as a collection of elements (push, pop)
#66
by zwfang
was merged Jan 10, 2019
Loading…
Previous Next
ProTip!
Follow long discussions with comments:>50.