You are viewing a single comment's thread. Return to all comments →
Passed every test case->
import java.io.; import java.util.;
public class Solution {
public static void main(String[] args) { Scanner sc=new Scanner(System.in); String A=sc.next().toLowerCase(); String B=sc.next().toLowerCase(); sc.close(); char arr1[]=A.toCharArray(); char arr2[]=B.toCharArray(); System.out.println(arr1.length+arr2.length); int n=A.compareToIgnoreCase(B); String c=A.concat(" "+B); char arr3[]=c.toCharArray(); for (int i = 0; i < arr3.length; i++) { if(arr3[i]==' ') { if(arr3[0]<=arr3[i+1]) { System.out.println("No"); } else { System.out.println("Yes"); } } } arr3[0]=(char)(arr3[0]-32); for (int i = 1; i < arr3.length; i++) { if(arr3[i]==' ') { arr3[i+1]=(char)(arr3[i+1]-32); } } for (char d : arr3) { System.out.print(d); } }
}
Seems like cookies are disabled on this browser, please enable them to open this website
Lexicographically Greater String
You are viewing a single comment's thread. Return to all comments →
Passed every test case->
import java.io.; import java.util.;
public class Solution {
}