689. Maximum Sum of 3 Non-Overlapping Subarrays

Loading Question ...

In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum.

Each subarray will be of size k, and we want to maximize the sum of all 3*k entries.

Return the result as a list of indices representing the starting position of each interval (0-indexed). If there are multiple answers, return the lexicographically smallest one.

Example:

Input: [1,2,1,2,6,7,5,1], 2
Output: [0, 3, 5]
Explanation: Subarrays [1, 2], [2, 6], [7, 5] correspond to the starting indices [0, 3, 5].
We could have also taken [2, 1], but an answer of [1, 3, 5] would be lexicographically larger.

Note:

  • nums.length will be between 1 and 20000.
  • nums[i] will be between 1 and 65535.
  • k will be between 1 and floor(nums.length / 3).

  • Seen this question in a real interview before?  
    Yes
    No
    When did you encounter this question?  
    last week
    last month
    last 3 month
    last 6 month
    more than 6 months
    other
    Which stage?  
    Online Assessment
    Phone Interview
    On Campus Interview
    Onsite Interview
    Don't know
    Which company?  
    Adobe
    Aetion
    Airbnb
    Alibaba
    Amazon
    Apple
    Baidu
    Bloomberg
    Cloudera
    Coursera
    Cryptic Studios
    Dropbox
    eBay
    Epic Systems
    Expedia
    Facebook
    Fallible
    Games
    Gilt Groupe
    GoDaddy
    Goo
    Google
    Hedvig
    Helix
    Houzz
    Hulu
    Indeed
    Intuit
    IXL
    LinkedIn
    LiveRamp
    Lyft
    MAQ Software
    Mathworks
    Microsoft
    NetEase
    Netsuite
    Palantir
    Palantir Technologies
    Pinterest
    Pocket Gems
    Poynt
    Pure
    Pure Storage
    Rackspace
    Radius
    Riot
    Riot Games
    Samsung
    Snapchat
    Square
    Storage
    Tencent
    TinyCo
    Twitter
    Two Sigma
    Uber
    Valve
    WAP
    Works Applications
    Yahoo
    Yahoo!
    Yelp
    Zappos
    Zenefits