LEETCODE 2022 Added solution for implement-stack-using-queues

src/leetcode/design.md

@@ -1 +1,38 @@
-# Design
+# Design
+
++ [Implement Stack using Queues](#implement-stack-using-queues)
+
+## Implement Stack using Queues
+https://leetcode.com/problems/implement-stack-using-queues/
+```java
+class MyStack {
+    Queue<Integer> q1 = new LinkedList<>();
+    Queue<Integer> q2 = new LinkedList<>();
+    public void push(int x) {
+
+        while(!q1.isEmpty()){
+            q2.add(q1.remove());
+        }
+
+        q1.add(x);
+
+        while(!q2.isEmpty()){
+            q1.add(q2.remove());
+        }
+
+    }
+
+    public int pop() {
+        return q1.remove();
+    }
+
+    public int top() {
+        return q1.element();
+    }
+
+    public boolean empty() {
+        return q1.isEmpty();
+    }
+}
+
+```