Beautiful Towers II - Monotonic Increasing Stack [JS]

By on

Description 

Solution: Monotonic Increasing Stack

Find the maximum possible sum of heights ending and starting at each index i.

  • left: left[i] = sum of heights from (0, ..., i) such that they are descending from index i to 0.
  • right: right[i] = sum of heights from (i, ..., n - 1) such that they are descending from index i to n - 1.

Use a monotonic increasing stack to store indices of maxHeights such that they are smaller than maxHeights[i].

  • left to right: We know that from index i to stack[stack.length - 1], all heights are smaller than maxHeights[i].
  • Take the existing sum up to stack[stack.length - 1] (left[stack[stack.length - 1]]) and add the sum for the current range (maxHeights[i] * (i - stack[stack.length - 1]))
  • Then, do the same from right to left.

Take each maxHeights[i] as the peak of the mountain and use the results from left[i] and right[i] to calculate the total sum of heights.

Time Complexity: O(n)
Space Complexity: O(n)

var maximumSumOfHeights = function(maxHeights) {
  let n = maxHeights.length, left = Array(n).fill(0);
  let stack = [];
  for (let i = 0; i < n; i++) {
    while (stack.length && maxHeights[stack[stack.length - 1]] >= maxHeights[i]) stack.pop();
    if (stack.length) {
      let lastIndex = stack[stack.length - 1];
      let currentRange = i - lastIndex;
      left[i] = left[lastIndex] + maxHeights[i] * currentRange;
    } else {
      left[i] = maxHeights[i] * (i + 1);
    }
    stack.push(i);
  }
  stack = [];
  let right = Array(n).fill(0), ans = 0;
  for (let i = n - 1; i >= 0; i--) {
    while (stack.length && maxHeights[stack[stack.length - 1]] >= maxHeights[i]) stack.pop();
    if (stack.length) {
      let lastIndex = stack[stack.length - 1];
      let len = lastIndex - i;
      right[i] = right[lastIndex] + maxHeights[i] * len;
    } else {
      let len = n - i;
      right[i] = maxHeights[i] * len;
    }
    stack.push(i);
    ans = Math.max(ans, left[i] + right[i] - maxHeights[i]);
  }
  return ans;
};
Location: Auckland, New Zealand

Comments

Post a Comment

Popular posts from this blog

Maximum Value of an Ordered Triplet II - Two Solutions [JS]

By on
Description   Solution 1: Prefix Max Summary: Anchor at  nums[j] . We want  nums[i]  and  nums[k]  to be as larger as possible, and  nums[j]  to be as small as possible to ensure the maximum value. Calculate the maximum value on the right of each index  i :  maxRight[i]  = maximum value from index  i  to  n - 1 Go through  nums  from left to right and take each element as  nums[j] . Keep track of the maximum value on the left. Get the maximum value on the left and right of  nums[j] . Record the maximum value. Time Complexity:  O(n) Space Complexity:  O(n) var maximumTripletValue = function ( nums ) { let n = nums.length, maxRight = [...nums]; for ( let i = n - 2 ; i >= 0 ; i--) { maxRight[i] = Math .max(nums[i], maxRight[i + 1 ]); } let maxLeft = 0 , ans = 0 ; for ( let j = 0 ; j < n; j++) { if (j > 0 && j < n - 1 ) { ans = Math .max(an...
Read more

Maximum Sum of Distinct Subarrays With Length K - Sliding Window w/ Two Pointers & Set [JS]

By on
Description  Solution: Sliding Window w/ Two Pointers & Set Maintain a sliding window of unique numbers with maximum size of  k . We can store the numbers in the window in a hashset. When we move the right pointer up, move the left pointer up until: all numbers in the window are unique the window size  <= k Time Complexity:  O(n)  246ms Space Complexity:  O(k)  71.5MB var maximumSubarraySum = function ( nums, k ) { let set = new Set (), sum = 0 ; let ans = 0 , n = nums.length; for ( let j = 0 , i = 0 ; j < n; j++) { sum += nums[j]; while (set.has(nums[j]) || j - i >= k) { sum -= nums[i]; set.delete(nums[i]); i++; } set.add(nums[j]); if (j - i + 1 === k) ans = Math .max(ans, sum); } return ans; };
Read more

Sum of Prefix Scores of Strings - Trie [JS]

By on
Description   Solution: Trie Store each word in a trie. For every node in the trie, keep track of the number of words it is part of. Since we stored the count of words on every node, we can calculate the count of every prefix for every word on the fly. n = number of words ,  m = max(words[i].length) Time Complexity:  O(nm) Space Complexity:  O(26^m)  at worst var sumPrefixScores = function ( words ) { let trie = new Trie(); for ( let word of words) { trie.add(word); } let n = words.length, res = Array (n); for ( let i = 0 ; i < words.length; i++) { res[i] = trie.getScore(words[i]); } return res; }; class TrieNode { constructor ( ) { this .children = {}; this .count = 0 ; } } class Trie { constructor ( ) { this .root = new TrieNode(); } add ( word ) { let node = this .root; for ( let i = 0 ; i < word.length; i++) { node = node.children; let char = word[i]; if (...
Read more

Maximum Count of Positive Integer and Negative Integer - Binary Search [JS]

By on
Description  Solution: Binary Search Since  nums  is sorted, we can use binary search: Binary search for the index of the rightmost negative number. Binary search for the index of the leftmost positive number. Based on the indexes we can find the amount of negative and positive numbers. Time Complexity:  O(log(n))  64ms Space Complexity:  O(1)  43.7MB var maximumCount = function ( nums ) { return Math .max(upper_bound(nums), lower_bound(nums)); }; // binary search for the rightmost negative number function upper_bound ( nums ) { let low = 0 , high = nums.length - 1 ; while (low < high) { let mid = Math .ceil((low + high) / 2 ); if (nums[mid] < 0 ) low = mid; else high = mid - 1 ; } return nums[ 0 ] >= 0 ? 0 : low + 1 ; } // binary search for the leftmost positive number function lower_bound ( nums ) { let low = 0 , high = nums.length - 1 ; while (low < high) { let mid = Math .floor((low + hi...
Read more

Count Subarrays With Median K - Count Left & Right Balance [JS]

By on
Description   Solution: Count Left & Right Balance For a subarray to have median of  k : The subarray must contain  k . k  must be the middle element (if odd) or lower mid element (if even). Create subarrays revolving around  nums[i] = k . How do we find whether  k  is the mid/lower mid element? Starting from  k , count the "balance" on the left and right of  k . If  nums[i] < k , add  -1  to the balance. If  nums[i] > k , add  1  to the balance. If  k  is the mid element, the left balance + right balance =  0 . If  k  is the lower mid element, left balance + right balance =  1 . Store the count of left balances in a hashmap. Go through each right balance, Balance = 0 : Count the number of left balances that are equal to ( -right balance ) Balance = 1 : Count the number of left balances that are equal to ( -right balance + 1 ) Time Complexity:  O(n) Space Complexity:...
Read more