Strings index

C style string
Reverse a c-style string
Replace all spaces in a string with “%20″ in c-style string

atoi() in Java
itoa() in Java
Implementing strcpy
Implementing strcat
Implementing strcmp
Implementing a strstr() / indexOf function


CPP strings
C Strings
Making a String class in cpp
String Class in cpp(Standard cpp strings)

Internal functions in C
Miscellaneous cases with printf



String search algorithms
Karp-Rabin algorithm
Boyer Moore Algorithm
String Searching Algorithm - Knuth Morris Pratt or KMP Algorithm 

Anagrams
 Find anagrams in the array of Strings
 Anagram Checker–To check if 2 strings are anagrams
Anagram Trees : Part 2

Misc
Determine if a string has all unique characters

Print letters followed by their frequency (Run Length Encoding)

Eliminate the pairs (two same chars adjacent to each other) in string
Move the Spaces to Front of the String

Given a dictionary of word - Group all words into set of anagrams of each other
Find the smallest window in a string containing all characters of another string
Check if 2 strings are rotated versions of each other
Escape all % characters in a string; % is the escape character
Remove whitespace from a string in-place, in linear time
First non repeating element in the array

Combination of all the possible characters in the string
Concatenate N strings with good optimization
Some Stack Question
Reverse a String using bits

Find first occurrence of a string in another
Find the smallest window in a string containing all characters of another string
Squeeze all multiple spaces in a string into one space
To find the longest substring with unique characters in a given string
Reverse the words in a sentence in place
Check if singly linked list is Palindrome
Compare two string literals
Permutation of string in java (efficient)
Secure permutations with block ciphers
Longest common substring revisited

Reducing the space for LCS lengths
Hirschberg’s linear space algorithm in C++
Hirschberg's algorithm
Dynamic Programming Algorithm (DPA) for Edit-Distance
Longest common substring problem
Longest common subsequence : Dynamic programming
String matching
Given a string s1 and a string s2, write a snippet to say whether s2 is a rotation of s1 using only one call to strstr routine? (eg given s1 = ABCD and s2 = CDAB, return true, given s1 = ABCD, and s2 = ACBD , return false)
To check whether string is pallindrome
Given two strings A and B, how would you find out if the characters in B were a subset of the characters in A?
Devise an algorithm for detecting whether a given string is a palindrome