Skip to main content

Covariant Return Types in Java Method Overriding with examples

Covariant Return Types HackerRank solution in Java

Covariant Return Types in Java MethodOverriding

Java allows for Covariant Return Types, which means you can vary your return type as long you are returning a subclass of your specified return type. 

Learn more about Method Overriding and Covariant Return Types with Examples :

The name comes from the fact that the type of the return is allowed to vary in the same direction that you subclass.  

See problem description on HackerRank :

Lets see solution.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

//Complete the classes below
class Flower {
   String whatsYourName () {
       return "I have many names and types.";
   }
}

class Jasmine extends Flower {
    String whatsYourName () {
       return "Jasmine";
    }
}

class Lily extends Flower {
    String whatsYourName() {
       return "Lily";
    }
}

class Region {
     Flower yourNationalFlower() {
        return new Flower();
     }
}

class WestBengal extends Region {
     Jasmine yourNationalFlower() {
       return new Jasmine();
     }
}

class AndhraPradesh extends Region {
     Lily yourNationalFlower() {
       return new Lily();
     }
}


public class Solution {
  public static void main(String[] args) throws IOException {
      BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
      String s = reader.readLine().trim();
      Region region = null;
      switch (s) {
        case "WestBengal":
          region = new WestBengal();
          break;
        case "AndhraPradesh":
          region = new AndhraPradesh();
          break;
      }
      Flower flower = region.yourNationalFlower();
      System.out.println(flower.whatsYourName());
    }

 

Happy Coding.


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

Java Hashset HackerRank Solution | Programming Blog

Java Hashset HackerRank Solution with Explanation   Problem Statement :- In computer science, a set is an abstract data type that can store certain values, without any particular order, and no repeated values. {1,2,3} is an example of a set, but {1,2,2} is not a set. Today you will learn how to use sets in java by solving this problem. You are given n pairs of strings. Two pairs (a,b) and (c,d) are identical if a = c and b = d. That also implies (a,b) is not same as (b,a). After taking each pair as input, you need to print number of unique pairs you currently have. See full problem description in HackerRank Website :- https://www.hackerrank.com/challenges/java-hashset/problem Let's see solution of problem. import java.util.HashSet; import java.util.Scanner; public class Solution {     public static void main(String[] args) {         Scanner s = new Scanner(System.in);         System.out.println("Enter tot...