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

Related Articles

  1. Kaprekar
  2. Making a Height Balanced Binary Search Tree
  3. Consecutive Ones
  4. Daily Interview Problem: Trapping Rainwater
  5. Daily Interview Problem: Longest Substring With K Distinct Characters
  6. Non-decreasing Array with Single Modification
  7. Two-Sum
  8. Algorithm Interview: Level Order Traversal of Binary Tree
  9. Algorithm Interview: Subarray With Target Sum
  10. Batch Programming in XP

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="index, follow">