Basic Topics | LeetCode The Hard Way

📄️ Arrays

An array is a data structure consisting of a collection of elements.

📄️ Backtracking

A backtracking algorithm is used to construct a solution recursively by starting with an empty solution and adding solution one by one.

📄️ Binary Search

Binary search is the searching strategy that reduces the search space by half every iteration until you have found the target.

📄️ Brute Force

Brute Force is used when the problem size is limited

📄️ Greedy

Designing greedy algorithms to find a greedy strategy that produces an optimal solution to the problem

📄️ Hash Map

Hash Map provides quick lookup of certain values in O(1) time.

📄️ Heap (Priority Queue)

A heap, or a priority queue, is a data structure that efficiently stores elements in a particular order.

📄️ Kadane Algorithm

Kadane 1D algorithm finds the maximum sum subarray in an array of integers. Kadane 2D algorithm finds the maximum sum subarray in a 2D array of integers.

Linear search is a searching technique that works in a linear / sequential fashion. It traverses whole of the data structure and returns the position(s) where the value is found. If not found then it simple returns nothing.