Ayush is studying for ninjatest which will be held after 'N' days, And to score good marks he has to study 'M' chapters and the ith chapter requires TIME[i] seconds to study. The day in Ayush’s world has 100^100 seconds. There are some rules that are followed by Ayush while studying.

1. He reads the chapter in a sequential order, i.e. he studies i+1th chapter only after he studies ith chapter.

2. If he starts some chapter on a particular day he completes it that day itself.

3. He wants to distribute his workload over 'N' days, so he wants to minimize the maximum amount of time he studies in a day.

Your task is to find out the minimal value of the maximum amount of time for which Ayush studies in a day, in order to complete all the 'M' chapters in no more than 'N' days.

For example

if Ayush want to study 6 chapters in 3 days and the time that each chapter requires is as follows:
Chapter 1 = 30
Chapter 2 = 20
Chapter 3 = 10
Chapter 4 = 40
Chapter 5 = 5
Chapter 6 = 45

Then he will study the chapters in the following order 

| day 1 : 1 , 2 | day 2 : 3 , 4 | day 3 : 5 , 6 |
Here we can see that he study chapters in sequential order and the maximum time to study on a day is 50, which is the minimum possible in this case.

Which of the following is a structured programming technique that graphically represents the detailed steps required to solve a program?

Which of the following data structures can be used to implement queues?
1. Stack
2. Array
3. LinkedList
4. All of the Above

Difference between LRU and LFU Page Replacement Algorithm. What is LRU Page Replacement Algorithm? Asked some more related problems

You have been given a root node of a binary search tree and a positive integer ‘K’. You need to split the given BST into two BST such that first BST has all nodes with values less than or equal to the given value ‘K’, and second tree has all nodes with values greater than the given value ‘K’.

Note:

1. A binary search tree is a binary tree data structure, with the following properties
    a. The left subtree of any node contains nodes with the value less than the node’s value.
    b. The right subtree of any node contains nodes with the value equal to or greater than the node’s value.
    c. Right, and left subtrees are also binary search trees.
2. It is guaranteed that all nodes in the given tree will have distinct positive integral values .
3. The given tree may or may not contain a node of value equal to the given value ‘K’.

Example, below the tree, is a binary search tree.

Below the tree is not a BST as node ‘2’ is less than node ‘3’ but ‘2’ is the right child of ‘3’, and node ‘6’ is greater than node ‘5’ but it is in the left subtree of node ‘5’.

Note:

1. You have to split the given tree in such a way that the structure of both returned trees is similar to the originally given tree, i.e. if a parent node ‘P’ and child node ‘C’ lies on the same tree after splitting, then ‘C must be the same child of ‘P’.
2. If there is no valid tree, then return ‘NULL’ node in its place.

Imagine you are tasked with designing a parking lot system. Consider the following requirements:

The parking lot has multiple levels, each containing multiple spots.
There are different types of spots (compact, regular, handicapped, etc.).
Cars of different sizes (small, medium, large) can park in the parking lot.
The system should be able to find an available spot for a given car size.

Problems:
1. Implement methods for cars entering and leaving the parking lot.
2. Provide functionality to check the current occupancy and availability of spots on each level.

You have been given a non-empty grid ‘MAT’ consisting of only 0s and 1s. Your task is to find the area of maximum size square sub-matrix with all 1s.

If there is no such sub-matrix, print 0.

For example, for the following grid:

The area of the largest square submatrix with all 1s is 4.