1. Sliding Window
Usage: This algorithmic technique is used when
we need to handle the input data in a specific
window size.
DS Involved: Array, String, HashTable
, 2. Islands (Matrix Traversal)
Usage: This pattern describes all the efficient
ways of traversing a matrix (or 2D array).
DS Involved: Matrix, Queue
, 3. Two Pointers
Usage: This technique uses two pointers to
iterate input data. Generally, both pointers
move in the opposite direction at a constant
interval.
DS Involved: Array, String, LinkedList
Usage: This algorithmic technique is used when
we need to handle the input data in a specific
window size.
DS Involved: Array, String, HashTable
, 2. Islands (Matrix Traversal)
Usage: This pattern describes all the efficient
ways of traversing a matrix (or 2D array).
DS Involved: Matrix, Queue
, 3. Two Pointers
Usage: This technique uses two pointers to
iterate input data. Generally, both pointers
move in the opposite direction at a constant
interval.
DS Involved: Array, String, LinkedList
