Day 2 of LeetCode Challenge
Problem 1: Lexicographically Smallest Palindrome
link to the problem
class Solution {
public String makeSmallestPalindrome(String s) {
if(s.length()==1)
return s;
for(int i=0; i<s.length()/2; i++){
if(s....
tusharpant.hashnode.dev3 min read