# LeetCode 232. Implement Queue using Stacks

Description https://leetcode.com/problems/implement-queue-using-stacks/ Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all…

Be a Good Techer and Tech for Good. www.goodtecher.com

Description https://leetcode.com/problems/implement-queue-using-stacks/ Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all…

Description https://leetcode.com/problems/implement-queue-using-stacks/ Implement a last in first out (LIFO) stack using only two queues. The implemented stack should support all…

Description https://leetcode.com/problems/decode-string/ Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is…

Description https://leetcode.com/problems/maximum-frequency-stack/ Implement FreqStack, a class which simulates the operation of a stack-like data structure. FreqStack has two functions: push(int x), which…

Description https://leetcode.com/problems/valid-parenthesis-string/ Given a string containing only three types of characters: ‘(‘, ‘)’ and ‘*’, write a function to check…

Description https://leetcode.com/problems/missing-number/ Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from…

Description https://leetcode.com/problems/backspace-string-compare/ Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character. Example…

Description https://leetcode.com/problems/largest-rectangle-in-histogram/description/ Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area…

Description Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) — Push…

Description https://leetcode.com/problems/valid-parentheses/ Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid. An input string is valid…