#dsa
Read more stories on Hashnode
Articles with this tag
This is a cool problem. We need to find the contiguous subarray with the largest sum in an array. We will start by writing a brute force approach and...
While the DSA 450 problem only asks you to rotate the array cyclically by one, we will go a step beyond the required and discuss how to cyclically...
In this article, we will go through two ways of finding union and two ways of finding intersection of arrays. But before that, let's take a look at...
This problem is the easier version of the problem we solved earlier in this series. So let's start by looking at the simple approach first. Simple...
Sorting an array is a tedious task and usually takes nlogn time. But since we know that the array contains only 0s, 1s and 2s. We can do this sorting...
Finding Kth smallest or largest element of an array has many intuitive solutions. But in this article, we will only cover the simple array-based...
