You are given n stacks of books, where each stack arr[i] represents the number of books in that stack (with each book having a height of 1 unit). In a single move, you can choose any number of consecutive stacks such that the height of each selected stack is less than or equal to k. After selecting a sequence of stacks, you can collect any number of books from those chosen stacks.
Your task is to determine the maximum number of books you can collect in this manner. You need to complete the function max_Books() which takes the integer arr, n, and k returns the maximum number of books you can collect.
Example 1
Input: 8 2, 3 2 2 3 1 1 1 3
Output: 4
Explanation: We can collect maximum books from consecutive stacks numbered 2 and 3 having height less than equal to K.
Approach, complexity and clean code in every language. Sign in to unlock the editorial.
Your submissions, results and runtime history live here. Sign in to start your streak.
8 2 3 2 2 3 1 1 1 3
4
6 1 3 1 1 1 2 1
3
