01_Arrays
Brute Force
The brute force approach tries every possible combination to check for a solution, without levera...
Two Pointers: Inward Traversal
A pointer is a variable that represents and index or position within a data structure, such as an...
Two Pointers: Unidirectional Traversal
def shift_zeros_to_the_end(nums: List[int])-> None: # The 'left' pointer is used to position ...
Two Pointers: Stage Traversal
Problem: Partition Array by Parity Description: Given an integer array nums, rearrange the ar...
Sliding Window: Fixed
A subset of the Two Pointer Method, but uses left and right pointers to define the bounds of a "w...
Sliding Window: Dynamic
Traversing Array From The Right
Find Last Occurrence of Target in Array Description:Given an integer array nums and an integer...
Sorting The Array
When you receive an unsorted array and decide to sort it before applying the two-pointer techniqu...