Q given an array {1,9,11,2,4,6,7,10} , print all the possible BST.
Q. given target array {1,6,5,4,2,0,2}, in one operation you could only increment a subarray by one, print the min step possible to reach to target array if your initial array is {0,0,0,0,0,0,0}