Category: DSA
-
Explaining Sliding Window Technique
Have you ever encountered a question, maybe on leetcode, or some other source, that required you to either get the minimum or maximum subarray size whose sum is equivalent to a target? If so, you might find this article useful. In this piece, I’ll explain the sliding window technique and give an example of it […]
-
Understanding Binary Search: Function, Benefits, Time & Space Complexity
Binary Search is a fundamental algorithm in computer science, revered for its efficiency and wide range of applications. It is a divide-and-conquer search algorithm that allows us to find a specific element within a sorted array or list. In this article, we will explore the function and benefits of Binary Search, while also delving into […]
