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. Practice
  2. Algorithms
  3. Implementation
  4. Beautiful Days at the Movies
  5. Discussions

Beautiful Days at the Movies

  • chakri_learner + 1 comment

    same her, I have used string functions to reverse and converted it to number

    • shashankjain_ec2 + 2 comments

      static int beautifulDays(int i, int j, int k) {

          int count = 0;
    for(int m = i ; m <= j ; m++){
        int reverse = reverseNumber(m);
        if((Math.abs(reverse - m) % k) == 0){
            count++;
        }
    }

    return count;

}

static int reverseNumber(int number){
    Stack<Integer> digits = new Stack<Integer>();
    while(number > 0){
        int remainder = number % 10;
        digits.push(remainder);
        number /= 10;
    }
    int reversedNumber = 0;
    int count = 0;
    while(!(digits.isEmpty())){
        reversedNumber += digits.pop() * Math.pow(10, count);
        count += 1;
    }

    return reversedNumber;
}

      • mishraabhishek81 + 0 comments
        [deleted]

      • mishraabhishek81 + 0 comments

        static int beautifulDays(int i, int j, int k) 

        {
        int count=0;

            for(int x=i;x<=j;x++)
    {
        if(Math.abs(x-reverse(x))%k==0)
        count++;
    }
    return count;

}

static int reverse(int a)
{
    int n=0,k=0;
    while(a!=0)
    {
        k=a%10;
        n=n*10+k;
        a=a/10;
    }
    return n;
}