DEV Community

Abhishek Chaudhary
Abhishek Chaudhary

Posted on

1 1

Score of Parentheses

Given a balanced parentheses string s, return the score of the string.

The score of a balanced parentheses string is based on the following rule:

  • "()" has score 1.
  • AB has score A + B, where A and B are balanced parentheses strings.
  • (A) has score 2 * A, where A is a balanced parentheses string.

Example 1:

Input: s = "()"
Output: 1

Example 2:

Input: s = "(())"
Output: 2

Example 3:

Input: s = "()()"
Output: 2

Constraints:

  • 2 <= s.length <= 50
  • s consists of only '(' and ')'.
  • s is a balanced parentheses string.

SOLUTION:

class Solution:
    def scoreOfParentheses(self, s: str) -> int:
        if s == '':
            return 0.5
        score = 0
        pos = [0]
        ctr = 0
        for i, c in enumerate(s):
            if c == '(':
                ctr += 1
            else:
                ctr -= 1
            if ctr == 0:
                pos.append(i + 1)
        n = len(pos)
        for i in range(n - 1):
            score += 2 * self.scoreOfParentheses(s[pos[i] + 1 : pos[i + 1] - 1])
        return int(score)
Enter fullscreen mode Exit fullscreen mode

Image of Datadog

The Essential Toolkit for Front-end Developers

Take a user-centric approach to front-end monitoring that evolves alongside increasingly complex frameworks and single-page applications.

Get The Kit

Top comments (0)

A Workflow Copilot. Tailored to You.

Pieces.app image

Our desktop app, with its intelligent copilot, streamlines coding by generating snippets, extracting code from screenshots, and accelerating problem-solving.

Read the docs

👋 Kindness is contagious

Please leave a ❤️ or a friendly comment on this post if you found it helpful!

Okay