1.Consecutive ones in array. 2.Max in array, provide solution using thread if a system has 4 cores available. then max should be computed using all the 4 cores instead of running only on one core. 3. Find shortest path to reach at end of the row, in a 2D matrix containing ones and zeros. Ones are the cells can be traversed and Zeros can't be jumped. 4. Convert a max heap to min heap
Check out your Company Bowl for anonymous work chats.