Palindromer

Posted by Sandeep Phukan on September 10, 2008 · Leave a Comment 

This is a personal fav of mine…. create any string to the shortest possible palindromes …. package palindromeCheck; /** * Converts any string into the shortest possible Palindromes .. * @author sphukan * */ public class Palindromer { private String palindromeIt(String text,int startIndex,int endIndex,boolean fromRightToLeft){ if (startIndex==endIndex ){ return text; } else { char startChar=text.charAt(startIndex); … Continue reading →

Category Algorithms, Java, Palindrome, Recursion, text handling

Java Palindrome Checker

Posted by Sandeep Phukan on September 5, 2008 · 1 Comment 

Another Palindrome Checker …. in Java … package palindromeCheck; /** * Checks if a string is a Palindrome or not … * @author sphukan */ public class palindromeChecker { private boolean checkPalindrome(String text){ if (text.charAt(0)==text.charAt(text.length()-1)){ if (text.length()==1) { return true; }else { return (checkPalindrome(text.substring(1,text.length()-1))); } }else { return false; } } public static void main(String[] … Continue reading →

Category Algorithms, Java, Palindrome, Recursion, text handling

XSLT Palindrome Checker

Posted by Sandeep Phukan on September 5, 2008 · Leave a Comment 

A simple XSLT based palindrome checker …. Input XML: XSLT File: Output XML For a non Palindrome …we get the following result …

Category Algorithms, Palindrome, Recursion, text handling, XSLT