Reset Stack exercise files

exercises/tdd_stack/stack.mjs

@@ -3,5 +3,5 @@
  * the LIFO (Last In, First Out) principle.
  */
 class Stack {
-
+    
 }

exercises/tdd_stack/test/ignore/stack_solution.test.mjs

@@ -0,0 +1,28 @@
+import Stack from "../stack.mjs"
+import { expect } from "chai"
+
+describe("Stack", function () {
+    //Satisfy these tests in order
+    it("is initially empty", function () {
+        const stack = new Stack();
+        expect(stack.top).to.equal(-1);
+    });
+
+    it("pushes to the top", function () {
+        const stack = new Stack();
+        stack.push(5);
+        expect(stack.top).to.equal(5);
+        stack.push("test");
+        expect(stack.top).to.equal("test");
+    });
+
+    it("pops from the top", function () {
+        const stack = new Stack();
+        stack.push(5);
+        stack.push("test");
+        let top = stack.pop();
+        expect(top).to.equal("test")
+    });
+
+
+})

exercises/tdd_stack/test/stack.test.mjs

@@ -2,27 +2,17 @@ import Stack from "../stack.mjs"
 import { expect } from "chai"
 
 describe("Stack", function () {
+
     //Satisfy these tests in order
     it("is initially empty", function () {
-        const stack = new Stack();
-        expect(stack.top).to.equal(-1);
+
     });
 
     it("pushes to the top", function () {
-        const stack = new Stack();
-        stack.push(5);
-        expect(stack.top).to.equal(5);
-        stack.push("test");
-        expect(stack.top).to.equal("test");
+
     });
 
     it("pops from the top", function () {
-        const stack = new Stack();
-        stack.push(5);
-        stack.push("test");
-        let top = stack.pop();
-        expect(top).to.equal("test")
+
     });
-
-
 })