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

|

2091 Discussions

|

  • 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

  • muhammadnabilas2
     + 0 comments

    rust in O(1) solution

    fn page_count(n: i32, p: i32) -> i32 {
    (p / 2).min((n - p + (n + 1) % 2) / 2)
}

  • mrz_strazzullo
     + 0 comments

    My C# solution; public static int pageCount(int n, int p) { var books = Enumerable.Range(0, n + 1).Chunk(2); int counter = 0; List counters = [];

      foreach(var pages in books)
  {
    if(pages.Contains(p))
      break;
    counter++;
  }
  counters.Add(counter);
  counter = 0;
  books = books.Reverse();
  foreach(var pages in books)
  {
    if(pages.Contains(p))
      break;
    counter++;
  }
  counters.Add(counter);

  return Enumerable.Min(counters);
}

  • mrz_strazzullo
     + 0 comments

    Python solution

    def pageCount(n, p): # Write your code here if n == 0: return 0 pages = [i for i in range(0, n + 1)] book = [pages[i:i + 2] for i in range(0, len(pages), 2)] book[-1].insert(1, 0) counter = 0 counters = []

    for pages in book:
    if p in pages:
        break
    counter += 1
counters.append(counter)
counter = 0
for pages in reversed(book):
    if p in pages:
        break
    counter += 1
counters.append(counter)
return min(counters)