Hello Programmers, In this post, you will know how to solve the Java Substring HackerRank Solution. This problem is a part of the HackerRank Java Programming Series.
One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.
Java Substring HackerRank Solutions
Problem :
Given a string,8 , and two indices, start and end, print a substring consisting of all characters in the inclusive range from start to end-1 . You’ll find the String class’ substring method helpful in completing this challenge.
Input Format
The first line contains a single string denoting 8.
The second line contains two space-separated integers denoting the respective values of start and end .
Constraints
- String consists of English alphabetic letters (i.e., ) only.
Output Format
Print the substring in the inclusive range from start to end-1 .
Sample Input
Helloworld
3 7
Sample Output
lowo
Explanation
In the diagram below, the substring is highlighted in green:
Java Substring HackerRank Solutions
import java.util.Scanner; public class Solution { public static void main(String[] args) { /* Save input */ Scanner scan = new Scanner(System.in); String A = scan.next(); String B = scan.next(); scan.close(); /* Sum lengths */ System.out.println(A.length() + B.length()); /* Compare lexicographical ordering */ System.out.println(A.compareTo(B) > 0 ? "Yes" : "No"); /* Print the Strings in desired format */ System.out.println(capFirstLetter(A) + " " + capFirstLetter(B)); } private static String capFirstLetter(String str) { if (str == null || str.length() == 0) { return ""; } else { return str.substring(0,1).toUpperCase() + str.substring(1); } } }
Disclaimer: The above Problem (Java Substring) is generated by Hackerrank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.