Find minimum edit distance between two strings
This can be solved using Levenshtein distance. The solution below uses a temp matrix [0...n][0...m]. This is usually not a good approach for handling large strings. Other approaches are via hash functions. package strings; /** * Implements the Lavenshtein algorithm to find the minimum number of edits * to change one string to another * … Read more
Anagram Checker
A simple way to check if two strings are anagrams is to find out if the numeric sum of the characters in the strings is equal. The approach below uses a hash function that returns the sum of the characters in the string. The running time is O(n) but has a space overhead proportional to … Read more
Problems that need to be discussed
unsolved!!!
Compare two string literals
Compare two string literals
