Words Can Change The World!

Two Pointer Algorithm Explained
In this article, we will learn about the Two Pointer algorithm. The Two Pointer algorithm uses two pointers to iterate an array or list until conditions are met. This technique is useful because it allows us to keep track of two values and different indexes in a single iteration.
4 min read
Kadane’s Algorithm Explained
Let's learn about Kadane’s Algorithm (a.k.a. maximum sum subarray problem), which is a greedy dynamic programming algorithm that calculates the maximum subarray at a particular position. It also helps reduce the time complexity to linear time O(n).
4 min read

All Articles