Skip to main content

Java Exception Handling using Try-catch

Java Exception Handling (Try-catch) HackerRank Problem and Solution 

Java Exception Handling using Try-catch hackerrank solution

Problem Description : 

You will be given two integers x and y as input, you have to compute x/y. If x and y are not 32 bit signed integers or if y is zero, exception will occur and you have to report it. Read sample Input/Output to know what to report in case of exceptions.

Learn about Exception and Exception handling :

Java has built-in mechanism to handle exceptions. Using the try statement we can test a block of code for errors. The catch block contains the code that says what to do if exception occurs. 

Sample Input and Output :

Input 1

10 3

Output 1

3

Input 2

10 0

Output 2

java.lang.ArithmeticException: / by zero

Input 3

10 string

Output 3

java.util.InputMismatchException

Lets see solution : 

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

public class Solution {

    public static void main(String[] args) {
     
        try {
            Scanner in = new Scanner(System.in);
            int x = in .nextInt();
            int y = in .nextInt();
            System.out.println(x/y);
        } catch (ArithmeticException e) {
            System.out.println("java.lang.ArithmeticException: / by zero");
        } catch (InputMismatchException e) {
            System.out.println("java.util.InputMismatchException");
        }
    }
}

Solution explanation :

  • Write all code in try block. so any Exception occur it will handled by catch() block.
  • Get user input using Scanner class in x and y variable.
  • Print solution of "x/y".
  • If there will be divide by zero exception it will handled by "java.lang.ArithmeticException: / by zero". and if there will be input mismatch it will handled by "java.util.InputMismatchException" catch block.  


Happy coding...

See other hackerrank problem and solutions :

Comments

Popular posts from this blog

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...

Simple Text Editor HackerRank Solution in Java with Explanation

Simple Text Editor HackerRank Solution in Java with Explanation Problem Description : Implement a simple text editor. The editor initially contains an empty string S. Perform Q operations of the following 4 types: append (W) - Append string W to the end of S. delete (k) - Delete the last K characters of S. print (k) - Print the kth character of S. undo () - Undo the last (not previously undone) operation of type 1 or 2, reverting S to the state it was in prior to that operation. Example : Input : S = "abcde" Operations = ["1 fg", "3 6", "2 5", "4", "3 7", "4", "3 4"] index   S          ops[index]    explanation -----   ------     ----------    ----------- 0       abcde      1 fg          append fg 1       abcdefg    3 6        ...