Hello Programmers/Coders, Today we are going to share solutions of Programming problems of 30 Days Of Code, HackerRank. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Day 19: Interfaces in Java-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.
Link for the Problem – Day 19: Interfaces – Hacker Rank Solution
Day 19: Interfaces – Hacker Rank Solution
Problem:
Objective
Today, we’re learning about Interfaces. Check out the Tutorial tab for learning materials and an instructional video!
Task
The AdvancedArithmetic
interface and the method declaration for the abstract divisorSum(n)
method are provided for you in the editor below.
Complete the implementation of Calculator
class, which implements the AdvancedArithmetic
interface. The implementation for the divisorSum(n)
method must return the sum of all divisors of .
Example
The divisors of are . Their sum is .
The divisors of are and their sum is .
Input Format
A single line with an integer, .
Constraints
Output Format
You are not responsible for printing anything to stdout. The locked template code in the editor below will call your code and print the necessary output.
Sample Input
6
Sample Output
I implemented: AdvancedArithmetic 12
Explanation
The integer is evenly divisible by , , , and . Our divisorSum method should return the sum of these numbers, which is . The Solution class then prints on the first line, followed by the sum returned by divisorSum (which is ) on the second line.
Day 19: Interfaces – Hacker Rank Solution
import java.util.Scanner; /** * @author Techno-RJ * */ interface AdvancedArithmetic{ int divisorSum(int n); } //renamed Calculator class to Calculator2 class as its already present in Day17 question class Calculator2 implements AdvancedArithmetic{ public int divisorSum(int n){ if(n==1)return 1; int sum=1+n,r=0; for(int i=2;i<n;i++){ r=n%i; if(r==0){ sum=sum+i; } } return sum; } } public class Day19Interfaces { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.nextInt(); scan.close(); AdvancedArithmetic myCalculator = new Calculator2(); int sum = myCalculator.divisorSum(n); System.out.println("I implemented: " + myCalculator.getClass().getInterfaces()[0].getName() ); System.out.println(sum); } }