We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Beautiful Days at the Movies
  5. Discussions

Beautiful Days at the Movies

  • karrisatyalaxmi1
     + 0 comments

    Here my java solution

    public static int beautifulDays(int i, int j, int k) { int count = 0;

    for (int m = i; m <= j; m++) {
    int n = m;
    int reversed = 0;

    while (n != 0) {
        reversed = reversed * 10 + n % 10;
        n /= 10;
    }

    if (Math.abs(m - reversed) % k == 0) {
        count++;
    }
}

return count;

    }