2652. Sum Multiples LeetCode

Problem Statement

Given a positive integer n, find the sum of all integers in the range [1, n] inclusive that are divisible by 3, 5, or 7.

Return an integer denoting the sum of all numbers in the given range satisfying the constraint.

 

Example 1:

Input: n = 7
Output: 21
Explanation: Numbers in the range [1, 7] that are divisible by 3, 5, or 7 are 3, 5, 6, 7. The sum of these numbers is 21.

Example 2:

Input: n = 10
Output: 40
Explanation: Numbers in the range [1, 10] that are divisible by 3, 5, or 7 are 3, 5, 6, 7, 9, 10. The sum of these numbers is 40.

Example 3:

Input: n = 9
Output: 30
Explanation: Numbers in the range [1, 9] that are divisible by 3, 5, or 7 are 3, 5, 6, 7, 9. The sum of these numbers is 30.

 

Constraints:

• 1 <= n <= 103

C++ Code:-

class Solution {

public:

    int sumOfMultiples(int n) {

        int sum=0;

        for(int i=3;i<=n;i++)

        {

            if(i%3==0 || i%5==0 || i%7==0)

                sum += i;

        }

        return sum;

    }

};

C Code:-

int sumOfMultiples(int n){

int sum=0;

        for(int i=3;i<=n;i++)

        {

            if(i%3==0 || i%5==0 || i%7==0)

                sum += i;

        }

        return sum;

}

Python Code:-

class Solution:

    def sumOfMultiples(self, n: int) -> int:

        sum=0

        for i in range(3,n+1):

            if(i%3==0 or i%5==0 or i%7==0):

                sum += i;

        return sum

Java Code:-

class Solution {

    public int sumOfMultiples(int n) {

        

       int sum=0;

        for(int i=3;i<=n;i++)

            if(i%3==0 || i%5==0 || i%7==0)

                sum += i;

        return sum;

    }

}

 2651. Calculate Delayed Arrival Time LeetCode

One-Line Solution :)

Problem statement

You are given a positive integer arrivalTime denoting the arrival time of a train in hours, and another positive integer delayedTime denoting the amount of delay in hours.

Return the time when the train will arrive at the station.

Note that the time in this problem is in 24-hours format.

 

Example 1:

Input: arrivalTime = 15, delayedTime = 5 
Output: 20 
Explanation: Arrival time of the train was 15:00 hours. It is delayed by 5 hours. Now it will reach at 15+5 = 20 (20:00 hours).

Example 2:

Input: arrivalTime = 13, delayedTime = 11
Output: 0
Explanation: Arrival time of the train was 13:00 hours. It is delayed by 11 hours. Now it will reach at 13+11=24 (Which is denoted by 00:00 in 24 hours format so return 0).

 

Constraints:

• 1 <= arrivaltime < 24
• 1 <= delayedTime <= 24

C++ Code:-

class Solution {

public:

    int findDelayedArrivalTime(int arrivalTime, int delayedTime) {

        int t = (arrivalTime + delayedTime)%24;

        return t;

    }

};

C Code:-

int findDelayedArrivalTime(int arrivalTime, int delayedTime){

int t = (arrivalTime + delayedTime)%24;

        return t;

}

Python Code:-

class Solution:

    def findDelayedArrivalTime(self, arrivalTime: int, delayedTime: int) -> int:

        return (arrivalTime + delayedTime)%24;

Java Code:-

class Solution {

    public int findDelayedArrivalTime(int arrivalTime, int delayedTime) {

        return (arrivalTime + delayedTime)%24;

    }

}