public static void main(String args[]){
        OneEditApart oea = new OneEditApart();
        System.out.println(oea.isOneEditDistance("cat", "dog"));
        System.out.println(oea.isOneEditDistance("cat", "cats"));
        System.out.println(oea.isOneEditDistance("cat", "cut"));
        System.out.println(oea.isOneEditDistance("cats", "casts"));
        System.out.println(oea.isOneEditDistance("catsts", "casts"));
    }
Date 03/26/2016
@author Tushar Roy
Given two strings S and T, determine if they are both one edit distance apart.

Time complexity O(n)
Space complexity O(1)

Reference
https://leetcode.com/problems/one-edit-distance/
src/com/interview/recursion/OneEditApart.java