File: root - text - article - 2019 - 12 - minimum-removals-for-valid-parenthesis.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 409 Views, 19242 Search Bots | 74 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 409 Views, 19242 Search Bots | 74 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Uber:
You are given a string of parenthesis. Return the minimum number of parenthesis that would need to be removed in order to make the string valid. "Valid" means that each open parenthesis has a matching closed parenthesis.
Example:
"()())()"
The following input should return 1.
")("
Here's a start:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 409 Views, 19242 Search Bots | 74 Words You are given a string of parenthesis. Return the minimum number of parenthesis that would need to be removed in order to make the string valid. "Valid" means that each open parenthesis has a matching closed parenthesis.
Example:
"()())()"
The following input should return 1.
")("
Here's a start:
def count_invalid_parenthesis(string):
# Fill this in.
print count_invalid_parenthesis("()())()")
# 1
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Design Tic-Tac-Toe
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Daily Interview Problem: Largest BST in a Binary Tree
- CVE-2015-8874 - cPanel EasyApache Vulnerabilities
- Daily Interview Problem: Distribute Bonuses
- How to Play WAV music under DOS?
- Daily Interview Question: Create a Simple Calculator
- YES!!
- [Daily Problem] Longest Palindromic Substring
- Daily Interview Problem: Longest Substring With K Distinct Characters
©2006~2024 SteakOverCooked - 0.00689 Seconds(s) - 7852.062 KB/s - 53 Online
Memory: 516.78 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !