Array

Find Second Smallest and Second Largest Element in an Array

Find the Largest Element in an Array

Next Permutation

Chocolate Distribution Problem

Three Sum Zero Problem

Container With Most Water

Maximum Subarray Sum

Reversing an Array

Array Rotation

Array rotation is a common problem in computer science and programming that involves reordering the elements of an array. It has applications in various domains, including data manipulation, image processing, and algorithm design. In this article, we will explore the problem of array rotation, understand it with examples, and delve into different algorithms to solve it.

Finding Majority Element in Array 1

The majority element in an array is defined as the element that appears more than n/2 times, where n is the size of the array. Solving the problem of finding the majority element is a common task in computer science and has applications in various domains. In this article, we'll explore the problem, understand it with an example, delve into different algorithms to solve it.

Finding the Min Max Element