BFS - Breadth First Search
A way to explore trees, graphs, or grids one level at a time.
A way to explore trees, graphs, or grids one level at a time.
A powerful technique for efficiently computing product-related queries.
A powerful technique for efficiently computing sum-related queries.
A special dictionary-like class for counting occurrences of elements
Sliding Window, an efficient technique for solving array problems
A reliable and efficient algorithm for sorting data using a divide-and-conquer approach.
A simple and adaptable technique that optimizes problem-solving by scanning arrays efficiently
A fast and precise method for finding targets in sorted arrays.