Common Child, is a HackerRank problem from String Manipulation subdomain. In this post we will see how we can solve this challenge in C++

Problem Description

A string is said to be a child of a another string if it can be formed by deleting 0 or more characters from the other string. Given two strings of equal length, what's the longest string that can be ....

You can find the full details of the problem Common Child at HackerRank

Solution: Please check the solution.cpp snippet for the solution.

Solution originally posted at: Github by @marinskiy