Skip to content
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

Fix #12510 #12517

Merged
merged 8 commits into from
Jan 12, 2025
Merged

Fix #12510 #12517

Changes from 1 commit
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
74e269b
Fix #12510
XenoBytesX Jan 12, 2025
dd3c159
Added the doctest mentioned in the issue
XenoBytesX Jan 12, 2025
8cb965f
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Jan 12, 2025
40910bf
Fixed Grammer Mistake
XenoBytesX Jan 12, 2025
aebba8c
Update longest_increasing_subsequence.py
MaximSmolskiy Jan 12, 2025
1a73d2d
Update longest_increasing_subsequence.py
MaximSmolskiy Jan 12, 2025
f0447ce
Update longest_increasing_subsequence.py
MaximSmolskiy Jan 12, 2025
444220d
Update longest_increasing_subsequence.py
MaximSmolskiy Jan 12, 2025
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
Prev Previous commit
Next Next commit
Update longest_increasing_subsequence.py
  • Loading branch information
@MaximSmolskiy
MaximSmolskiy authored Jan 12, 2025
commit f0447ce660fac9a35025c5190f3fd83a1197ee88
2 changes: 0 additions & 2 deletions dynamic_programming/longest_increasing_subsequence.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -32,8 +32,6 @@ def longest_subsequence(array: list[int]) -> list[int]: # This function is recu
[1, 1, 1]
>>> longest_subsequence([])
[]
>>> longest_subsequence([28, 26, 12, 23, 35, 39])
[12, 23, 35, 39]
"""
array_length = len(array)
# If the array contains only one element, we return it (it's the stop condition of
Expand Down