DSA-in-December

✨ 𝗗𝗮𝘆 𝟭𝟬: 𝗦𝘁𝗮𝗰𝗸𝘀 & 𝗤𝘂𝗲𝘂𝗲𝘀✨

📌 A Stack is a linear data structure that follows the LIFO (Last-In-First-Out) principle. Stack has one end, whereas the Queue has two ends (front and rear). It contains only one pointer top pointer pointing to the topmost element of the stack. Whenever an element is added in the stack, it is added on the top of the stack, and the element can be deleted only from the stack. In other words, a stack can be defined as a container in which insertion and deletion can be done from the one end known as the top of the stack.

📌 A queue is a useful data structure in programming. It is similar to the ticket queue outside a cinema hall, where the first person entering the queue is the first person who gets the ticket.Queue follows the First In First Out (FIFO) rule - the item that goes in first is the item that comes out first.

✏️ 𝗙𝗼𝗿 𝗯𝗲𝘁𝘁𝗲𝗿 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱𝗶𝗻𝗴 𝗿𝗲𝗳𝗲𝗿 𝗳𝗼𝗹𝗹𝗼𝘄𝗶𝗻𝗴 𝗮𝗿𝘁𝗶𝗰𝗹𝗲𝘀 ;

1. https://www.geeksforgeeks.org/stack-in-cpp-stl/
2. https://www.programiz.com/cpp-programming/stack
3. https://www.javatpoint.com/java-stack
4. https://www.geeksforgeeks.org/stack-in-python/
5. https://www.geeksforgeeks.org/queue-cpp-stl/
6. https://www.javatpoint.com/cpp-queue
7. https://www.javatpoint.com/java-priorityqueue
8. https://www.geeksforgeeks.org/queue-in-python/

📽️ 𝗧𝘂𝘁𝗼𝗿𝗶𝗮𝗹 𝗟𝗶𝗻𝗸𝘀;

1. https://youtu.be/GYptUgnIM_I
2. https://youtu.be/P1bAPZg5uaE
3. https://youtu.be/JvuaAgDar1c
4. https://youtu.be/fbonDkYsKj0
5. https://youtu.be/UbAEP7P0vfk
6. https://youtu.be/W7uB9-TKfTg

👨‍💻 𝗤𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱: 👇

1. https://leetcode.com/problems/valid-parentheses/
2. https://www.hackerrank.com/challenges/equal-stacks/problem?isFullScreen=true
3. https://leetcode.com/problems/implement-queue-using-stacks/
4. https://leetcode.com/problems/first-unique-character-in-a-string/