To the Top
File:  root - text - article - 2020 - 02 - fix-brackets.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 764 Views, 21078 Search Bots | 99 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Twitter:

Given a string with only ( and ), find the minimum number of characters to add or subtract to fix the string such that the brackets are balanced.

Example:
Input: '(()()'
Output: 1
Explanation:

The fixed string could either be ()() by deleting the first bracket, or (()()) by adding a bracket. These are not the only ways of fixing the string, there are many other ways by adding it in different positions!


Here's some code to start with:

def fix_brackets(s):
# Fill this in.

print fix_brackets('(()()')
# 1
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 764 Views, 21078 Search Bots | 99 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  2. Floor and Ceiling of a Binary Search Tree
  3. Daily Interview Problem: Find the Number of Islands
  4. Batch Programming in XP
  5. Skip the readings, focus on problems. And use all the hints!
  6. Consecutive Ones
  7. Fix Brackets
  8. Algorithm Interview: Determine If Linked List is Palindrome
  9. A trick for getting good at coding interviews FASTER
  10. Daily Interview Problem: Arithmetic Binary Tree

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />