Yahoo India Web Search

Search results

1. leetcode.com › problems › minimum-remove-to-make-valid-parenthesesMinimum Remove to Make Valid Parentheses - LeetCode

   leetcode.com › problems › minimum-remove-to-make-valid-parentheses

   Minimum Remove to Make Valid Parentheses - Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string.

2. leetcode.com › problems › minimum-number-of-swaps-to-make-the-string-balancedMinimum Number of Swaps to Make the String Balanced - LeetCode

   leetcode.com › problems › minimum-number-of-swaps-to-make-the-string-balanced

   Can you solve this real interview question? Minimum Number of Swaps to Make the String Balanced - You are given a 0-indexed string s of even length n. The string consists of exactly n / 2 opening brackets '[' and n / 2 closing brackets ']'.

3. leetcode.com › problems › minimum-add-to-make-parentheses-validMinimum Add to Make Parentheses Valid - LeetCode

   leetcode.com › problems › minimum-add-to-make-parentheses-valid

   Minimum Add to Make Parentheses Valid - A parentheses string is valid if and only if: * It is the empty string, * It can be written as AB (A concatenated with B), where A and B are valid strings, or * It can be written as (A), where A is a valid string.

4. leetcode.com › problems › minimum-insertions-to-balance-a-parentheses-stringMinimum Insertions to Balance a Parentheses String - LeetCode

   leetcode.com › problems › minimum-insertions-to-balance-a-parentheses-string

   Minimum Insertions to Balance a Parentheses String - Given a parentheses string s containing only the characters '(' and ')'. A parentheses string is balanced if: * Any left parenthesis '(' must have a corresponding two consecutive right parenthesis '))'.

5. leetcode.com › problems › minimum-reverse-operationsMinimum Reverse Operations - LeetCode

   leetcode.com › problems › minimum-reverse-operations

   Minimum Reverse Operations - You are given an integer n and an integer p representing an array arr of length n where all elements are set to 0's, except position p which is set to 1. You are also given an integer array banned containing restricted positions.

6. leetcode.com › problems › minimum-remove-to-make-valid-parenthesesMinimum Remove to Make Valid Parentheses - LeetCode

   leetcode.com › problems › minimum-remove-to-make-valid-parentheses

   Can you solve this real interview question? Minimum Remove to Make Valid Parentheses - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

7. leetcode.com › problems › reverse-substrings-between-each-pair-of-parenthesesReverse Substrings Between Each Pair of Parentheses - LeetCode

   leetcode.com › problems › reverse-substrings-between-each-pair-of-parentheses

   Reverse Substrings Between Each Pair of Parentheses - You are given a string s that consists of lower case English letters and brackets. Reverse the strings in each pair of matching parentheses, starting from the innermost one. Your result should not contain any brackets.

8. leetcode.com › problems › minimum-edge-reversals-so-every-node-is-reachableMinimum Edge Reversals So Every Node Is Reachable - LeetCode

   leetcode.com › problems › minimum-edge-reversals-so-every-node-is-reachable

   Minimum Edge Reversals So Every Node Is Reachable - There is a simple directed graph with n nodes labeled from 0 to n - 1. The graph would form a tree if its edges were bi-directional. You are given an integer n and a 2D integer array edges, where edges[i] = [ui, vi] represents a directed edge going from node ui to node vi.

9. leetcode.com › problems › minimum-reverse-operationsMinimum Reverse Operations - LeetCode

   leetcode.com › problems › minimum-reverse-operations

   Minimum Reverse Operations - LeetCode. Can you solve this real interview question? Minimum Reverse Operations - Level up your coding skills and quickly land a job.

10. leetcode.com › problems › remove-invalid-parenthesesRemove Invalid Parentheses - LeetCode

    leetcode.com › problems › remove-invalid-parentheses

    Remove Invalid Parentheses - Given a string s that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid. Return a list of unique strings that are valid with the minimum number of removals. You may return the answer in any order.