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. Lisa's Workbook
  5. Discussions

Lisa's Workbook

Sort by

recency

|

949 Discussions

|

  • krushnaingale201
     + 0 comments

    JAVA

    public static int workbook(int n, int k, List arr)

    {
int page = 1;
int count = 0;
for(int i=0;i<n;i++){
    int noq = arr.get(i);
    int j =1;
    while(j<=noq){
        int ques = j;
        int qcount = 1;
        while(qcount<=k){
            if(ques==page){
                count++;
            }
            ques++;
            if(ques>noq){
                break;
            }   
            qcount++;             
        }
        page++;
        j+=k;
    }
    }
    return count;
}

  • afzal_saiyed931
     + 0 comments
    def workbook(n, k, arr):
    # Write your code here
    
    current_page_no = 0
    special_problem_count = 0
    for chapter in range(1, n+1):
        pages = math.ceil(arr[chapter-1] / k)
        current_problems = 0
        while pages > 0:
            current_page_no += 1
            problems_on_current_page = k if (arr[chapter-1] - current_problems) > k else arr[chapter-1] - current_problems
            if current_page_no > current_problems and current_page_no <= (current_problems+problems_on_current_page):
                special_problem_count += 1
            current_problems += problems_on_current_page
            pages -= 1            
    return special_problem_count

  • lsloan
     + 0 comments

    Python: Semi-short looping solution…

    def workbook(_, k, arr):
  p = s = 0
  for i in arr:
    for j in range(0, i, k):
      p, s = ((p + 1, s + 1)
        if j < p + 1 <= min(i, j + k)
        else (p + 1, s)) 
  return s

    Here's a semi-short, non-looping functional solution…

    def workbook(_, k, arr):
    pg = lambda m: m[0]
    prob1 = lambda m: m[1][0]
    probN = lambda m: m[1][1]
    return sum(map(
        lambda pgProbs: int(prob1(pgProbs) < pg(pgProbs) <= probN(pgProbs)), 
        enumerate(sum(map(
            lambda chNumProb: list(map(
                lambda pgProb1: (pgProb1, min(chNumProb, pgProb1 + k)), 
                range(0, chNumProb, k))), 
            arr), []), start=1)))

    It could be shorter, but I've seen people complain about the readability of functional code. So, I tried to make this descriptive. I used verbose names for lambda arguments. I also added lambdas for accessing the members of tuples returned from the inner map levels.

    Here's a terse version of the same code…

    def workbook(_, k, arr):
    return sum(map(lambda m: int(m[1][0] < m[0] <= m[1][1]),
            enumerate(sum(map(lambda i:
                list(map(lambda j: (j, min(i, j + k)), 
                range(0, i, k))), 
            arr), []), 1)))

  • yashdeora98294
     + 0 comments

    Here is problem solution in Python, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-lisas-workbook-problem-solution.html

  • buchannolacharan
     + 0 comments

    Here is my c++ solution

    int workbook(int n, int k, vector arr) { vector> pages; int specialCount = 0;

    for (int chapter = 0; chapter < n; chapter++) {
    int problems = arr[chapter];
    int problemNum = 1;

    while (problemNum <= problems) {
        int end = min(problemNum + k - 1, problems);
        vector<int> page;

        for (int i = problemNum; i <= end; i++) {
            page.push_back(i);
        }

        pages.push_back(page);
        problemNum = end + 1;
    }
}


for (int i = 0; i < pages.size(); i++) {
    int pageNumber = i + 1;
    for (int j=0;j<pages[i].size();j++) {
        if (pages[i][j] == pageNumber) {
            specialCount++;
        }
    }
}

return specialCount;

    }