✅ Two-Stack Enqueue and Dequeue (Lazy Transfer) #1553
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
@pankaj-bind @can you review this PR, and add proper labels to it |
pankaj-bind
approved these changes
Nov 2, 2024
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
✅ Fixes: #1498
Summary:
This PR provides, A complete C implementation of a queue using two stacks with detailed documentation explaining the approach and complexity. Also a flowchart showing the operation logic
The lazy transfer strategy means we only move elements from the input stack to the output stack when necessary, which is more efficient than transferring on every operation.
@pankaj-bind can you review this PR, and assign this issue to me with proper labels