To show one string is equal to another string is to compare and match them character by character. What happens if we allow both the strings to be of infinite length? Will this comparing method work?
What is the algorithm to find the characters that are present in a string but not in another one? (Dynamic Programming)