This was a function problem. We need to complete the function ispar() that takes a string as a parameter and returns a boolean value true if brackets are balanced else returns false. The printing is done automatically by the driver code.

Completed the function kLargest() that takes the array, N and K as input parameters and returns a list of k largest element in descending order.

Completed the function numberOfPaths() which takes m and n as input parameter and returns count all the possible paths.
The answer was very large, so computed the answer modulo 10^9 + 7.

Completed wordBreak() function which takes a string and list of strings as a parameter and returns 1 if it is possible to break words, else return 0.
No need to read any input or print any output as it was done by driver code.

No need to read input or print anything. Your task is to complete function minJumps() which takes the array arr and it's size N as input parameters and returns the minimum number of jumps. If not possible returned -1.