This section includes some of the basic programming problems involving arrays.
Implement Queue using Stack Data Structure
Queues are a fundamental data structure that follow the First-In-First-Out FIFO principle. This principle is exactly opposite of Last-In-First-Out LIFO principle on which Stack data structure is based on. While queues can be implemented
Check if a given string has balanced Parenthesis
Balanced parentheses refer to the proper and consistent use of opening and closing parentheses, brackets, and curly braces in a piece of code or text. A set of parentheses, brackets, or curly braces is considered balanced if the opening
TODO:
- Post fix evaluation