# String

## Determine if String Halves Are Alike

You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half.

## One Edit Distance

Given two strings s and t, return true if they are both one edit distance apart, otherwise return false

## Count and Say

The count-and-say sequence is a sequence of digit strings defined by the recursive formula

## Reverse Words in a String

Given an input string s, reverse the order of the words. A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space.

## Minimum Window Substring

Given two strings s and t, return the minimum window in s which will contain all the characters in t. If there is no such window in s that covers all characters in t, return the empty string “”.

## Break a Palindrome

Given a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulting string is not a palindrome

## String to Integer (atoi)

Here we are going to write our own atoi() implementation in Java. Remember in Java you convert a string to an integer using the parseInt method of the Java Integer class. The parseInt method converts the String to an int, and throws a NumberFormatException if the string can’t be converted to an int type.

## Longest Palindromic Substring

Given a string s, return the longest palindromic substring in s.

## Palindrome Permutation

Write an efficient function that checks whether any permutation of an input string is a palindrome. You can assume the input string only contains lowercase letters.

## Isomorphic Strings

Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character but a character may map to itself.