https://github.com/prakhar-002/leetcode

📜 LeetCode Solution Hub 🔥 | Get all solutions 🧩 for daily challenges and specific tasks 💪🏻 | Example: 🍨 LeetCode 75 - 🪻 Ace Coding Interview, 📦 SQL 50 - 🌽 Crack SQL Interview, 📒 30 Days of JavaScript - 🌻 Learn JS Basics
https://github.com/prakhar-002/leetcode

c cpp java javascript leet leetcode leetcode-cpp leetcode-java leetcode-javascript leetcode-practice leetcode-python leetcode-solutions python3 questions-and-answers

Last synced: 17 days ago
JSON representation

📜 LeetCode Solution Hub 🔥 | Get all solutions 🧩 for daily challenges and specific tasks 💪🏻 | Example: 🍨 LeetCode 75 - 🪻 Ace Coding Interview, 📦 SQL 50 - 🌽 Crack SQL Interview, 📒 30 Days of JavaScript - 🌻 Learn JS Basics

• Host: GitHub
• URL: https://github.com/prakhar-002/leetcode
• Owner: Prakhar-002
• Created: 2024-05-24T09:01:02.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2025-06-16T04:25:18.000Z (19 days ago)
• Last Synced: 2025-06-16T05:27:23.245Z (19 days ago)
• Topics: c, cpp, java, javascript, leet, leetcode, leetcode-cpp, leetcode-java, leetcode-javascript, leetcode-practice, leetcode-python, leetcode-solutions, python3, questions-and-answers
• Language: Java
• Homepage: https://leetcode.com/u/Prakhar-002/
• Size: 3.75 MB
• Stars: 7
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# 689. Maximum Sum of 3 Non-Overlapping Subarrays

 


➥ ☢️ 689 Leetcode Medium ☢️ 



# Description 📜 ˋ°•*⁀➷

### Given an integer array `nums` and an integer `k`, find three non-overlapping subarrays of length `k` with maximum sum and return them.

### 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 💡 1️⃣ ˋ°•*⁀➷

  ### 📥 `Input`  ➤  nums = [1,2,1,2,6,7,5,1], k = 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.

# Example 💡 2️⃣ ˋ°•*⁀➷

  ### 📥 `Input` ➤ nums = [1,2,1,2,1,2,1,2,1], k = 2

  ### 📤 `Output`  ➤ [0,2,4]

# Constraints 🔒 ˋ°•*⁀➷

🔹 **1 <= nums.length <= 2 * 104** 

🔹 **1 <= nums[i] < 216** 

🔹 **`1 <= k <= floor(nums.length / 3)`** 

# Topics 📋 ˋ°•*⁀➷

🔸 **Array**  

🔸 **Dynamic Programming**  

# Solution ✏️ ˋ°•*⁀➷

| 📒 Language 📒  | 🪶 Solution 🪶 |

| ------------- | ------------- |

|  ![Java](https://img.shields.io/badge/java-%23ED8B00.svg?style=for-the-badge&logo=openjdk&logoColor=white)  | [JAVA🍁](https://github.com/Prakhar-002/LEETCODE/blob/main/%F0%9F%93%9C%20Daily%20Challange%20%F0%9F%92%A1/12%20December%20%F0%9F%90%BB%E2%80%8D%E2%9D%84%EF%B8%8F%202024/28%20-%2012%20-%202024%20---%20689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays%20%E2%98%83%EF%B8%8F%20%F0%9F%8D%81%20%F0%9F%8D%B0%20%F0%9F%8E%B2/%F0%9F%8D%81JAVA%20-%20689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays.java) |

|  ![C++](https://img.shields.io/badge/c++-%2300599C.svg?style=for-the-badge&logo=c%2B%2B&logoColor=white)  | [C++🎲](https://github.com/Prakhar-002/LEETCODE/blob/main/%F0%9F%93%9C%20Daily%20Challange%20%F0%9F%92%A1/12%20December%20%F0%9F%90%BB%E2%80%8D%E2%9D%84%EF%B8%8F%202024/28%20-%2012%20-%202024%20---%20689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays%20%E2%98%83%EF%B8%8F%20%F0%9F%8D%81%20%F0%9F%8D%B0%20%F0%9F%8E%B2/%F0%9F%8E%B2CPP%20-%20689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays.cpp)  |

|  ![Python](https://img.shields.io/badge/python-3670A0?style=for-the-badge&logo=python&logoColor=ffdd54)    | [PYTHON🍰](https://github.com/Prakhar-002/LEETCODE/blob/main/%F0%9F%93%9C%20Daily%20Challange%20%F0%9F%92%A1/12%20December%20%F0%9F%90%BB%E2%80%8D%E2%9D%84%EF%B8%8F%202024/28%20-%2012%20-%202024%20---%20689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays%20%E2%98%83%EF%B8%8F%20%F0%9F%8D%81%20%F0%9F%8D%B0%20%F0%9F%8E%B2/%F0%9F%8D%B0PYTHON%20-%20689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays.py) |

| ![JavaScript](https://img.shields.io/badge/javascript-%23323330.svg?style=for-the-badge&logo=javascript&logoColor=%23F7DF1E)   | [JAVASCRIPT☃️](https://github.com/Prakhar-002/LEETCODE/blob/main/%F0%9F%93%9C%20Daily%20Challange%20%F0%9F%92%A1/12%20December%20%F0%9F%90%BB%E2%80%8D%E2%9D%84%EF%B8%8F%202024/28%20-%2012%20-%202024%20---%20689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays%20%E2%98%83%EF%B8%8F%20%F0%9F%8D%81%20%F0%9F%8D%B0%20%F0%9F%8E%B2/%E2%98%83%EF%B8%8FJAVASCRIPT%20-%20689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays.js) |