Maximum Subarray Sum
Posted: 2 Sep, 2019
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.
Given the array [-5, -1, -8, -9], the maximum sum would be -1.
Follow up: Do this in O(N) time.
The first line of input contains size of array, which is denoted by N and second line of input contains N space separated integers.
The first and only line of output should print the maximum subarray sum, as described in the description.
- Create a nested loop. The outer loop will go from i = 0 to i = n - k. This will cover the starting indices of all k-subarrays
- The inner loop will go from j = i to j = i + k - 1. This will cover all the elements of the k-subarray starting from index i
- Keep track of the maximum element in the inner loop and print it.
Maximise the OR Sum
Posted: 23 Jun, 2021
Buying And Selling Stock
Posted: 28 Jun, 2021
Game of 3
Posted: 11 Jul, 2021
Zero Pair Sum
Posted: 22 Jul, 2021
Queue using Array or Singly Linked List.
Posted: 27 Jul, 2021