DSA Visualizations | Hello Interview

Max Sum of Distinct Subarrays Length k

DESCRIPTION (credit Leetcode.com)

Given an integer array nums and an integer k, write a function to identify the highest possible sum of a subarray within nums, where the subarray meets the following criteria: its length is k, and all of its elements are unique.

EXAMPLES

Example 1: Input:


nums = [3, 2, 2, 3, 4, 6, 7, 7, -1]
k = 4

Output:

Explanation: The subarrays of nums with length 4 are:


[3, 2, 2, 3] # elements 3 and 2 are repeated.
[2, 2, 3, 4] # element 2 is repeated.
[2, 3, 4, 6] # meets the requirements and has a sum of 15.
[3, 4, 6, 7] # meets the requirements and has a sum of 20.
[4, 6, 7, 7] # element 7 is repeated.
[6, 7, 7, -1] # element 7 is repeated.

We return 20 because it is the maximum subarray sum of all the subarrays that meet the conditions.

Run your code to see results here

Explanation

This solution uses a fixed-length sliding window to iterate over all subarrays of length k in O(n) time and O(k) space. For each subarray of length k, we check if all elements are distinct. If they are, then we compute the sum of the subarray and compare it to the maximum sum we have seen so far, and return the maximum sum at the end.

We represent the state of the current window using two variables:

curr_sum: The sum of all elements in the window.
state: A dictionary mapping each element in the window to the number of times it appears in the window.

We use a for-loop to iterate through each element in nums. For each element, we increment its count in state and add its value to curr_sum. We do this until the window reaches size k:


def maxSum(nums, k):
  max_sum = 0
  start = 0
  state = {}
  curr_sum = 0

  for end in range(len(nums)):
    curr_sum = curr_sum + nums[end]
    state[nums[end]] = state.get(nums[end], 0) + 1
    
    if end - start + 1 == k:
      if len(state) == k:
        max_sum = max(max_sum, curr_sum)

      curr_sum = curr_sum - nums[start]
      state[nums[start]] = state[nums[start]] - 1
      if state[nums[start]] == 0:
        del state[nums[start]]
      start += 1

  return max_sum

start

max sum distinct subarrays of size k

0 / 5

Expanding window until it reaches size k = 4

Each time the window is of size k, we check if the window contains all distinct elements by comparing the length of state to k (if len(state) == k, then all elements in the window are distinct):

If it is, then we compare curr_sum to max_sum and update max_sum if curr_sum is greater.

We then prepare for the next iteration by contracting the window, which involves decrementing the count of the leftmost element in the window and removing it from state if its count is 0. We also subtract the leftmost element from curr_sum. This allows us to maintain the fixed length of the window.


def maxSum(nums, k):
  max_sum = 0
  start = 0
  state = {}
  curr_sum = 0

  for end in range(len(nums)):
    curr_sum = curr_sum + nums[end]
    state[nums[end]] = state.get(nums[end], 0) + 1
    
    if end - start + 1 == k:
      if len(state) == k:
        max_sum = max(max_sum, curr_sum)

      curr_sum = curr_sum - nums[start]
      state[nums[start]] = state[nums[start]] - 1
      if state[nums[start]] == 0:
        del state[nums[start]]
      start += 1

  return max_sum

curr_sum: 10

start: 0 | end: 3

expand window

0 / 4

Expanding and contracting the window until first valid subarray is found

We do this until the window reaches the end of nums and return max_sum at the end.


def maxSum(nums, k):
  max_sum = 0
  start = 0
  state = {}
  curr_sum = 0

  for end in range(len(nums)):
    curr_sum = curr_sum + nums[end]
    state[nums[end]] = state.get(nums[end], 0) + 1
    
    if end - start + 1 == k:
      if len(state) == k:
        max_sum = max(max_sum, curr_sum)

      curr_sum = curr_sum - nums[start]
      state[nums[start]] = state[nums[start]] - 1
      if state[nums[start]] == 0:
        del state[nums[start]]
      start += 1

  return max_sum

curr_sum: 15

start: 2 | end: 5

expand window

0 / 10

Expanding and contracting the window until the end of the array.

Solution


def maxSum(nums, k):
  max_sum = 0
  start = 0
  state = {}
  curr_sum = 0

  for end in range(len(nums)):
    curr_sum = curr_sum + nums[end]
    state[nums[end]] = state.get(nums[end], 0) + 1
    
    if end - start + 1 == k:
      if len(state) == k:
        max_sum = max(max_sum, curr_sum)

      curr_sum = curr_sum - nums[start]
      state[nums[start]] = state[nums[start]] - 1
      if state[nums[start]] == 0:
        del state[nums[start]]
      start += 1

  return max_sum

start

max sum distinct subarrays of size k

0 / 19

Next: Overview

Your account is free and you can post anonymously if you choose.

Loading comments...

Back to Home

Eliminating Pairs

Overview

Container With Most Water

3-Sum

Triangle Numbers

Pointers as Regions

Move Zeroes

Sort Colors

Trapping Rain Water

Variable-Length

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Fixed-Length

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Monotonic Stack

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Binary Trees

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs

Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Topological Sort

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Max Points You Can Obtain From Cards

Intervals: Overview

Max Sum of Distinct Subarrays Length k

DESCRIPTION (credit Leetcode.com)

EXAMPLES

Example 1: Input:


nums = [3, 2, 2, 3, 4, 6, 7, 7, -1]
k = 4

Output:

Explanation: The subarrays of nums with length 4 are:


[3, 2, 2, 3] # elements 3 and 2 are repeated.
[2, 2, 3, 4] # element 2 is repeated.
[2, 3, 4, 6] # meets the requirements and has a sum of 15.
[3, 4, 6, 7] # meets the requirements and has a sum of 20.
[4, 6, 7, 7] # element 7 is repeated.
[6, 7, 7, -1] # element 7 is repeated.

We return 20 because it is the maximum subarray sum of all the subarrays that meet the conditions.

Run your code to see results here

Explanation

We represent the state of the current window using two variables:

curr_sum: The sum of all elements in the window.
state: A dictionary mapping each element in the window to the number of times it appears in the window.

We use a for-loop to iterate through each element in nums. For each element, we increment its count in state and add its value to curr_sum. We do this until the window reaches size k:


def maxSum(nums, k):
  max_sum = 0
  start = 0
  state = {}
  curr_sum = 0

  for end in range(len(nums)):
    curr_sum = curr_sum + nums[end]
    state[nums[end]] = state.get(nums[end], 0) + 1
    
    if end - start + 1 == k:
      if len(state) == k:
        max_sum = max(max_sum, curr_sum)

      curr_sum = curr_sum - nums[start]
      state[nums[start]] = state[nums[start]] - 1
      if state[nums[start]] == 0:
        del state[nums[start]]
      start += 1

  return max_sum

start

max sum distinct subarrays of size k

0 / 5

Expanding window until it reaches size k = 4

Each time the window is of size k, we check if the window contains all distinct elements by comparing the length of state to k (if len(state) == k, then all elements in the window are distinct):

If it is, then we compare curr_sum to max_sum and update max_sum if curr_sum is greater.


def maxSum(nums, k):
  max_sum = 0
  start = 0
  state = {}
  curr_sum = 0

  for end in range(len(nums)):
    curr_sum = curr_sum + nums[end]
    state[nums[end]] = state.get(nums[end], 0) + 1
    
    if end - start + 1 == k:
      if len(state) == k:
        max_sum = max(max_sum, curr_sum)

      curr_sum = curr_sum - nums[start]
      state[nums[start]] = state[nums[start]] - 1
      if state[nums[start]] == 0:
        del state[nums[start]]
      start += 1

  return max_sum

curr_sum: 10

start: 0 | end: 3

expand window

0 / 4

Expanding and contracting the window until first valid subarray is found

We do this until the window reaches the end of nums and return max_sum at the end.


def maxSum(nums, k):
  max_sum = 0
  start = 0
  state = {}
  curr_sum = 0

  for end in range(len(nums)):
    curr_sum = curr_sum + nums[end]
    state[nums[end]] = state.get(nums[end], 0) + 1
    
    if end - start + 1 == k:
      if len(state) == k:
        max_sum = max(max_sum, curr_sum)

      curr_sum = curr_sum - nums[start]
      state[nums[start]] = state[nums[start]] - 1
      if state[nums[start]] == 0:
        del state[nums[start]]
      start += 1

  return max_sum

curr_sum: 15

start: 2 | end: 5

expand window

0 / 10

Expanding and contracting the window until the end of the array.

Solution


def maxSum(nums, k):
  max_sum = 0
  start = 0
  state = {}
  curr_sum = 0

  for end in range(len(nums)):
    curr_sum = curr_sum + nums[end]
    state[nums[end]] = state.get(nums[end], 0) + 1
    
    if end - start + 1 == k:
      if len(state) == k:
        max_sum = max(max_sum, curr_sum)

      curr_sum = curr_sum - nums[start]
      state[nums[start]] = state[nums[start]] - 1
      if state[nums[start]] == 0:
        del state[nums[start]]
      start += 1

  return max_sum

start

max sum distinct subarrays of size k

0 / 19

Next: Overview

Your account is free and you can post anonymously if you choose.

Loading comments...

BlogBehavioral Interview Examples Interviewing for Experienced SWEs All Blog Posts

Compare UsCompare to Interviewing.io

LinksFAQ Schedule Mock Interviews Pricing Become a Coach Our Coaches Learn System Design Learn DSA

LegalTerms and Conditions Privacy Policy

Contactsupport@hellointerview.com7511 Greenwood Ave North
Unit #4238 Seattle, WA 98103