-
Notifications
You must be signed in to change notification settings - Fork 35
No labels!
There aren鈥檛 any labels for this repository quite yet.
33 labels
array
array
An array is stored such that the position of each element can be computed from its index
Backtracking
Backtracking
incrementally builds candidates to the solutions, and abandons a candidate(invalid solution.)
BFS
BFS
breadth-first search is an algorithm for traversing or searching tree or graph data structure.
binary search
binary search
a search algorithm that finds the position of target value within a sorted array.
binary tree
binary tree
a binary tree is a tree data structure in which each node has at most two children
bit manipulation
bit manipulation
the act of algorithmically manipulating bits or other pieces of data shorter than a word
DFS
DFS
Depth-first search is an algorithm for traversing or searching tree or graph data structure.
Divide and Conquer
Divide and Conquer
recursively breaking down a problem into two or more sub-problem of the same or related type.
dynamic programming
dynamic programming
optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.
Greedy algorithm
Greedy algorithm
making the locally optimal choice at each stage with the intent of finding the global optimum.
heap(priority queue)
heap(priority queue)
a heap is a specialized tree-based data structure which is essentially an almost complete tree
Linked List
Linked List
A Linked list is a linear data structure where each element is a separate object.
sliding window
sliding window
A sliding window is a sub-list that runs over an underlying collection.
stack
stack
LIFO, a stack is an abstract data type that serves as a collection of elements (push, pop)