Leetcode 1922 | Count Good Numbers | Java Solution | C++ | Leetcode Daily

#leetcodepotd #data #dsa
#java
#coding
#LeetCode
#leetcodedaily
#cpp
#leetcode1922
#leetcodemedium
#Count Good Numbers

[CodewithoutComplexity-bj]

C++ code here-
#include <iostream>
using namespace std;

class Solution {
static const int M = (int)1e9 + 7;

long long findPower(long long a, long long b) {
if (b == 0) {
return 1;
}

long long half = findPower(a, b / 2);
long long result = (half * half) % M;

if (b % 2 == 1) {
result = (result * a) % M;
}

return result;
}

public:
int countGoodNumbers(long long n) {
long long oddPositions = (n + 1) / 2;
long long evenPositions = n / 2;

long long result = (findPower(5, oddPositions) * findPower(4, evenPositions)) % M;
return (int)result;
}
};