Arrays

LeetCode problem #1300

Master array manipulation with fundamental problems covering searching, sorting, and advanced algorithms.

Find the maximum profit from buying and selling stock with at most one transaction

Find the majority element that appears more than n/2 times using Boyer-Moore majority vote algorithm

Find the missing number in an array containing n distinct numbers taken from 1, 2, 3, ..., n+1

Find the intersection of two arrays and return the result as an array.

Find the length of the longest consecutive elements sequence in an unsorted array.

Find the contiguous subarray with maximum sum using Kadane's algorithm

Find the minimum number of swaps required to sort an array.

Return an array where each element is the product of all elements except the element at that index.

Find all unique triplets in the array which gives the sum of zero