From 78671cfdd02fe11b51965b65f15adf10829a0dc3 Mon Sep 17 00:00:00 2001
From: Sujatha369 <61383403+Sujatha369@users.noreply.github.com>
Date: Tue, 25 Oct 2022 21:22:17 +0530
Subject: [PATCH] Create Break_a_palindrome.java

---
 Break_a_palindrome.java | 34 ++++++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 Break_a_palindrome.java

diff --git a/Break_a_palindrome.java b/Break_a_palindrome.java
new file mode 100644
index 0000000..4d80af3
--- /dev/null
+++ b/Break_a_palindrome.java
@@ -0,0 +1,34 @@
+/*
+
+Given a palindromic string of lowercase English letters palindrome, 
+replace exactly one character with any lowercase English letter so that the resulting string is not a palindrome 
+and that it is the lexicographically smallest one possible.
+
+Return the resulting string. If there is no way to replace a character to make it not a palindrome, return an empty string.*/
+
+import java.util.*;
+import java.io.*;
+public class Main
+{
+	public static void main(String[] args) {
+	    Scanner sc = new Scanner(System.in);
+	    System.out.println("Enter the palindrome: ");
+	    String palindrome = sc.nextLine();
+	    char[] ch = palindrome.toCharArray();
+        if(ch.length==1){
+            System.out.println("");
+            System.exit(0);
+        }
+        int i=0;
+        while(i<ch.length/2 && ch[i]=='a'){
+            i++;
+        }
+        if(i==(ch.length/2)){
+            ch[ch.length-1]='b';
+        }
+        else
+            ch[i]='a';
+        palindrome = new String(ch);
+		System.out.println(palindrome);
+	}
+}