Several Algorithms to Compute the Score of Parentheses
Given a balanced parentheses string S, compute the score of the string based on the following rule: () has score 1 AB has score A + B, where A …
Category: c / c++
Two Pointer Algorithm to Find Maximum Two Sum Less Than K
June 30, 2019
algorithms, brute force, c / c++, data structure, Hash Map / Hash Set, python, Two Pointer
1 Comment
Given an array A of integers and integer K, return the maximum S such that there exists i < j with A + A = S and S < …
Algorithm to Delete a Character to Make a Valid Palindrome
Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome. Example 1: Input: “aba” Output: True Example 2: Input: …
The Dynamic Programming Algorithm to Compute the Minimum Falling Path Sum
Given a square array of integers A, we want the minimum sum of a falling path through A. A falling path starts at any element in the first row, …
Algorithm to Count the Minimum Add to Make Parentheses Valid
Given a string S of ‘(‘ and ‘)’ parentheses, we add the minimum number of parentheses ( ‘(‘ or ‘)’, and in any positions ) so that the resulting …