Find triplet with given sum in an array.
Given an array of unsorted integers and a value k. Write a code to determine whether or not there exist three elements in array whose sum is equal to k.
Return true if triplet exist else return false.
For example:
Example 1:
Input: {1, 4, 45, 6, 10, 8} k = 13 Output: true (1, 4, 8)
Example 2:
Input: {2, 7, 4, 0, 9, 5, 1, 3} k = 6
Output: true {(2, 4, 0), (5, 1, 0), (1, 2, 3)}
Given a binary tree, write a code to print its reverse level order traversal.
For example:
The reverse or bottom-up level order traversal of this binary tree is 4, 3, 2, 1, 6, 5, 7.
In this example, first we printed last level then second last level and so on. So, we have to start printing the level from bottom-up.
Maximum consecutive ones II. Given an array which only consists of 0s and 1s. Write a code to find the maximum number of consecutive 1s in an array, if you can flip at most one 0.
For example:
Input: {1, 1, 0, 0, 1, 1, 1, 1, 1}
Output: 6
In this example, If we can flip at most one zero then the maximum number of consecutive 1s in an array is 6 {1, 1, 1, 1, 1, 1}.