') + ')', '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); } })(); })(); stack_using_two_queues by IndranjanaChatterjee · Pull Request #10002 · TheAlgorithms/Python · GitHub
Skip to content

stack_using_two_queues - #10002

Closed
IndranjanaChatterjee wants to merge 2 commits into
TheAlgorithms:masterfrom
IndranjanaChatterjee:stack_with_two_queues
Closed

stack_using_two_queues#10002
IndranjanaChatterjee wants to merge 2 commits into
TheAlgorithms:masterfrom
IndranjanaChatterjee:stack_with_two_queues

Conversation

@IndranjanaChatterjee

Copy link
Copy Markdown

Describe your change:

Added the code for the implementation of stack using two queues

Fixes:#9987

  • Add an algorithm?

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".

@algorithms-keeperalgorithms-keeperBot added the awaiting reviews This PR is ready to be reviewed label Oct 7, 2023
@algorithms-keeperalgorithms-keeperBot added tests are failing Do not merge until tests pass and removed tests are failing Do not merge until tests pass labels Oct 7, 2023

@cclausscclauss left a comment

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

Looks cool...

Comment on lines +5 to +8
""" Implementing stack using two arrays"""


class Stack(Generic[T]): # Stack class to implement stack operations

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

Suggested change
""" Implementing stack using two arrays"""
classStack(Generic[T]): # Stack class to implement stack operations
classStack(Generic[T]):
""" Implement a stack using two queues"""

class Stack(Generic[T]): # Stack class to implement stack operations
def __init__(self) -> None:
self.insert_queue = deque() # First Queue to be used for inserting
self.suffle_queue = deque() # Second Queue to be used for suffling

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

suffling is not a word.

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

OPTIONAL: Should Stack be a dataclass?

self.suffle_queue = deque() # Second Queue to be used for suffling

def push(self, item: int) -> None:
self.insert_queue.append(item) # Add items into the Queue

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

The code already says what the comment repeats.

Suggested change
self.insert_queue.append(item)# Add items into the Queue
self.insert_queue.append(item)

Comment on lines +16 to +18
self.insert_queue.append(
self.suffle_queue.popleft()
) # Popping the elements

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

Let's not wrap lines just to make room for a comment.

Suggested change
self.insert_queue.append(
self.suffle_queue.popleft()
) # Popping the elements
# Popping the elements
self.insert_queue.append(self.suffle_queue.popleft())

self.insert_queue, self.suffle_queue = self.suffle_queue, self.insert_queue

def pop(self) -> int:
if not (self.suffle_queue): # if the stack is empty

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

Suggested change
ifnot(self.suffle_queue): # if the stack is empty
ifnotself.suffle_queue: # if the stack is empty

Comment on lines +32 to +36
def printing(self) -> None:
print(self.suffle_queue)

def size(self) -> int:
return len(self.suffle_queue)

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

These magic methods will allow us to just print(stack) and len(stack).

Suggested change
defprinting(self) ->None:
print(self.suffle_queue)
defsize(self) ->int:
returnlen(self.suffle_queue)
def__str__(self) ->str:
returntuple(self.suffle_queue)
def__len__(self) ->int:
returnlen(self.suffle_queue)



def test_stack() -> None:
s = Stack() # Creating a stack in S

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

Single-letter variable names makes code look like it was written in the 1970's.

Suggested change
s=Stack() # Creating a stack in S
stack=Stack() # Create a empty stack

@algorithms-keeperalgorithms-keeperBot added awaiting changes A maintainer has requested changes to this PR and removed awaiting reviews This PR is ready to be reviewed labels Oct 8, 2023
@OneSouhardyoOneSouhardyo mentioned this pull request Oct 8, 2023
14 tasks
@IndranjanaChatterjeeIndranjanaChatterjee mentioned this pull request Oct 8, 2023
12 tasks
@IndranjanaChatterjee

Copy link
Copy Markdown
Author

@cclauss I have tried to make the required changes in the PR #10109 . Please review. Apologies for the inconveniences caused.

@cclauss

Copy link
Copy Markdown
Member

Fixed in data_structures/stacks/stack_using_two_queues.py

@cclausscclauss closed this Oct 15, 2023
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

awaiting changesA maintainer has requested changes to this PR

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@IndranjanaChatterjee@cclauss