Using Reduce to Count the Array in Javascript
Let’s say, we have an array in Javascript, and we want to group the elements, ount their occurences and store the final results in a key-value dictionary. Input Array: …
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 …
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, …
Javascript’s toFixed Implementation without Rounding
In Javascript, you can use Number.prototype.toFixed(n) that will return a string version that has n decimal places. For example, (3).toFixed(3) // "3.000" (3.15).toFixed(3) // "3.150" The toFixed will round …