added challenge 10

Author: Steven Landau

challenge_10/README.md

@@ -0,0 +1,30 @@
+Valid Closers
+=======
+Idea
+----
+This problem is a classic. Given a string that contains various amounts of { [ or (, your job is to determine if each of these are closed successfully. Every { must have a }, every [ must have a ], and every ( must have a ). Any characters can appear between any of these. If the string does have valid closers, the program should return True, otherwise it should return false.
+
+Your solution should use a maximum of O(N) space and run in O(N) time (max).
+
+What is the best data structure for this problem?
+
+Please make your program so that it takes input from standard input. System.in for you java folks and input() for you pythonistas.
+Testing
+------
+Instead of describing each test case, I'm just going to list them out here since I'm sure you can imagine what they might be.
+
+{{{{{{{{{adfkjaefia}}}}}}} should return False
+
+{{{{{{{{{[[[[[[kadfa{{{{{{{((({daljfdaf({{{[]}}kaldjfs})})))}}}}}}}]]]]]]}kjfela}}}}}}}} Should return True
+
+{{{[}}}}dafda Should return False
+
+{{{{{{{{{}}}}}}}}} Should return True
+
+[[[[[[[[[kafjalfeianfailfeja;fjai;efa;sfj]]]]]]]]]kjajdain Should return True
+
+< blank > should return True
+
+((((((fjdalfeja((((alefjalisj(())))))))))))d Should return True
+
+)))(((d Should return False

challenge_10/python/slandau3/closers.py

@@ -0,0 +1,35 @@
+#!/usr/bin/env python3
+# @author slandau3
+
+
+def valid_closers(string_with_brackets_in_it_or_maybe_not_idk_i_coudnt_think_of_a_name: str) -> bool:
+    stack = [] # initialize an empty list (which can easily be used as a stack in python)
+
+    closers = [']', ')', '}']
+    openers = ['{', '(', '[']
+    for char in string_with_brackets_in_it_or_maybe_not_idk_i_coudnt_think_of_a_name:
+        if len(stack) == 0 and char in closers:
+            # This if statement will return false if there is no open bracket to match the closing bracket.
+            # More specifically it returns false if the list is null and we have recieved a closer
+            return False
+
+        if char in openers:
+            stack.append(char)
+
+        elif char == '}':
+            if stack.pop() != '{':
+                return False
+
+        elif char == ']':
+            if stack.pop() != '[':
+                return False
+
+        elif char == ')':
+            if stack.pop() != '(':
+                return False
+
+    return True if len(stack) == 0 else False
+
+
+if __name__ == '__main__':
+    print(valid_closers('{{{{{{{{{[[[[[[kadfa{{{{{{{((({daljfdaf({{{[]}}kaldjfs})})))}}}}}}}]]]]]]}kjfela}}}}}}}}'))

challenge_10/python/slandau3/tests.py

@@ -0,0 +1,50 @@
+#!/usr/bin/env python3
+# @author slandau3
+
+import unittest
+
+from closers import valid_closers
+
+class Test(unittest.TestCase):
+
+    def test1(self):
+        self.assertEqual(valid_closers('{{{{{{{{{adfkjaefia}}}}}}}'), False)
+
+    def test2(self):
+        self.assertEqual(valid_closers('{{{{{{{{{[[[[[[kadfa{{{{{{{((({daljfdaf({{{[]}}kaldjfs})})))}}}}}}}]]]]]]}kjfela}}}}}}}}'), True)
+
+    def test3(self):
+        self.assertEqual(valid_closers('{{{[}}}}dafda'), False)
+
+    def test4(self):
+        self.assertEqual(valid_closers('{{{{{{{{{}}}}}}}}}'), True)
+
+    def test5(self):
+        self.assertEqual(valid_closers('[[[[[[[[[kafjalfeianfailfeja;fjai;efa;sfj]]]]]]]]]kjajdain'), True)
+
+    def test6(self):
+        self.assertEqual(valid_closers(''), True)
+
+    def test7(self):
+        self.assertEqual(valid_closers('((((((fjdalfeja((((alefjalisj(())))))))))))d'), True)
+
+    def test8(self):
+        self.assertEqual(valid_closers(')))(((d'), False)
+
+
+def quickie(): # quick function I wrote to generate correct strings
+    a = input()
+    output = ""
+    for char in a:
+        if char == '{':
+            output = '}' + output
+        elif char == '(':
+            output = ')' + output
+        elif char == '[':
+            output = ']' + output
+
+    print(a + output)
+
+
+if __name__ == '__main__':
+    unittest.main()

challenge_10/tests/test1

@@ -0,0 +1 @@
+{{{}}}

challenge_10/tests/test2

@@ -0,0 +1 @@
+{{[[((ajfdafje))3jkad]jd]da}d}

challenge_10/tests/test3

@@ -0,0 +1 @@
+[]

challenge_10/tests/test4

@@ -0,0 +1 @@
+()

challenge_10/tests/test5

@@ -0,0 +1 @@
+dajkf[afda]dafdsa