Add Double-Ended Queue (Deque) implementation in C++#205
Add Double-Ended Queue (Deque) implementation in C++#205Pradeepsingh61 merged 2 commits intoPradeepsingh61:mainfrom
Conversation
|
🎉 Welcome to Hacktoberfest 2025, @adityamep! 🎃 Thank you for your first contribution to our DSA repository! Here's what happens next: 🔍 Automatic Checks
📋 Next Steps🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon. 🎁 What You Get
💡 Tips for Success
Welcome to the community! 🚀 |
🤖 Automated PR Status🔍 Code Validation✅ Passed - File naming and structure look good! 🧪 Compilation Tests✅ Passed - All code compiles successfully! 📋 Overall Status🎉 Ready for Review - Your PR has passed all automated checks! This comment was generated automatically. Checks will re-run when you push new commits. |
|
🎉 Welcome to Hacktoberfest 2025, @adityamep! 🎃 Thank you for your first contribution to our DSA repository! Here's what happens next: 🔍 Automatic Checks
📋 Next Steps🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon. 🎁 What You Get
💡 Tips for Success
Welcome to the community! 🚀 |
🤖 Automated PR Status🔍 Code Validation✅ Passed - File naming and structure look good! 🧪 Compilation Tests✅ Passed - All code compiles successfully! 📋 Overall Status🎉 Ready for Review - Your PR has passed all automated checks! This comment was generated automatically. Checks will re-run when you push new commits. |
Double-Ended Queue (Deque) Implementation
Added a C++ implementation of a Double-Ended Queue (Deque) inside the
queuesfolder.Features:
insertFront(T value)– Insert element at the front.insertRear(T value)– Insert element at the rear.deleteFront()– Delete element from the front.deleteRear()– Delete element from the rear.getFront()– Get the front element.getRear()– Get the rear element.getSize()– Returns the number of elements.isEmpty()– Checks if the deque is empty.This contribution is part of Hacktoberfest 2025.