Search for a command to run...
Articles tagged with #450dsa
Minimize the Heights II Given an array arr[] denoting heights of N towers and a positive integer K. For each tower, you must perform exactly one of the following operations exactly once. Increase the height of the tower by K Decrease the height of ...
Kadane's Algorithm Given an array Arr[] of N integers. Find the contiguous sub-array(containing at least one number) which has the maximum sum and return its sum. Example 1: Input: N = 5 Arr[] = {1,2,3,-2,5} Output: 9 Explanation: Max subarray sum is...
Cyclically rotate an array by one Given an array, rotate the array by one position in clock-wise direction. Example 1: Input: N = 5 A[] = {1, 2, 3, 4, 5} Output: 5 1 2 3 4 Example 2: Input: N = 8 A[] = {9, 8, 7, 6, 4, 2, 1, 3} Output: 3 9 8 7 6 4 ...
Move all negative elements to end Given an unsorted array arr[] of size n having both negative and positive integers. The task is place all negative element at the end of array without changing the order of positive element and negative element. Exam...
Kth smallest element Given an array arr[] and an integer K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct. Note :- l and r denotes the starting...
Find minimum and maximum element in an array Given an array A of size N of integers. Your task is to find the minimum and maximum elements in the array. Example 1: Input: N = 6 A[] = {3, 2, 1, 56, 10000, 167} Output: 1 10000 Explanation: minimum and ...
