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. Drawing Book
  5. Discussions

Drawing Book

Sort by

recency

|

2094 Discussions

|

  • hristinaglavche1
     + 0 comments

    C# return p <= n / 2 ? p / 2 : (n/2 -p/2);

  • codingash27
     + 0 comments

    C++ one liner:

    int pageCount(int n, int p) { return std::min(p/2, ((n/2)-(p/2))); }

  • vitords
     + 0 comments

    My humble python solution:

    # Write your code here

#left to right
min_left = p // 2

#right to left
n = n + 1 if n % 2 == 0 else n
min_right = (n - p) // 2

return min_left if min_left <= min_right else min_right

  • omarlawatey
     + 0 comments

    Typescript Solution: 

    const pageCount = (n: number, p: number): number => Math.min(Math.floor(p / 2), Math.floor(n / 2) - Math.floor(p / 2));

  • afzal_saiyed931
     + 0 comments
    def pageCount(n, p):
    # Write your code here
    start = p // 2
    end = (n - p) // 2
    return start if start < end else end