SECOND AND MINUTES CHALLENGE

Create a method called getDurationString with two parameters, first parameter minutes and 2nd seconds
You should validate that 1st parameter is >=0
  ''        ''            ''         ''    2nd       ''        '' >=0 and <=59
The method should return invalid in the method if either of the above is not true  
If parameters are valid then calculate how many hours minutes and seconds equal the minutes and seconds passed to this method and return that value in the format as "XXh YYm ZZs".
Create a second method of the same name but only one parameter seconds. If it is valid, then calculate how many minutes are in second value and then call the overloaded method passing the correct minutes and seconds calculated so that it can calculate correctly 
Call both methods on the console.

Soln :  
     package com.cnc;
   public class Main {

    public static void main(String[] args) {
        getDurationString(65,45);
        getDurationString(-4,8);
        getDurationString(36000);
    }
    public static void getDurationString(int minutes,int seconds){
        if (seconds>=0 && seconds<=59 & minutes>=0){
            int hours = minutes/60;
            int newMinutes = minutes % 60;
            System.out.println(hours+"h:"+newMinutes+"m:"+seconds+"s");
        }

        else
            System.out.println("INVALID");
    }
    public static void getDurationString(int seconds){
        if (seconds>=0){
            int minutes = seconds/(60);
            int newSeconds = seconds%60;
            int newHours = seconds/(60*60);
            int newMinutes = minutes/60;
            System.out.println(newHours+"h:"+newMinutes+"m:"+newSeconds+"s");
        }

        else
            System.out.println("INVALID");

    }
}

Popular posts from this blog

NUMBER PALINDROME CHALLENGE

  package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( isPalindrome ( 101 )); } public static boolean isPalindrome ( int number) { int reverse = 0 ; int temporaryNumber =number; while (number!= 0 ){ reverse = reverse* 10 + number% 10 ; number = number/ 10 ; } if (reverse== temporaryNumber ) return true ; else return false ; } }
Read more

ENCAPSULATION CHALLENGE

package com.cnc ; public class Main { public static void main ( String [] args) { Printer printer = new Printer( 50 , true ); System . out .println( "Initial Page count is " + printer .getNumberOfPages()); int pagesPrinted = printer .getNumberOfPages( 4 ); } } package com.cnc ; public class Printer { private int tonerLevel = 100 ; private int numberOfPages ; private boolean isDuplex ; public Printer ( int tonerLevel, boolean isDuplex) { if (tonerLevel>=- 1 && tonerLevel<= 100 ) { this . tonerLevel = tonerLevel; } else { this . tonerLevel =- 1 ; } this . isDuplex = isDuplex; this . numberOfPages = 0 ; } public int addToner ( int tonerAmount){ if (tonerAmount> 0 && tonerAmount<= 100 ){ if ( this . tonerLevel +tonerAmount > 100 ){ return - 1 ; } this . tonerLevel += tonerAmount
Read more

LARGEST PRIME FACTOR OF A NUMBER

package com.cnc ; public class Main { public static void main ( String [] args) { System . out .println( getLargestPrime ( 20 )); System . out .println( getLargestPrime ( 7 )); } public static int getLargestPrime ( int number){ int i,stored=number; if (number<= 0 ) return - 1 ; else if ( isPrime (number)){ number=stored; } else { for ( i = 2 ; i < number; i++){ if (number%i== 0 ){ stored=i; } } } return stored; } public static boolean isPrime ( int n){ for ( int j = 2 ; j <n; j ++){ if (n% j == 0 ) return false ; else return true ; } return false ; } } ☑ Here i created a new method isTrue. if the number is prime then the number will return the same as output. but if it is not a prime then it will return the largest number excluding itself.
Read more