Скачать или смотреть Max Sum Increasing Subsequence solved in JS | GfG | POTD | Streak 352 | Mon, 17 Nov 2025

POTD Question was https://www.geeksforgeeks.org/problem...

Max Sum Increasing Subsequence
Difficulty: Medium Accuracy: 40.02% Submissions: 213K+ Points: 4 Average Time: 25m

Given an array of positive integers arr[], find the maximum sum of a subsequence such that the elements of the subsequence form a strictly increasing sequence.
In other words, among all strictly increasing subsequences of the array, return the one with the largest possible sum.

Examples:

Input: arr[] = [1, 101, 2, 3, 100]
Output: 106
Explanation: The maximum sum of an increasing sequence is obtained from [1, 2, 3, 100].
Input: arr[] = [4, 1, 2, 3]
Output: 6
Explanation: The maximum sum of an increasing sequence is obtained from [1, 2, 3].
Input: arr[] = [4, 1, 2, 4]
Output: 7
Explanation: The maximum sum of an increasing sequence is obtained from [1, 2, 4].

Constraints:
1 ≤ arr.size() ≤ 10^3
1 ≤ arr[i] ≤ 10^5

Expected Complexities
Time Complexity: O(n log n)
Auxiliary Space: O(n)

#coding #GeeksforGeeks #ProblemOfTheDay #JavaScript

---
introduction:
name: "Jagadeesh Kumar S"
contact: "+91 73972 85837 | [email protected]"
description: "A problem-solving enthusiast passionate about coding challenges."

technical_achievements:
"Solved 100+ daily coding challenges on GeeksforGeeks"
"Ranked in the top 130 on SRM Institute of Science and Technology's GeeksforGeeks leaderboard"
"Maintained a 100+ day streak for Problem of the Day"

github:
contributions: "Solutions available at https://github.com/JKS-sys/Solution-T..."
---