Yahoo India Web Search

Sign In

Search results

  1. www.naukri.com › code360 › problemsMinimum Cost To Make String Valid - Naukri Code 360

    Your task is to help Ninja determine the minimum cost to make ‘STR’ valid. For Example: Minimum operations to make ‘STR’ = “{{“ valid is 1. In one operation, we can convert ‘{’ at index ‘1’ (0-based indexing) to ‘}’. The ‘STR’ now becomes "{}" which is a valid string. Note:

  2. leetcode.com › problems › minimum-additions-to-makeMinimum Additions to Make Valid String - LeetCode

    Minimum Additions to Make Valid String - Given a string word to which you can insert letters "a", "b" or "c" anywhere and any number of times, return the minimum number of letters that must be inserted so that word becomes valid.

  3. leetcode.com › problems › minimum-add-to-makeMinimum Add to Make Parentheses Valid - LeetCode

    Can you solve this real interview question? 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. You are given a parentheses string s. In one move, you can insert a parenthesis at any position of the string. * For example, if s = "()))", you can insert an opening parenthesis to be "(()))" or a ...

  4. www.geeksforgeeks.org › minimum-number-ofMinimum number of Parentheses to be added to make it valid

    May 9, 2023 · The task is to find a minimum number of parentheses ‘ (‘ or ‘)’ (at any positions) we must add to make the resulting parentheses string is valid. Examples: Output: 1. One '(' is required at beginning. Input: str = "(((". Output: 3. Three ')' is required at end.

  5. algo.monster › liteproblems › 26452645. Minimum Additions to Make Valid String - In-Depth ...

    In-depth solution and explanation for LeetCode 2645. Minimum Additions to Make Valid String in Python, Java, C++ and more. Intuitions, example walk through, and complexity analysis. Better than official and forum solutions.

  6. leetcode.com › minimum-cost-to-convert-string-iiMinimum Cost to Convert String II - LeetCode

    Minimum Cost to Convert String II - You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English characters. You are also given two 0-indexed string arrays original and changed, and an integer array cost, where cost[i] represents the cost of converting the string original[i] to the string changed[i].

  7. www.geeksforgeeks.org › minimum-cost-construct-stringMinimum cost to construct a string - GeeksforGeeks

    Feb 15, 2024 · Given a string s (containing lowercase letters only), we have to find the minimum cost to construct the given string. The cost can be determined using the following operations: Appending a single character cost 1 unit