logo CodeStepByStep logo


Language/Type: Kotlin recursion string return
Related Links:

Write a recursive function named isSubsequence that accepts two string parameters, and returns if the second string is a subsequence of the first string. A string is a subsequence of another if it contains the same letters in the same order, but not necessary consecutively. You can assume both strings are already lowercased.

Type your Kotlin solution code here:

This is a function exercise. Write a Kotlin function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.

Log In

Need help?

If you do not understand how to solve an exercise or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect tests, etc.), please

Is there a problem? Contact a site administrator.

©, all rights reserved.