JavaScript coding interview — Strings — Part 5

Strings coding questions and answers

Photo by Tim Mossholder on Unsplash

String Reverse

Reverse Words

Palindrome

Anagram

Isomorphic

Given a sentence, “Hello how are you HELLO”. Find the minimum distance between two words. Given input: hello, you. Output: 1. The input words are case insensitive (levenshteinDistance (s, t))

https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Levenshtein_distance

“Fizz”, “buzz”, “fizzbuzz”

String compression/ string count

Confirm the ending of string