Discover published sets by community

Explore a graph either using depth-first search (DFS) or breadth-first search (BFS) to visit nodes.

Organize data in a certain order using various techniques like quicksort, mergesort, or heapsort.

Find an element within a data structure, commonly using linear search or binary search.

Store the results of subproblems to avoid redundant computations, often using a table.

Break the problem down into smaller subproblems of the same type and solve these subproblems recursively.

Explore all potential solutions in a systematic way and backtrack as soon as it becomes clear that a path does not lead to a solution.

Find occurrences of a substring within a string using algorithms like Knuth-Morris-Pratt or Rabin-Karp.

Solve a problem by expressing its solution in terms of smaller instances of the same problem.

Build up a solution piece by piece by choosing the best option at each step, without revisiting previous decisions.