Merge branch 'master' of git.anthonycicchetti.com:anthonycicc/exercism

kotlin/bracket-push/src/main/kotlin/BracketPush.kt

@@ -1,7 +1,9 @@
+import java.util.Stack
+
 class BracketPush {
     companion object {
         fun isValid(inpString: String): Boolean{
-            val stack = mutableListOf<Char>()
+            val stack = Stack<Char>()
             val realString = inpString.filter {
                 (it == '{') or
                 (it == '[') or
@@ -10,13 +12,11 @@ class BracketPush {
                 (it == ']') or
                 (it == '}') }
             for (i in realString){
-                if ((i == '{') or
-                        (i == '[') or
-                        (i == '(')){
-                    stack.add(0, i)
+                if ((i == '{') or (i == '[') or (i == '(')){
+                    stack.push(i)
                 }
                 else {
-                    val temp = if (stack.size == 0) {'a'} else {stack.removeAt(0)}
+                    val temp = if (stack.size == 0) {'a'} else {stack.pop()}
                     when (temp){
                         '(' -> if (i != ')') return false
                         '{' -> if (i != '}') return false

kotlin/bracket-push/src/test/kotlin/BracketPushTest.kt

@@ -23,6 +23,7 @@ class BracketPushTest(val input: String, val expectedOutput: Boolean) {
                 arrayOf("([{])", false),
                 arrayOf("[({]})", false),
                 arrayOf("(((185 + 223.85) * 15) - 543)/2", true),
+                arrayOf("b(())[]", true),
                 arrayOf("\\\\left(\\\\begin{array}{cc} \\\\frac{1}{3} & x\\\\\\\\ \\\\mathrm{e}^{x} &... x^2 \\\\end{array}\\\\right)", true)
         )
     }

kotlin/change/notes.txt

@@ -0,0 +1,21 @@
+Anthony Cicchetti
+,
+3 mins
+,
+Edited,
+build up a group of "smallest required for x cost"
+in this case, your map would look like
+please hold
+
+Anthony Cicchetti
+,
+Now
+,
+Edited,
+cost | coins
+1      | 1
+2      | 1 + cost(1)
+3      | 1 + cost(2) OR 3 (we pick 3)
+4      | 1 + cost(3) OR 4 (we pick 4)
+5      | 1 + cost(4) OR 3 + cost(2) OR 4 + cost(1) (we pick the last or the first)
+6      | 1 + cost(5) OR 3 + cost(3) OR 4 + cost(2) (we pick 3 + cost(3), because that's fewer coins than the other options)