The two pointer technique is one of the most common and powerful patterns used in competitive programming, data structures, and algorithms. It helps solve problems that involve searching, sorting, or traversing arrays, strings, or linked lists in an efficient way. Core At its core, the idea is simple, Instead of brute-forcing through every possible pair … Read more
Floyd’s Cycle Detection Algorithm is a pointer algorithm that uses two pointers moving at different speeds to detect a cycle in a sequence of values, typically in a linked list. It is one of the most elegant solutions to the cycle detection problem and operates with O(n) time and O(1) space complexity. This technique was … Read more
Linked Lists are one of the most fundamental data structures in computer science. Understanding their operations is crucial for interviews, system designs, and efficient programming. In this article, we’ll explore what a linked list is, and walk through all the key operations step-by-step. What is a Linked List? A Linked List is a linear data … Read more