Progress

0%

Getting Started

Binary Search

Depth First Search/ Backtracking

Breadth First Search

Graph

Two Pointers

Priority Queue / Heap

Divide and Conquer

Dynamic Programming

Other

Data Structure Design

Company Specific

Keyword to Algorithm

"Top k"

"How many ways.."

"Substring"

"Palindrome"

"Tree"

"Parentheses"

"Subarray"

"X Sum"

"Max/longest sequence"

"Minimum/Shortest"

"Partition/split ... array/string"

"Subsequence"

"Matrix"

"Jump"

"Game"

"Connected component", "Cut/remove" "Regions/groups/connections"

Transitive relationship

If the items are related to one another and the relationship is transitive, then chances are we can build a graph and use BFS or Union Find.