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

• bug

  bug

  Something isn't working

• 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.

• double index(two pointers)

  double index(two pointers)

  The Two Pointer Algorithm

• duplicate

  duplicate

  This issue or pull request already exists

• dynamic programming

  dynamic programming

  optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.

• Easy

  Easy

  Coefficient of difficulty easy

• enhancement

  enhancement

  New feature or request

• good first issue

  good first issue

  Good for newcomers

• Greedy algorithm

  Greedy algorithm

  making the locally optimal choice at each stage with the intent of finding the global optimum.

• Hard

  Hard

  Coefficient of difficulty is hard

• Hash Table(Map)

  Hash Table(Map)

  a structure that can map keys to values.

• heap(priority queue)

  heap(priority queue)

  a heap is a specialized tree-based data structure which is essentially an almost complete tree

• help wanted

  help wanted

  Extra attention is needed

• invalid

  invalid

  This doesn't seem right

• Linked List

  Linked List

  A Linked list is a linear data structure where each element is a separate object.

• math

  math

  math includes the study of such topics as quantity, structure, space, and change.

• Medium

  Medium

  Coefficient of difficulty medium

• question

  question

  Further information is requested

• Recursion

  Recursion

  solution depends on solutions to smaller instances of the same problem.

• Segment Tree

  Segment Tree

  storing information about intervals, or segments.

• sliding window

  sliding window

  A sliding window is a sub-list that runs over an underlying collection.

• sort

  sort

  Sorting algorithm is an algorithm that puts elements of a list in a certain order.

• stack

  stack

  LIFO, a stack is an abstract data type that serves as a collection of elements (push, pop)