') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ', 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ', 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ', 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); })(); optimized and corrected longest increasing subsequence problem by Arunsiva003 · Pull Request #10725 · TheAlgorithms/Python · GitHub
Skip to content

optimized and corrected longest increasing subsequence problem - #10725

Closed
Arunsiva003 wants to merge 15 commits into
TheAlgorithms:masterfrom
Arunsiva003:optimize
Closed

optimized and corrected longest increasing subsequence problem#10725
Arunsiva003 wants to merge 15 commits into
TheAlgorithms:masterfrom
Arunsiva003:optimize

Conversation

@Arunsiva003

@Arunsiva003Arunsiva003 commented Oct 20, 2023

Copy link
Copy Markdown
Contributor

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
  • Documentation change?

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Python files are placed inside an existing directory.
  • All filenames are in all lowercase characters with no spaces or dashes.
  • All functions and variable names follow Python naming conventions.
  • All function parameters and return values are annotated with Python type hints.
  • All functions have doctests that pass the automated testing.
  • All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
  • If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

Arunsiva003and others added 15 commits October 14, 2023 18:17
@Arunsiva003
earliest deadline first scheduling algo added
76fd929
@pre-commit-ci
[pre-commit.ci] auto fixes from pre-commit.com hooks
4363669
for more information, see https://pre-commit.ci
@Arunsiva003
earliest deadline first scheduling algo added
bbac298
@Arunsiva003
earliest deadline first scheduling algo added 2
4d156e5
@pre-commit-ci
[pre-commit.ci] auto fixes from pre-commit.com hooks
628b1b3
for more information, see https://pre-commit.ci
@Arunsiva003
ceil and floor and bst
9397c73
@pre-commit-ci
[pre-commit.ci] auto fixes from pre-commit.com hooks
31e43db
for more information, see https://pre-commit.ci
@Arunsiva003
ceil and floor and bst 2
22f40d9
@Arunsiva003
ceil and floor and bst 2
1f6eed8
@pre-commit-ci
[pre-commit.ci] auto fixes from pre-commit.com hooks
6238c4a
for more information, see https://pre-commit.ci
@Arunsiva003
ceil and floor and bst 3
f845dd4
@Arunsiva003
Merge branch 'create' ofhttps://github.com/Arunsiva003/Pythoninto c…
f31b31e
…reate
@Arunsiva003
Merge branch 'TheAlgorithms:master' into master
b7b7f3e
@Arunsiva003
Merge branch 'master' ofhttps://github.com/Arunsiva003/Pythoninto c…
242757a
…reate
@Arunsiva003
optimized and corrected longest increasing subsequence problem
21dfa20
@algorithms-keeperalgorithms-keeperBot added enhancement This PR modified some existing files awaiting reviews This PR is ready to be reviewed labels Oct 20, 2023
AasheeshLikePanner
AasheeshLikePanner reviewed Oct 22, 2023
View reviewed changes
Comment threaddata_structures/binary_tree/floor_ceil_in_bst.py
@@ -0,0 +1,82 @@
"""

@AasheeshLikePannerAasheeshLikePannerOct 22, 2023

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Hi, You are also changing this file. Can you create the different pull request for different files.

AasheeshLikePanner
AasheeshLikePanner reviewed Oct 22, 2023
View reviewed changes
Comment threadscheduling/shortest_deadline_first.py
@@ -0,0 +1,70 @@
"""

@AasheeshLikePannerAasheeshLikePannerOct 22, 2023

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Also, For this.

@tianyizheng02

tianyizheng02 commented Oct 22, 2023

Copy link
Copy Markdown
Contributor

Like @AasheeshLikePanner said, you're modifying an existing file as well as contributing multiple files in the same PR. You checked this checkbox, so you did acknowledge this:

  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.

@tianyizheng02tianyizheng02 added the multiple algorithms not allowed Multiple algorithms in a single PR are not allowed label Oct 22, 2023
@Arunsiva003

Arunsiva003 commented Oct 23, 2023

Copy link
Copy Markdown
ContributorAuthor

Like @AasheeshLikePanner said, you're modifying an existing file as well as contributing multiple files in the same PR. You checked this checkbox, so you did acknowledge this:

  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.

I made a new PR...Kindly review it #10830

Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

1 more reviewer
@AasheeshLikePannerAasheeshLikePannerAasheeshLikePanner left review comments
Reviewers whose approvals may not affect merge requirements

Assignees

No one assigned

Labels

awaiting reviewsThis PR is ready to be reviewedenhancementThis PR modified some existing filesmultiple algorithms not allowedMultiple algorithms in a single PR are not allowed

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

3 participants

@Arunsiva003@tianyizheng02@AasheeshLikePanner