https://leetcode.com/problems/palindrome-pairs/ Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j] is a palindrome. Example 1: Given words =…
public class Solution { public int reverse(int x) { StringBuffer sb = new StringBuffer(x+"").reverse(); if(sb.charAt(sb.length()-1)=='-') { sb=new StringBuffer(sb.substring(0,sb.length()-1)); } int res=0; try { res= Integer.parseInt(sb.toString(…