Sort by

recency

|

1776 Discussions

|

  • + 0 comments
    func reverse(number int32) int32 {
        if number < 10 {
            return number
        }
        
        reverse := int32(0)
        
        for number > 0 {
            
            r := number % 10 
            reverse = reverse * 10 + r
            
            number = number / 10
        }
        return reverse
     }
    
    func beautifulDays(i int32, j int32, k int32) int32 {
        // Write your code here
        count := int32(0)
        
        for i:= i; i <= j; i++ {
            if (i - reverse(i)) % k == 0{
                count++
            }
        }
        return count   
    }
    
  • + 0 comments

    `

    func reverse(number int32) int32 { if number < 10 { return number }

    reverse := int32(0)
    
    for number > 0 {
    
        r := number % 10 
        reverse = reverse * 10 + r
    
        number = number / 10
    }
    return reverse
    

    } `

  • + 0 comments

    Step 1: Solve it like a noob Step 2: Be the 'Ok guy'

        # count = 0
        # for day in range(i, j+1):
        #     if (day-int(str(day)[::-1])) % k == 0:
        #         count += 1
        # return count
        
        return sum((day-int(str(day)[::-1])) % k == 0 for day in range(i, j+1))
    
  • + 0 comments

    //check the code int reverse_num(int num){ int temp = 0; int neg = num < 0; if (neg) num = -num; while(num){ temp = (temp*10) + (num%10); num /= 10;
    } return neg ? -temp:temp; }

    int beautifulDays(int i, int j, int k) { int beautiful_count = 0;

    for(int day=i; day <= j; day++){
        if(abs(day - reverse_num(day)) % k == 0) {
            beautiful_count++;
        }
    }
    return beautiful_count;
    

    }

  • + 0 comments
    function reverseNumber(num: number) {
      let rev = 0;
    
      while (num > 0) {
        rev = rev * 10 + (num % 10);
        num = Math.floor(num / 10);
      }
    
      return rev;
    }
    
    function beautifulDays(i: number, j: number, k: number): number {
      let cnt = 0;
    
      for (let num = i; num <= j; num++) {
        let reversed_num = reverseNumber(num);
        if ((num - reversed_num) % k === 0) {
          cnt++;
        }
      }
    
      return cnt;
    }