Largest Palindrome Product LeetCode solution in C++

1
class Solution {
2
 public:
3
  int largestPalindrome(int n) {
4
    if (n == 1) {
5
      return 9;
6
    }
7
    int hi = pow(10, n) - 1;
8
    int lo = pow(10, n - 1);
9
    int kk = 1337;
10
    for (int i = hi; i >= lo; i--) {
11
      string s = to_string(i);
12
      string k = s;
13
      reverse(k.begin(), k.end());
14
      s += k;
15
      long long int ll = stol(s);
16
      for (int j = hi; j >= sqrtl(ll); j--) {
17
        if (ll % j == 0) {
18
          return ll % kk;
19
        }
20
      }
21
    }
22
    return 0;
23
  }
24
};