How to Compute the Min Cost of Climbing Stairs via Dynamic Programming Algorithm?
On a staircase, the i-th step has some non-negative cost cost assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. You need …
Category: c / c++
The Beginners’ Guide to Trie: How to Use the Trie in C++?
The Trie is common used data structure to speed up the word searching. The Trie is a structure to index the words character by character. Trie Definition in C++ …
The Algorithm to Make Words Bold in HTML
Given a set of keywords words and a string S, make all appearances of all keywords in S bold. Any letters between and tags become bold. The returned string …
The O(N) Increasing Triplet Subsequence Algorithm
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true if there exists i, j, …
How to Compute the Greatest Common Divisor of Strings?
For strings S and T, we say “T divides S” if and only if S = T + … + T (T concatenated with itself 1 or more times) …