Skip to main content

Java String Problem

Problem Statement
A string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. (Wikipedia)
In this problem we will test your knowledge of Java Strings. A string can be declared in following way:
String my_string="Hello World!"
Each elements of a string is called a character. Number of characters in a string is called string length.
In this problem you wil be given two strings A and B as input. They will contain only lower case english letters. You have to answer the following questions:
1.     What is the total length of string A and B?
2.     Is string A lexicographically larger than than B? print "Yes" or "No".
3.     Make first letter of both the strings uppercase and print them in a single line seperated by a space.
[Note: Lexicographic order is also known as alphabetic order dictionary order. So "ball" is smaller than "cat", "dog" is smaller than "dorm" and "dogg". ]
Sample Input
 hello
 java
Sample Output
9
No
Hello Java


import java.io.*;
import java.util.*;

public class Solution {

    static String retSortArray(String a,String b){
        String[] strList=new String[2];
        strList[0]=a;
        strList[1]=b;
        Arrays.sort(strList);
        return strList[0];
    }
    
    static String toUpperFirstLetter(String str){
        char[] chr=str.toCharArray();
        int len=chr.length;
        String retString="";
        for(int i=0;i<len;i++){
            if(i==0){
                retString=retString+chr[i];
                retString=retString.toUpperCase();
            }else{
                retString=retString+chr[i];
            }
        }
        return retString;
    }
    
    public static void main(String[] args) {
        
        Scanner sc=new Scanner(System.in);
        String A=sc.next();
        String B=sc.next();
        /* Enter your code here. Print output to STDOUT. */
        int len=A.length()+B.length();
        String flag=retSortArray(A,B).equals(B)?"Yes":"No";
        System.out.println(len);
        System.out.println(flag);
        System.out.println(toUpperFirstLetter(A)+" "+toUpperFirstLetter(B));
    }
}


·         Testcase 0
Congratulations, you passed this test case!
Input (stdin)
hello
java
Your Output (stdout)
9
No
Hello Java
Expected Output
9
No
Hello Java





 • Score: 4.17 / 5 
Test Case #0:  0.09s
Test Case #1:  0.09s - Failed
Test Case #2:  0.08s
Test Case #3:  0.08s
Test Case #4:  0.09s
Test Case #5:  0.08s
Test Case #6:  0.08s

Comments

Post a Comment

Popular posts from this blog

CODILITY: Determine whether given string of parentheses is properly nested.

Task description A string S consisting of N characters is called  properly nested  if: S is empty; S has the form " (U) " where U is a properly nested string; S has the form " VW " where V and W are properly nested strings. For example, string " (()(())()) " is properly nested but string " ()) " isn't. Write a function: class Solution { public int solution(String S); } that, given a string S consisting of N characters, returns 1 if string S is properly nested and 0 otherwise. For example, given S = " (()(())()) ", the function should return 1 and given S = " ()) ", the function should return 0, as explained above. Assume that: N is an integer within the range [ 0 .. 1,000,000 ]; string S consists only of the characters " ( " and/or " ) ". Complexity: expected worst-case time complexity is O(N); expected worst-case space complexity is O(1) (not counting the storage requi...
1 comment
Read more

Distinct: Compute number of distinct values in an array.

Task description Write a function class Solution { public int solution(int[] A); } that, given a zero-indexed array A consisting of N integers, returns the number of distinct values in array A. Assume that: N is an integer within the range [ 0 .. 100,000 ]; each element of array A is an integer within the range [ −1,000,000 .. 1,000,000 ]. For example, given array A consisting of six elements such that: A[0] = 2 A[1] = 1 A[2] = 1 A[3] = 2 A[4] = 3 A[5] = 1 the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3. Complexity: expected worst-case time complexity is O(N*log(N)); expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments). Elements of input arrays can be modified. class Solution { public int solution ( int [] A) { // write your code in Java SE 8 int len=A.length; int count= 1 ; ...
1 comment
Read more

change directory (cd) function for an abstract file system ( Java Implementation )

Write a function that provides change directory (cd) function for an abstract file system. Notes: Root path is '/'. Path separator is '/'. Parent directory is addressable as "..". Directory names consist only of English alphabet letters (A-Z and a-z). For example, new Path("/a/b/c/d").cd("../x").getPath() should return "/a/b/c/x". Note: The evaluation environment uses '\' as the path separator. public class Path {     private String path;     public Path(String path) {         this.path = path;     }     public String getPath() {         return path;     }     public Path cd(String newPath) {         //throw new UnsupportedOperationException("Waiting to be implemented."); String[] newP=newPath.split("/");     String[] oldP=path.split("/");     int lnCount=0;     for(String str:newP){     if(st...
6 comments
Read more