feat: validate-parentheses challenge

Author: IbatoLionDev

1-EASY/Python/11-merge-overlapping-intervals/proposed-solution/__pycache__/intervals.cpython-312.pyc

@@ -0,0 +1,11 @@
+# Challenge: Create a function that, given a string composed of parentheses and possibly other opening and closing symbols, verifies if the sequence is valid (i.e., each open symbol has its corresponding closing symbol in the correct order). Use a stack data structure to solve it.
+
+from parentheses import is_valid_parentheses
+
+def main():
+    test_strings = ["()", "()[]{}", "(]", "([)]", "{[]}"]
+    for s in test_strings:
+        print(f"Is '{s}' valid? {is_valid_parentheses(s)}")
+
+if __name__ == "__main__":
+    main()

…intervals/proposed-solution/intervals.py …intervals/proposed-solution/intervals.py1-EASY/Python/11-merge-overlapping-intervals/proposed-solution/intervals.py renamed to 2-NORMAL/Python/11-merge-overlapping-intervals/proposed-solution/intervals.py 1-EASY/Python/11-merge-overlapping-intervals/proposed-solution/intervals.py renamed to 2-NORMAL/Python/11-merge-overlapping-intervals/proposed-solution/intervals.py

@@ -0,0 +1,15 @@
+def is_valid_parentheses(s):
+    stack = []
+    mapping = {')': '(', ']': '[', '}': '{'}
+
+    for char in s:
+        if char in mapping.values():
+            stack.append(char)
+        elif char in mapping:
+            if not stack or stack.pop() != mapping[char]:
+                return False
+        else:
+            # Ignore other characters
+            continue
+
+    return not stack