Divisible and Non divisible Sums Difference

Lowkey, just follow what the question tells you to do.

code

class Solution {
public:
    int differenceOfSums(int n, int m) {
        int divisible = 0, notDivisible = 0;
        for (int i = 1; i <= n; ++i) {
            if ((i % m) != 0) {
                notDivisible += i;
            } else {
                divisible += i;
            }
        }
        return notDivisible - divisible;
    }
};

complexity

• Time: O(n)
• Space: O(1)

time taken

• 2 minutes and 10 seconds