Learn how to solve challenging string coding problems and prep for your technical interview.
Write a function that determines if each characters in a String appear no more than once.
Write a function that checks to see if two Strings are anagrams of each other. Hint: an anagram of a word is one that has the same characters in it, but in a different sequence e.g. "listen" and "silent."
The decimal number 585 = 1001001001 (binary) is palindromic in both bases.
Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
Write a function that returns the index of where a substring begins within a given string. Return -1 if it doesn't exist.
Find the longest palindrome substring that exists within a string.
Write a function that finds the first non-repeated character in a String.
Print all permutations of a String iteratively.
Write a method that will remove any given character from a string.
Write a function that reverses a string in place.
Implement a method that checks whether a string is a palindrome or not.