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

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...

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...