Compute the Maximum Score After Splitting a String
Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and right substring). The score after …
A Simple HTML Entity Parser in C++
HTML entity parser is the parser that takes HTML code as input and replace all the entities of the special characters by the characters itself. The special characters and …
Bottom Up Dynamic Algorithm to Compute the Longest Common Subsequence (C++)
Given two strings text1 and text2, return the length of their longest common subsequence. A subsequence of a string is a new string generated from the original string with …
Algorithms to Locate the Leftmost Column with at Least a One in a Binary Matrix
A binary matrix means that all elements are 0 or 1. For each individual row of the matrix, this row is sorted in non-decreasing order. Given a row-sorted binary …
Algorithms to Compute the Bitwise AND of Numbers in a Range
Given a range where 0 <= m <= n <= 2147483647 (32 bit), return the bitwise AND of all numbers in this range, inclusive. Example 1: Input: Output: 4 …
Depth First Search Algoritm to Compute The k-th Lexicographical String of All Happy Strings of Length n
A happy string is a string that: consists only of letters of the set . s != s for all values of i from 1 to s.length – 1 …