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

Related Articles

  1. Binary Tree Level with Minimum Sum
  2. Daily Interview Problem: Min Range Needed to Sort
  3. 56 Bytes
  4. Skip the readings, focus on problems. And use all the hints!
  5. First and Last Indices of an Element in a Sorted Array
  6. Algorithm Interview: Shifted String
  7. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  8. Daily Interview Problem: Largest BST in a Binary Tree
  9. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  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" />