Find numbers which are palindrome in both their decimal and octal representations. | Algorithms

Find numbers which are palindrome in both their decimal and octal representations. | Algorithms

by SJ · February 22, 2015 Objec­tive: Given a range of inte­gers, find all the num­bers which are palin­drome when they are rep­re­sented in Dec­i­mal Value( base 10) and in Octal value(base 8). Exam­ple : Number : 373 (Decimal) and digits are palindrome. Convert it into Octal which is 565 and that's also palindrome. Approach: Solu­tion is quite sim­ple. Tra­verse through all the num­bers in the given range and check if it palin­drome, if yes, con­vert it into Octal and check for palin­drome again. Code:    public class DecimalOctalPalindrome { public String DecimalToOctal(int N) { String Oct = ""; while (N > 0) { int x = N % 8; N = N / 8; Oct += x; } return Oct; } public boolean isPalindrome(String S) { int i = 0; int j = S.length() - 1; while (i < j) { if (S.charAt(i) != S.charAt(j)) { return false; } i++; j--; } return true; } public void findBothPalindrome(int start, int end) { for (int i = start; i <= end; i++) { String decimal = String.valueOf(i);

Read full article from Find numbers which are palindrome in both their decimal and octal representations. | Algorithms