Scribd Logo
Upload

Welcome to Scribd!

  • 30 views

    L25 - Lexicographically First Palindromic String

    Uploaded by

    Siddharth Jha

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    L25 - Lexicographically First Palindromic String

    Uploaded by

    Siddharth Jha
    30 views11 pages

    Original Title

    L25_Lexicographically First Palindromic String

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    30 views11 pages

    L25 - Lexicographically First Palindromic String

    Uploaded by

    Siddharth Jha

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 11

    Lexicographically

    first palindromic
    string
    Introduction:

    Rearrange the characters of the given string to


    form a lexicographically first palindromic string.
    If no such string exists display message
    “no palindromic string”.

    Examples:
    Input : Malayalam
    Output : aalmymlaa

    Input : apple
    Output : no palindromic string
    Two type of Approach:

    Simple Approach:

    1. Sort the string characters in alphabetical(ascending)


    order.
    2. One by one find lexicographically next permutation of
    the given string.
    3. The first permutation which is palindrome is the
    answer.
    Efficient Approach:

    Properties for palindromic string:

    1. If length of string is even, then the frequency


    of each character in the string must be even.

    2. If the length is odd then there should be one


    character whose frequency is odd and all other
    chars must have even frequency and at-least one
    occurrence of the odd character must be present
    in the middle of the string.
    Algorithm :
    1.Store frequency of each character in the given string .
    2. Check whether a palindromic string can be formed or not
    using the properties of palindromic string mentioned above.
    3. If palindromic string cannot be formed, return “No
    Palindromic String”.
    4. Else we create three strings and then return front_str +
    odd_str + rear_str.
    ✔ odd_str : It is empty if there is no character with odd
    frequency. Else it contains all occurrences of odd character.
    ✔ front_str : Contains half occurrences of all even occurring
    characters of string in increasing order.
    ✔ rear_str Contains half occurrences of all even occurring
    characters of string in reverse order of front_str.
    import java.util.Scanner;

    public class LexicographicallyFirstPalindromicString {

    static final int MAX_CHAR = 26;

    public static void main(String[] args) {


    Scanner scanner = new Scanner(System.in);
    System.out.print("Enter a string: ");
    String str = scanner.nextLine();
    String result = findPalindromicString(str);
    System.out.println("Lexicographically First Palindromic String: " + result);
    scanner.close();
    }
    static String findPalindromicString(String str) {
    int len = str.length();
    int freq[] = new int[MAX_CHAR];
    countFreq(str, freq, len);
    if (!canMakePalindrome(freq, len)) {
    return "No Palindromic String";
    }
    String oddStr = findOddAndRemoveItsFreq(freq);
    StringBuilder frontStr = new StringBuilder();
    StringBuilder rearStr = new StringBuilder();
    for (int i = 0; i < MAX_CHAR; i++) {
    StringBuilder temp = new StringBuilder();
    if (freq[i] != 0) {
    char ch = (char) (i + 'a');
    for (int j = 1; j <= freq[i] / 2; j++) {
    temp.append(ch);
    }
    frontStr.append(temp);
    rearStr.insert(0, temp);
    }
    }
    return frontStr.toString() + oddStr + rearStr.toString();
    }
    static void countFreq(String str, int freq[], int len) {
    for (int i = 0; i < len; i++) {
    freq[str.charAt(i) - 'a']++;
    }
    }
    static boolean canMakePalindrome(int freq[], int len) {
    int countOdd = 0;
    for (int i = 0; i < MAX_CHAR; i++) {
    if (freq[i] % 2 != 0) {
    countOdd++;
    }
    }
    if (len % 2 == 0) {
    return countOdd == 0;
    }
    return countOdd == 1;
    }
    static String findOddAndRemoveItsFreq(int freq[]) {
    StringBuilder oddStr = new StringBuilder();
    for (int i = 0; i < MAX_CHAR; i++) {
    if (freq[i] % 2 != 0) {
    freq[i]--;
    oddStr.append((char) (i + 'a'));
    return oddStr.toString();
    }
    }
    return oddStr.toString();
    }
    }
    Time Complexity: O(n)
    Auxiliary Space Complexity:
    constant
    THANK YOU

    You might also like