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 …
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 …
WXT pre-sale is now live – is it worth it?
According to here, you can now buy WXT if your are registered with Wirex (Free Registeration). The WXT (from WirexApp) is distributed on a first-come-first-serve basis at a fixed …
How to Serialize and Deserialize Binary Tree?
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or …