We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The question actually contains two parts. One is to practice how to use dynamic casting, the other is to practice the algorithm of how to find the longest common sequence of two strings. Search online for the longest common sequence algorithm and understand the underlying method, and you could solve this challenge!
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Magic Spells
You are viewing a single comment's thread. Return to all comments →
The question actually contains two parts. One is to practice how to use dynamic casting, the other is to practice the algorithm of how to find the longest common sequence of two strings. Search online for the longest common sequence algorithm and understand the underlying method, and you could solve this challenge!