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 | 678 Views, 18691 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 | 678 Views, 18691 Search Bots | 99 Words Subscribe to Feed Burner

Related Articles

  1. ImageMagick Vulnerabilities -  CVE-2016–3714
  2. Detect Linked List Cycle
  3. Daily Interview Problem: Room scheduling
  4. Spreadsheet Column Title
  5. Algorithm Interview: Permutations of numbers
  6. Sort a Partially Sorted List
  7. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  8. Algorithm Interview: Subarray With Target Sum
  9. Daily Interview Problem: 3 Sum
  10. Kaprekar

Comments (0)

    Be the first one to comment this page !


Page Edited: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />