Leet Code JAVA Solution - Angle Between Hands of a Clock

Given two numbers, hour and minutes. Return the smaller angle (in degrees) formed between the hour and the minute hand.

 

Example 1:

Input: hour = 12, minutes = 30
Output: 165

Example 2:

Input: hour = 3, minutes = 30
Output: 75

Example 3:

Input: hour = 3, minutes = 15
Output: 7.5

Example 4:

Input: hour = 4, minutes = 50
Output: 155

Example 5:

Input: hour = 12, minutes = 0
Output: 0

 

Constraints:

• 1 <= hour <= 12
• 0 <= minutes <= 59
• Answers within 10^-5 of the actual value will be accepted as correct.

My Code:

class Solution {

    public double angleClock(int hour, int minutes) {

        double angle = 5.5*(minutes + (hour)*60);

          if (angle < 360 && angle > 180){

           return (360 -angle);

        }

        else if (angle>360){

            double n = angle%360;

            if(n>180){

                return (360 - n);

            }

            else{

                return n;

            }

        }

        else if(angle<0){

            return (-angle);

        }

       return 0; 

    }

    

}

Copyright © saras ojha

Leet Code Solution Java - Two Sum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]

Example 3:

Input: nums = [3,3], target = 6 

Output: [0,1]

Code:

class Solution {

    public int[] twoSum(int[] nums, int target) {

        int [] arr = new int [2];

        

        for (int i=0; i<nums.length;i++){

            for(int j=i+1;j<nums.length; j++){

                int add = nums[i]+nums[j];

                if(add==target){

                   arr[0] = i;

                   arr[1] = j;

                }

                }

                }

        return arr;

        

    }

} 

Copyright © saras ojha