Add solution for problem 2116: Check if a Parantheses String Can Be Valid and update README

Author: MonitSharma

2116-check-if-a-parantheses-string-can-be-valid/solution.py

@@ -0,0 +1,25 @@
+class Solution:
+  def canBeValid(self, s: str, locked: str) -> bool:
+    if len(s) % 2 == 1:
+      return False
+
+    def check(s: str, locked: str, isForward: bool) -> bool:
+      changeable = 0
+      l = 0
+      r = 0
+
+      for c, lock in zip(s, locked):
+        if lock == '0':
+          changeable += 1
+        elif c == '(':
+          l += 1
+        else:  # c == ')'
+          r += 1
+        if isForward and changeable + l - r < 0:
+          return False
+        if not isForward and changeable + r - l < 0:
+          return False
+
+      return True
+
+    return check(s, locked, True) and check(s[::-1], locked[::-1], False)

README.md

@@ -200,6 +200,7 @@ You can explore the solutions in the table below. Each row includes:
 | 2050 | Parallel Courses III | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-2050-parallel-courses-iii-87d84ef83437) |
 | 2090 | K Radius Subarray Averages | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-2090-k-radius-subarray-averages-756dd59ce83) |
 | 2101 | Detonate the Maximum Bombs | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-2101-detonate-the-maximum-bombs-e1cc142d238d) |
+| 2116 | Check if a Parantheses String Can Be a Valid | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-2101-detonate-the-maximum-bombs-e1cc142d238d) |
 | 2130 | Maximum Twin sum of a Linked List | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-2130-maximum-twin-sum-of-a-linked-list-d7d4fd9fccde) |
 | 2140 | Solving Questions with Brainpower | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-2140-solving-questions-with-brainpower-4dfa9a0418a4) |
 | 2141 | Maximum Running time for N Computers | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-2141-maximum-running-time-of-n-computers-b7f8a94989be) |