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.

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

[NEW ALGORITHM] Using Two Stacks to Implement a Queue #1788

Closed
2 tasks done
shriyadindi opened this issue Nov 8, 2024 · 1 comment
Closed
2 tasks done

[NEW ALGORITHM] Using Two Stacks to Implement a Queue #1788

shriyadindi opened this issue Nov 8, 2024 · 1 comment

Comments

@shriyadindi
Copy link
Contributor

shriyadindi commented Nov 8, 2024

Issue will be closed if:

  1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
  2. You propose an algorithm that is already present or has been mentioned in a previous issue.
  3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.


Name:

Using Two Stacks to Implement a Queue

About:

  • Implements a queue using two stacks to manage enqueue and dequeue operations efficiently.
  • Ensures elements are enqueued onto the first stack and dequeued from the second, leveraging stack transfer for correct order.
  • Provides an amortized O(1) time complexity for both operations, making it a practical and efficient solution.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1


Assignees:

  • Contributor in GSSoC-ext
  • Want to work on it
@pankaj-bind
Copy link
Member

assigned

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants