Minimum Moves to Equal Array Elements – LeetCode Solution [Medium]
When we increment n – 1 elements, the relative difference between the highest number and all other numbers effectively decreases by 1.
Category: Arrays
Minimum adjacent swaps required to sort Binary Array in O(n) | Amazon Interview Question
Given an array consisting of only 1s and 0s, sort this binary array such that all 0s are on the left and all 1s are on the right.
Array Manipulation | HackerRank Solution [Hard]
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array.
Sherlock and MiniMax | HackerRank Solution [Hard]
Given an integer range, for all M in that inclusive range, determine the minimum – abs(arr[i]-M) for all i
Sherlock and Array | HackerRank Solution [Easy]
Challenge is to find an element of the array such that the sum of all elements to the left is equal to the sum of all elements to the right
Max Min | HackerRank Solution [Medium]
Given a list of integers, arr, and a single integer k. Create an array of size k from elements of arr such that its unfairness is minimum
Count of Maximum Solution
Given an array A of length N, your task is to find the element which repeats in A maximum number of times as well as the corresponding count.
Jump game – LeetCode Solution [Medium]
You are given an integer array nums. You are initially positioned at the array’s first index, and each element in the array represents your maximum jump length at that position.
Find maximum of all subarrays of size k
Given an array of size n and an integer k, we need to find the maximum for each contiguous subarray of size k.
Best Time to Buy and Sell Stock [Interview Question]
You are given an array prices where prices[i] is the price of a given stock on the ith day. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.