Easy to understand courses and toy problems for new coders.

Join Two Strings

You are given two strings as arguments. Join the strings and return the result.

Requirements

• Must return a single string

Example #1

solve("ab", "ba")
> "abba"

Example #2

solve("race", "car")
> "racecar"

Longest Common Prefix

You are given an array of lowercase strings as an argument. Return the longest common prefix of all strings.

Requirements

• Must return a string
• Must be able to compare more than two strings

Example #1

solve(["antiquated", "antilope"])
> "anti"

Example #2

solve(["california", "calibrated"])
> "cali"

Example #3

solve(["test","testing","tester"])
> "test"

Longest Palindrome

You are given a single lowercase string as an argument. Return the longest palindrome contained in that string.

Palindromes are strings that form the same word if it is reversed.

Requirements

• Must return a string

Example #1

solve("mammagamma")
> "ammagamma"

Example #2

solve("minimum")
> "minim"