Valid Parenthesis String: coding question

Problem

You get a string s that contains only the characters (, ) and *. Return true if s is valid. Otherwise, return false.

A string is balanced when each ( has a matching ) after it, and each ) has a matching ( before it. An empty string is balanced.

Each * can be a (, a ) or an empty string. The string s is valid if some choice for each * makes s balanced.

Input:: s = ")*("
Output:: false
Explanation:: The first character is ), and no ( comes before it. No choice for the * can fix this.

SysRound wrote this statement. A reference solution checks every example.

Continue with questions that share topics or the same question type.

Longest Valid Parentheses
Coding · Bracket Sequences · Dynamic Programming · Stack
Minimum Add to Make Parentheses Valid
Coding · Bracket Sequences · Greedy · Stack
Minimum Insertions to Balance a Parentheses String
Coding · Bracket Sequences · Greedy · Stack
Maximum Nesting Depth of Two Valid Parentheses Strings
Coding · Bracket Sequences · Stack · String

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

LeetCode company tags · 2 records

Problem

You get a string s that contains only the characters (, ) and *. Return true if s is valid. Otherwise, return false.

A string is balanced when each ( has a matching ) after it, and each ) has a matching ( before it. An empty string is balanced.

Each * can be a (, a ) or an empty string. The string s is valid if some choice for each * makes s balanced.

Input:: s = ")*("
Output:: false
Explanation:: The first character is ), and no ( comes before it. No choice for the * can fix this.

SysRound wrote this statement. A reference solution checks every example.