📄️ Sliding Window
In many problems dealing with an array (or a LinkedList),
📄️ Two Pointer
The two-pointer pattern is an efficient technique for solving problems by using two pointers to optimize the traversal and comparison of data, often achieving linear time complexity.
📄️ Hash Map
Map Like Data Structures are versatile data structures that store key-value pairs and provide efficient operations for insertion, deletion, and lookup.
📄️ Fast and Slow Pointers
Determing if a linked list has a cycle