Create maximum_subsequence.py#7811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
chriso345 merged 10 commits into from
May 10, 2023
Merged

Create maximum_subsequence.py #7811

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
7fbaa5f
Create maximum_subsequence.py
pronoym99 Oct 28, 2022
6f15749
Update other/maximum_subsequence.py
pronoym99 Nov 1, 2022
2df68a8
Update maximum_subsequence.py
pronoym99 Nov 1, 2022
dedd91c
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Nov 1, 2022
0dcf25e
Update maximum_subsequence.py
pronoym99 Nov 1, 2022
e1db646
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Nov 1, 2022
39bd75d
Update maximum_subsequence.py
pronoym99 Nov 1, 2022
4744d96
Update maximum_subsequence.py
pronoym99 Nov 3, 2022
5cf74a9
updating DIRECTORY.md
Nov 3, 2022
7a9e3b3
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Nov 3, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions DIRECTORY.md
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -165,6 +165,7 @@
* [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
* [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
* [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
* [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
* [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
* [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
* [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
Expand DownExpand Up@@ -285,6 +286,7 @@
* [Bitmask](dynamic_programming/bitmask.py)
* [Catalan Numbers](dynamic_programming/catalan_numbers.py)
* [Climbing Stairs](dynamic_programming/climbing_stairs.py)
* [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
* [Edit Distance](dynamic_programming/edit_distance.py)
* [Factorial](dynamic_programming/factorial.py)
* [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
Expand DownExpand Up@@ -595,6 +597,7 @@
* [P Series](maths/series/p_series.py)
* [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
* [Sigmoid](maths/sigmoid.py)
* [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
* [Signum](maths/signum.py)
* [Simpson Rule](maths/simpson_rule.py)
* [Sin](maths/sin.py)
Expand DownExpand Up@@ -660,6 +663,7 @@
* [Lru Cache](other/lru_cache.py)
* [Magicdiamondpattern](other/magicdiamondpattern.py)
* [Maximum Subarray](other/maximum_subarray.py)
* [Maximum Subsequence](other/maximum_subsequence.py)
* [Nested Brackets](other/nested_brackets.py)
* [Password Generator](other/password_generator.py)
* [Scoring Algorithm](other/scoring_algorithm.py)
Expand DownExpand Up@@ -1107,6 +1111,7 @@
* [Fetch Jobs](web_programming/fetch_jobs.py)
* [Fetch Quotes](web_programming/fetch_quotes.py)
* [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
* [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
* [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
* [Get Imdbtop](web_programming/get_imdbtop.py)
* [Get Top Billioners](web_programming/get_top_billioners.py)
Expand Down
42 changes: 42 additions & 0 deletions other/maximum_subsequence.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
from collections.abc import Sequence


def max_subsequence_sum(nums: Sequence[int] | None = None) -> int:
"""Return the maximum possible sum amongst all non - empty subsequences.

Raises:
ValueError: when nums is empty.

>>> max_subsequence_sum([1,2,3,4,-2])
10
>>> max_subsequence_sum([-2, -3, -1, -4, -6])
-1
>>> max_subsequence_sum([])
Traceback (most recent call last):
. . .
ValueError: Input sequence should not be empty
>>> max_subsequence_sum()
Traceback (most recent call last):
. . .
ValueError: Input sequence should not be empty
"""
if nums is None or not nums:
raise ValueError("Input sequence should not be empty")

ans = nums[0]
for i in range(1, len(nums)):
num = nums[i]
ans = max(ans, ans + num, num)

return ans


if __name__ == "__main__":
import doctest

doctest.testmod()

# Try on a sample input from the user
n = int(input("Enter number of elements : ").strip())
array = list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
print(max_subsequence_sum(array))
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all 
 blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks");
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '

Skip to content
Create maximum_subsequence.py#7811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

chriso345
merged 10 commits into

from

May 10, 2023
 Merged


Create maximum_subsequence.py
#7811
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
7fbaa5f

Create maximum_subsequence.py


pronoym99 Oct 28, 2022
6f15749

Update other/maximum_subsequence.py


pronoym99 Nov 1, 2022
2df68a8

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
dedd91c

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
0dcf25e

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
e1db646

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
39bd75d

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
4744d96

Update maximum_subsequence.py


pronoym99 Nov 3, 2022
5cf74a9

updating DIRECTORY.md

Nov 3, 2022
7a9e3b3

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 3, 2022

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


5 changes: 5 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -165,6 +165,7 @@
 * [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
 * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
 * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
 * [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
 * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
 * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
 * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
Expand DownExpand Up@@ -285,6 +286,7 @@
 * [Bitmask](dynamic_programming/bitmask.py)
 * [Catalan Numbers](dynamic_programming/catalan_numbers.py)
 * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
 * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
 * [Edit Distance](dynamic_programming/edit_distance.py)
 * [Factorial](dynamic_programming/factorial.py)
 * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
Expand DownExpand Up@@ -595,6 +597,7 @@
 * [P Series](maths/series/p_series.py)
 * [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
 * [Sigmoid](maths/sigmoid.py)
 * [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
 * [Signum](maths/signum.py)
 * [Simpson Rule](maths/simpson_rule.py)
 * [Sin](maths/sin.py)
Expand DownExpand Up@@ -660,6 +663,7 @@
 * [Lru Cache](other/lru_cache.py)
 * [Magicdiamondpattern](other/magicdiamondpattern.py)
 * [Maximum Subarray](other/maximum_subarray.py)
 * [Maximum Subsequence](other/maximum_subsequence.py)
 * [Nested Brackets](other/nested_brackets.py)
 * [Password Generator](other/password_generator.py)
 * [Scoring Algorithm](other/scoring_algorithm.py)
Expand DownExpand Up@@ -1107,6 +1111,7 @@
 * [Fetch Jobs](web_programming/fetch_jobs.py)
 * [Fetch Quotes](web_programming/fetch_quotes.py)
 * [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
 * [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
 * [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](web_programming/get_imdbtop.py)
 * [Get Top Billioners](web_programming/get_top_billioners.py)
Expand Down

42 changes: 42 additions & 0 deletions
other/maximum_subsequence.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
from collections.abc import Sequence


def max_subsequence_sum(nums: Sequence[int] | None = None) -> int:
 """Return the maximum possible sum amongst all non - empty subsequences.

 Raises:
 ValueError: when nums is empty.

 >>> max_subsequence_sum([1,2,3,4,-2])
 10
 >>> max_subsequence_sum([-2, -3, -1, -4, -6])
 -1
 >>> max_subsequence_sum([])
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 >>> max_subsequence_sum()
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 """
 if nums is None or not nums:
 raise ValueError("Input sequence should not be empty")

 ans = nums[0]
 for i in range(1, len(nums)):
 num = nums[i]
 ans = max(ans, ans + num, num)

 return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 # Try on a sample input from the user
 n = int(input("Enter number of elements : ").strip())
 array = list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
 print(max_subsequence_sum(array))

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Force GitHub README to respect dark mode\n(function() {\n var style = document.createElement('style');\n style.textContent = '\n .markdown-body {\n color-scheme: dark light;\n }\n .markdown-body pre { background: #161b22 !important; }\n .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }\n .markdown-body table th, .markdown-body table td { border-color: #30363d !important; }\n .markdown-body img { background: #0d1117; }\n .markdown-body blockquote { border-left-color: #8b949e; }\n .markdown-body hr { border-color: #30363d; }\n ';\n document.head.appendChild(style);\n})();", "GitHub Dark Mode README Fix");
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
Create maximum_subsequence.py#7811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

chriso345
merged 10 commits into

from

May 10, 2023
 Merged


Create maximum_subsequence.py
#7811
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
7fbaa5f

Create maximum_subsequence.py


pronoym99 Oct 28, 2022
6f15749

Update other/maximum_subsequence.py


pronoym99 Nov 1, 2022
2df68a8

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
dedd91c

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
0dcf25e

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
e1db646

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
39bd75d

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
4744d96

Update maximum_subsequence.py


pronoym99 Nov 3, 2022
5cf74a9

updating DIRECTORY.md

Nov 3, 2022
7a9e3b3

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 3, 2022

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


5 changes: 5 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -165,6 +165,7 @@
 * [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
 * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
 * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
 * [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
 * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
 * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
 * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
Expand DownExpand Up@@ -285,6 +286,7 @@
 * [Bitmask](dynamic_programming/bitmask.py)
 * [Catalan Numbers](dynamic_programming/catalan_numbers.py)
 * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
 * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
 * [Edit Distance](dynamic_programming/edit_distance.py)
 * [Factorial](dynamic_programming/factorial.py)
 * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
Expand DownExpand Up@@ -595,6 +597,7 @@
 * [P Series](maths/series/p_series.py)
 * [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
 * [Sigmoid](maths/sigmoid.py)
 * [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
 * [Signum](maths/signum.py)
 * [Simpson Rule](maths/simpson_rule.py)
 * [Sin](maths/sin.py)
Expand DownExpand Up@@ -660,6 +663,7 @@
 * [Lru Cache](other/lru_cache.py)
 * [Magicdiamondpattern](other/magicdiamondpattern.py)
 * [Maximum Subarray](other/maximum_subarray.py)
 * [Maximum Subsequence](other/maximum_subsequence.py)
 * [Nested Brackets](other/nested_brackets.py)
 * [Password Generator](other/password_generator.py)
 * [Scoring Algorithm](other/scoring_algorithm.py)
Expand DownExpand Up@@ -1107,6 +1111,7 @@
 * [Fetch Jobs](web_programming/fetch_jobs.py)
 * [Fetch Quotes](web_programming/fetch_quotes.py)
 * [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
 * [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
 * [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](web_programming/get_imdbtop.py)
 * [Get Top Billioners](web_programming/get_top_billioners.py)
Expand Down

42 changes: 42 additions & 0 deletions
other/maximum_subsequence.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
from collections.abc import Sequence


def max_subsequence_sum(nums: Sequence[int] | None = None) -> int:
 """Return the maximum possible sum amongst all non - empty subsequences.

 Raises:
 ValueError: when nums is empty.

 >>> max_subsequence_sum([1,2,3,4,-2])
 10
 >>> max_subsequence_sum([-2, -3, -1, -4, -6])
 -1
 >>> max_subsequence_sum([])
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 >>> max_subsequence_sum()
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 """
 if nums is None or not nums:
 raise ValueError("Input sequence should not be empty")

 ans = nums[0]
 for i in range(1, len(nums)):
 num = nums[i]
 ans = max(ans, ans + num, num)

 return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 # Try on a sample input from the user
 n = int(input("Enter number of elements : ").strip())
 array = list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
 print(max_subsequence_sum(array))

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Highlight search terms from Google/DuckDuckGo/Bing referrer\n(function() {\n var ref = document.referrer;\n var terms = [];\n \n if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {\n var url = new URL(ref);\n var q = url.searchParams.get('q') || url.searchParams.get('p');\n if (q) {\n terms = q.split(/\\s+/).filter(function(t) { return t.length > 2; });\n }\n }\n \n if (terms.length === 0) return;\n \n var style = document.createElement('style');\n style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';\n document.head.appendChild(style);\n \n function highlight(node) {\n if (node.nodeType === 3) { // text node\n var text = node.textContent;\n var found = false;\n terms.forEach(function(term) {\n var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\') + ')', 'gi');\n if (regex.test(text)) {\n found = true;\n var frag = document.createDocumentFragment();\n var parts = text.split(regex);\n parts.forEach(function(part, i) {\n if (i % 2 === 0) {\n frag.appendChild(document.createTextNode(part));\n } else {\n var span = document.createElement('span');\n span.className = 'userscript-highlight';\n span.textContent = part;\n frag.appendChild(span);\n }\n });\n node.parentNode.replaceChild(frag, node);\n }\n });\n } else if (node.nodeType === 1 && node.childNodes) { // element\n var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];\n if (!skipTags.includes(node.tagName)) {\n Array.from(node.childNodes).forEach(highlight);\n }\n }\n }\n \n highlight(document.body);\n \n // Re-highlight on dynamic content\n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1 || node.nodeType === 3) highlight(node);\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Highlight Search Terms");
}
} catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
Create maximum_subsequence.py#7811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

chriso345
merged 10 commits into

from

May 10, 2023
 Merged


Create maximum_subsequence.py
#7811
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
7fbaa5f

Create maximum_subsequence.py


pronoym99 Oct 28, 2022
6f15749

Update other/maximum_subsequence.py


pronoym99 Nov 1, 2022
2df68a8

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
dedd91c

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
0dcf25e

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
e1db646

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
39bd75d

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
4744d96

Update maximum_subsequence.py


pronoym99 Nov 3, 2022
5cf74a9

updating DIRECTORY.md

Nov 3, 2022
7a9e3b3

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 3, 2022

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


5 changes: 5 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -165,6 +165,7 @@
 * [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
 * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
 * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
 * [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
 * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
 * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
 * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
Expand DownExpand Up@@ -285,6 +286,7 @@
 * [Bitmask](dynamic_programming/bitmask.py)
 * [Catalan Numbers](dynamic_programming/catalan_numbers.py)
 * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
 * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
 * [Edit Distance](dynamic_programming/edit_distance.py)
 * [Factorial](dynamic_programming/factorial.py)
 * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
Expand DownExpand Up@@ -595,6 +597,7 @@
 * [P Series](maths/series/p_series.py)
 * [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
 * [Sigmoid](maths/sigmoid.py)
 * [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
 * [Signum](maths/signum.py)
 * [Simpson Rule](maths/simpson_rule.py)
 * [Sin](maths/sin.py)
Expand DownExpand Up@@ -660,6 +663,7 @@
 * [Lru Cache](other/lru_cache.py)
 * [Magicdiamondpattern](other/magicdiamondpattern.py)
 * [Maximum Subarray](other/maximum_subarray.py)
 * [Maximum Subsequence](other/maximum_subsequence.py)
 * [Nested Brackets](other/nested_brackets.py)
 * [Password Generator](other/password_generator.py)
 * [Scoring Algorithm](other/scoring_algorithm.py)
Expand DownExpand Up@@ -1107,6 +1111,7 @@
 * [Fetch Jobs](web_programming/fetch_jobs.py)
 * [Fetch Quotes](web_programming/fetch_quotes.py)
 * [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
 * [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
 * [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](web_programming/get_imdbtop.py)
 * [Get Top Billioners](web_programming/get_top_billioners.py)
Expand Down

42 changes: 42 additions & 0 deletions
other/maximum_subsequence.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
from collections.abc import Sequence


def max_subsequence_sum(nums: Sequence[int] | None = None) -> int:
 """Return the maximum possible sum amongst all non - empty subsequences.

 Raises:
 ValueError: when nums is empty.

 >>> max_subsequence_sum([1,2,3,4,-2])
 10
 >>> max_subsequence_sum([-2, -3, -1, -4, -6])
 -1
 >>> max_subsequence_sum([])
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 >>> max_subsequence_sum()
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 """
 if nums is None or not nums:
 raise ValueError("Input sequence should not be empty")

 ans = nums[0]
 for i in range(1, len(nums)):
 num = nums[i]
 ans = max(ans, ans + num, num)

 return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 # Try on a sample input from the user
 n = int(input("Enter number of elements : ").strip())
 array = list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
 print(max_subsequence_sum(array))

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Strip utm_, fbclid, gclid, etc. from all links on page\n(function() {\n var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',\n 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',\n 'ref', 'ref_src', 'source', 'medium', 'campaign'];\n \n function cleanUrl(url) {\n try {\n var u = new URL(url, window.location.origin);\n var changed = false;\n trackingParams.forEach(function(p) {\n if (u.searchParams.has(p)) {\n u.searchParams.delete(p);\n changed = true;\n }\n });\n return changed ? u.toString() : url;\n } catch (e) {\n return url;\n }\n }\n \n function cleanLinks() {\n document.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n \n cleanLinks();\n \n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1) {\n if (node.tagName === 'A') cleanLinks();\n node.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Remove Tracking Parameters from Links");
}
} catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); }
})();
(function(){
try {
var __m = "youtube.com";
var __re = new RegExp('^' + "youtube\\.com" + '

Skip to content
Create maximum_subsequence.py#7811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

chriso345
merged 10 commits into

from

May 10, 2023
 Merged


Create maximum_subsequence.py
#7811
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
7fbaa5f

Create maximum_subsequence.py


pronoym99 Oct 28, 2022
6f15749

Update other/maximum_subsequence.py


pronoym99 Nov 1, 2022
2df68a8

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
dedd91c

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
0dcf25e

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
e1db646

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
39bd75d

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
4744d96

Update maximum_subsequence.py


pronoym99 Nov 3, 2022
5cf74a9

updating DIRECTORY.md

Nov 3, 2022
7a9e3b3

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 3, 2022

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


5 changes: 5 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -165,6 +165,7 @@
 * [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
 * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
 * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
 * [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
 * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
 * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
 * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
Expand DownExpand Up@@ -285,6 +286,7 @@
 * [Bitmask](dynamic_programming/bitmask.py)
 * [Catalan Numbers](dynamic_programming/catalan_numbers.py)
 * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
 * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
 * [Edit Distance](dynamic_programming/edit_distance.py)
 * [Factorial](dynamic_programming/factorial.py)
 * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
Expand DownExpand Up@@ -595,6 +597,7 @@
 * [P Series](maths/series/p_series.py)
 * [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
 * [Sigmoid](maths/sigmoid.py)
 * [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
 * [Signum](maths/signum.py)
 * [Simpson Rule](maths/simpson_rule.py)
 * [Sin](maths/sin.py)
Expand DownExpand Up@@ -660,6 +663,7 @@
 * [Lru Cache](other/lru_cache.py)
 * [Magicdiamondpattern](other/magicdiamondpattern.py)
 * [Maximum Subarray](other/maximum_subarray.py)
 * [Maximum Subsequence](other/maximum_subsequence.py)
 * [Nested Brackets](other/nested_brackets.py)
 * [Password Generator](other/password_generator.py)
 * [Scoring Algorithm](other/scoring_algorithm.py)
Expand DownExpand Up@@ -1107,6 +1111,7 @@
 * [Fetch Jobs](web_programming/fetch_jobs.py)
 * [Fetch Quotes](web_programming/fetch_quotes.py)
 * [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
 * [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
 * [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](web_programming/get_imdbtop.py)
 * [Get Top Billioners](web_programming/get_top_billioners.py)
Expand Down

42 changes: 42 additions & 0 deletions
other/maximum_subsequence.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
from collections.abc import Sequence


def max_subsequence_sum(nums: Sequence[int] | None = None) -> int:
 """Return the maximum possible sum amongst all non - empty subsequences.

 Raises:
 ValueError: when nums is empty.

 >>> max_subsequence_sum([1,2,3,4,-2])
 10
 >>> max_subsequence_sum([-2, -3, -1, -4, -6])
 -1
 >>> max_subsequence_sum([])
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 >>> max_subsequence_sum()
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 """
 if nums is None or not nums:
 raise ValueError("Input sequence should not be empty")

 ans = nums[0]
 for i in range(1, len(nums)):
 num = nums[i]
 ans = max(ans, ans + num, num)

 return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 # Try on a sample input from the user
 n = int(input("Enter number of elements : ").strip())
 array = list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
 print(max_subsequence_sum(array))

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default");
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
Create maximum_subsequence.py#7811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

chriso345
merged 10 commits into

from

May 10, 2023
 Merged


Create maximum_subsequence.py
#7811
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
7fbaa5f

Create maximum_subsequence.py


pronoym99 Oct 28, 2022
6f15749

Update other/maximum_subsequence.py


pronoym99 Nov 1, 2022
2df68a8

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
dedd91c

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
0dcf25e

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
e1db646

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
39bd75d

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
4744d96

Update maximum_subsequence.py


pronoym99 Nov 3, 2022
5cf74a9

updating DIRECTORY.md

Nov 3, 2022
7a9e3b3

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 3, 2022

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


5 changes: 5 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -165,6 +165,7 @@
 * [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
 * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
 * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
 * [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
 * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
 * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
 * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
Expand DownExpand Up@@ -285,6 +286,7 @@
 * [Bitmask](dynamic_programming/bitmask.py)
 * [Catalan Numbers](dynamic_programming/catalan_numbers.py)
 * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
 * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
 * [Edit Distance](dynamic_programming/edit_distance.py)
 * [Factorial](dynamic_programming/factorial.py)
 * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
Expand DownExpand Up@@ -595,6 +597,7 @@
 * [P Series](maths/series/p_series.py)
 * [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
 * [Sigmoid](maths/sigmoid.py)
 * [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
 * [Signum](maths/signum.py)
 * [Simpson Rule](maths/simpson_rule.py)
 * [Sin](maths/sin.py)
Expand DownExpand Up@@ -660,6 +663,7 @@
 * [Lru Cache](other/lru_cache.py)
 * [Magicdiamondpattern](other/magicdiamondpattern.py)
 * [Maximum Subarray](other/maximum_subarray.py)
 * [Maximum Subsequence](other/maximum_subsequence.py)
 * [Nested Brackets](other/nested_brackets.py)
 * [Password Generator](other/password_generator.py)
 * [Scoring Algorithm](other/scoring_algorithm.py)
Expand DownExpand Up@@ -1107,6 +1111,7 @@
 * [Fetch Jobs](web_programming/fetch_jobs.py)
 * [Fetch Quotes](web_programming/fetch_quotes.py)
 * [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
 * [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
 * [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](web_programming/get_imdbtop.py)
 * [Get Top Billioners](web_programming/get_top_billioners.py)
Expand Down

42 changes: 42 additions & 0 deletions
other/maximum_subsequence.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
from collections.abc import Sequence


def max_subsequence_sum(nums: Sequence[int] | None = None) -> int:
 """Return the maximum possible sum amongst all non - empty subsequences.

 Raises:
 ValueError: when nums is empty.

 >>> max_subsequence_sum([1,2,3,4,-2])
 10
 >>> max_subsequence_sum([-2, -3, -1, -4, -6])
 -1
 >>> max_subsequence_sum([])
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 >>> max_subsequence_sum()
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 """
 if nums is None or not nums:
 raise ValueError("Input sequence should not be empty")

 ans = nums[0]
 for i in range(1, len(nums)):
 num = nums[i]
 ans = max(ans, ans + num, num)

 return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 # Try on a sample input from the user
 n = int(input("Enter number of elements : ").strip())
 array = list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
 print(max_subsequence_sum(array))

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers");
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
Create maximum_subsequence.py#7811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

chriso345
merged 10 commits into

from

May 10, 2023
 Merged


Create maximum_subsequence.py
#7811
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
7fbaa5f

Create maximum_subsequence.py


pronoym99 Oct 28, 2022
6f15749

Update other/maximum_subsequence.py


pronoym99 Nov 1, 2022
2df68a8

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
dedd91c

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
0dcf25e

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
e1db646

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
39bd75d

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
4744d96

Update maximum_subsequence.py


pronoym99 Nov 3, 2022
5cf74a9

updating DIRECTORY.md

Nov 3, 2022
7a9e3b3

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 3, 2022

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


5 changes: 5 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -165,6 +165,7 @@
 * [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
 * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
 * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
 * [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
 * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
 * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
 * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
Expand DownExpand Up@@ -285,6 +286,7 @@
 * [Bitmask](dynamic_programming/bitmask.py)
 * [Catalan Numbers](dynamic_programming/catalan_numbers.py)
 * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
 * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
 * [Edit Distance](dynamic_programming/edit_distance.py)
 * [Factorial](dynamic_programming/factorial.py)
 * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
Expand DownExpand Up@@ -595,6 +597,7 @@
 * [P Series](maths/series/p_series.py)
 * [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
 * [Sigmoid](maths/sigmoid.py)
 * [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
 * [Signum](maths/signum.py)
 * [Simpson Rule](maths/simpson_rule.py)
 * [Sin](maths/sin.py)
Expand DownExpand Up@@ -660,6 +663,7 @@
 * [Lru Cache](other/lru_cache.py)
 * [Magicdiamondpattern](other/magicdiamondpattern.py)
 * [Maximum Subarray](other/maximum_subarray.py)
 * [Maximum Subsequence](other/maximum_subsequence.py)
 * [Nested Brackets](other/nested_brackets.py)
 * [Password Generator](other/password_generator.py)
 * [Scoring Algorithm](other/scoring_algorithm.py)
Expand DownExpand Up@@ -1107,6 +1111,7 @@
 * [Fetch Jobs](web_programming/fetch_jobs.py)
 * [Fetch Quotes](web_programming/fetch_quotes.py)
 * [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
 * [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
 * [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](web_programming/get_imdbtop.py)
 * [Get Top Billioners](web_programming/get_top_billioners.py)
Expand Down

42 changes: 42 additions & 0 deletions
other/maximum_subsequence.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
from collections.abc import Sequence


def max_subsequence_sum(nums: Sequence[int] | None = None) -> int:
 """Return the maximum possible sum amongst all non - empty subsequences.

 Raises:
 ValueError: when nums is empty.

 >>> max_subsequence_sum([1,2,3,4,-2])
 10
 >>> max_subsequence_sum([-2, -3, -1, -4, -6])
 -1
 >>> max_subsequence_sum([])
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 >>> max_subsequence_sum()
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 """
 if nums is None or not nums:
 raise ValueError("Input sequence should not be empty")

 ans = nums[0]
 for i in range(1, len(nums)):
 num = nums[i]
 ans = max(ans, ans + num, num)

 return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 # Try on a sample input from the user
 n = int(input("Enter number of elements : ").strip())
 array = list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
 print(max_subsequence_sum(array))

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Universal Dark Mode - works on any site\n(function() {\n var enabled = true;\n \n function applyDarkMode() {\n if (!enabled) return;\n \n // Create style element if it doesn't exist\n var style = document.getElementById('universal-dark-mode-style');\n if (!style) {\n style = document.createElement('style');\n style.id = 'universal-dark-mode-style';\n document.head.appendChild(style);\n }\n \n // Dark mode CSS - inverts colors but preserves images/video\n style.textContent = '\n /* Invert everything except media */\n html {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #1a1a2e !important;\n }\n \n /* Restore images, videos, iframes, canvas */\n img, video, iframe, canvas, svg, picture, [style*=\"background-image\"] {\n filter: invert(1) hue-rotate(180deg) !important;\n }\n \n /* Preserve specific elements that should not be inverted */\n .no-dark-mode, .no-dark-mode *,\n [data-theme=\"light\"], [data-theme=\"light\"],\n .ace_editor, .ace_editor *,\n .CodeMirror, .CodeMirror *,\n .monaco-editor, .monaco-editor *,\n .markdown-body pre, .markdown-body pre *,\n .highlight, .highlight *,\n pre code, pre code * {\n filter: none !important;\n }\n \n /* Fix common UI elements */\n .modal, .popup, .dropdown-menu, .tooltip, .popover {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #2d2d44 !important;\n border-color: #444 !important;\n }\n \n /* Scrollbars */\n ::-webkit-scrollbar { background: #1a1a2e !important; }\n ::-webkit-scrollbar-thumb { background: #444 !important; }\n ::-webkit-scrollbar-thumb:hover { background: #555 !important; }\n \n /* Selection */\n ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ';\n }\n \n function removeDarkMode() {\n var style = document.getElementById('universal-dark-mode-style');\n if (style) style.remove();\n }\n \n // Toggle with Alt+Shift+D\n document.addEventListener('keydown', function(e) {\n if (e.altKey && e.shiftKey && e.key === 'D') {\n e.preventDefault();\n enabled = !enabled;\n if (enabled) {\n applyDarkMode();\n console.log('[Universal Dark Mode] Enabled');\n } else {\n removeDarkMode();\n console.log('[Universal Dark Mode] Disabled');\n }\n }\n });\n \n // Apply on load\n applyDarkMode();\n \n // Re-apply on dynamic content\n var observer = new MutationObserver(function(mutations) {\n if (enabled && !document.getElementById('universal-dark-mode-style')) {\n applyDarkMode();\n }\n });\n observer.observe(document.head, { childList: true });\n \n console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');\n})();", "Universal Dark Mode");
}
} catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); }
})();
})();

Skip to content
Create maximum_subsequence.py#7811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

chriso345
merged 10 commits into

from

May 10, 2023
 Merged


Create maximum_subsequence.py
#7811
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


10 commits


Select commit
Hold shift + click to select a range
7fbaa5f

Create maximum_subsequence.py


pronoym99 Oct 28, 2022
6f15749

Update other/maximum_subsequence.py


pronoym99 Nov 1, 2022
2df68a8

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
dedd91c

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
0dcf25e

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
e1db646

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 1, 2022
39bd75d

Update maximum_subsequence.py


pronoym99 Nov 1, 2022
4744d96

Update maximum_subsequence.py


pronoym99 Nov 3, 2022
5cf74a9

updating DIRECTORY.md

Nov 3, 2022
7a9e3b3

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] Nov 3, 2022

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


5 changes: 5 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -165,6 +165,7 @@
 * [Binary Search Tree Recursive](data_structures/binary_tree/binary_search_tree_recursive.py)
 * [Binary Tree Mirror](data_structures/binary_tree/binary_tree_mirror.py)
 * [Binary Tree Node Sum](data_structures/binary_tree/binary_tree_node_sum.py)
 * [Binary Tree Path Sum](data_structures/binary_tree/binary_tree_path_sum.py)
 * [Binary Tree Traversals](data_structures/binary_tree/binary_tree_traversals.py)
 * [Diff Views Of Binary Tree](data_structures/binary_tree/diff_views_of_binary_tree.py)
 * [Fenwick Tree](data_structures/binary_tree/fenwick_tree.py)
Expand DownExpand Up@@ -285,6 +286,7 @@
 * [Bitmask](dynamic_programming/bitmask.py)
 * [Catalan Numbers](dynamic_programming/catalan_numbers.py)
 * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
 * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
 * [Edit Distance](dynamic_programming/edit_distance.py)
 * [Factorial](dynamic_programming/factorial.py)
 * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
Expand DownExpand Up@@ -595,6 +597,7 @@
 * [P Series](maths/series/p_series.py)
 * [Sieve Of Eratosthenes](maths/sieve_of_eratosthenes.py)
 * [Sigmoid](maths/sigmoid.py)
 * [Sigmoid Linear Unit](maths/sigmoid_linear_unit.py)
 * [Signum](maths/signum.py)
 * [Simpson Rule](maths/simpson_rule.py)
 * [Sin](maths/sin.py)
Expand DownExpand Up@@ -660,6 +663,7 @@
 * [Lru Cache](other/lru_cache.py)
 * [Magicdiamondpattern](other/magicdiamondpattern.py)
 * [Maximum Subarray](other/maximum_subarray.py)
 * [Maximum Subsequence](other/maximum_subsequence.py)
 * [Nested Brackets](other/nested_brackets.py)
 * [Password Generator](other/password_generator.py)
 * [Scoring Algorithm](other/scoring_algorithm.py)
Expand DownExpand Up@@ -1107,6 +1111,7 @@
 * [Fetch Jobs](web_programming/fetch_jobs.py)
 * [Fetch Quotes](web_programming/fetch_quotes.py)
 * [Fetch Well Rx Price](web_programming/fetch_well_rx_price.py)
 * [Get Amazon Product Data](web_programming/get_amazon_product_data.py)
 * [Get Imdb Top 250 Movies Csv](web_programming/get_imdb_top_250_movies_csv.py)
 * [Get Imdbtop](web_programming/get_imdbtop.py)
 * [Get Top Billioners](web_programming/get_top_billioners.py)
Expand Down

42 changes: 42 additions & 0 deletions
other/maximum_subsequence.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
from collections.abc import Sequence


def max_subsequence_sum(nums: Sequence[int] | None = None) -> int:
 """Return the maximum possible sum amongst all non - empty subsequences.

 Raises:
 ValueError: when nums is empty.

 >>> max_subsequence_sum([1,2,3,4,-2])
 10
 >>> max_subsequence_sum([-2, -3, -1, -4, -6])
 -1
 >>> max_subsequence_sum([])
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 >>> max_subsequence_sum()
 Traceback (most recent call last):
 . . .
 ValueError: Input sequence should not be empty
 """
 if nums is None or not nums:
 raise ValueError("Input sequence should not be empty")

 ans = nums[0]
 for i in range(1, len(nums)):
 num = nums[i]
 ans = max(ans, ans + num, num)

 return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 # Try on a sample input from the user
 n = int(input("Enter number of elements : ").strip())
 array = list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
 print(max_subsequence_sum(array))