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

  • coslic + 1 comment

    Nice, but I don't like the entaglement in beautifulDays of the looping through range with the algorithm itself that decides to put an 1 or not depending on the (day - reverse of the day) is divisible or not by k. I would disentangle the looping and the filtering by the problem condition in 2 separate functions, and the algorithm will become more readable.

    • Kostyantin_Kon + 3 comments

      Like I did?

      def reverse(n):

      m = 0

while n != 0:

    m = 10

    m += n % 10

    n = n // 10

print(m)

return m

      def beautifulDays(i, j, k):

      a = range(i,j+1)      

return sum([1 for x in a if abs(x-reverse(x)) % k == 0])*

      • codded + 0 comments
        [deleted]

      • sucheetdumbre201 + 0 comments

        Mine is similar to this!

      • jaeemhossain + 0 comments

        I don't understand how your reverse() function works.The algo seems wrong to me.Can you please explain.