Skip to content

Navigation Menu

Sign in
Appearance settings

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

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Labels

Labels

33 labels

  • An array is stored such that the position of each element can be computed from its index
  • incrementally builds candidates to the solutions, and abandons a candidate(invalid solution.)
  • breadth-first search is an algorithm for traversing or searching tree or graph data structure.
  • a search algorithm that finds the position of target value within a sorted array.
  • a binary tree is a tree data structure in which each node has at most two children
  • the act of algorithmically manipulating bits or other pieces of data shorter than a word
  • Something isn't working
  • Depth-first search is an algorithm for traversing or searching tree or graph data structure.
  • recursively breaking down a problem into two or more sub-problem of the same or related type.
  • The Two Pointer Algorithm
  • This issue or pull request already exists
  • optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.
  • Coefficient of difficulty easy
  • New feature or request
  • Good for newcomers
  • making the locally optimal choice at each stage with the intent of finding the global optimum.
  • Coefficient of difficulty is hard
  • a structure that can map keys to values.
  • a heap is a specialized tree-based data structure which is essentially an almost complete tree
  • Extra attention is needed
  • This doesn't seem right
  • A Linked list is a linear data structure where each element is a separate object.
  • math includes the study of such topics as quantity, structure, space, and change.
  • Coefficient of difficulty medium
  • Further information is requested
  • solution depends on solutions to smaller instances of the same problem.
  • storing information about intervals, or segments.
  • A sliding window is a sub-list that runs over an underlying collection.
  • Sorting algorithm is an algorithm that puts elements of a list in a certain order.
  • LIFO, a stack is an abstract data type that serves as a collection of elements (push, pop)

AltStyle γ«γ‚ˆγ£γ¦ε€‰ζ›γ•γ‚ŒγŸγƒšγƒΌγ‚Έ (->γ‚ͺγƒͺγ‚ΈγƒŠγƒ«) /