Software Development

Given a binary tree. Your task is to print the bottom right view of the binary tree.

Bottom right view, on viewing the given binary tree at the angle of 45 degrees from the bottom right side.

For Example

In the above binary tree, only node { 4, 5, 6 } is visible from the bottom right only node ‘1’ and node ‘3’ are hidden behind node ‘6’.
node ‘2’ is hidden behind node ‘5’.

You have been given an array(ARR) of positive integers and an integer X. You have to find the minimum length subarray such that the sum of all of its elements is strictly greater than the given integer X.

Note:

A subarray is a contiguous block of elements that can be formed by deleting some (possibly zero) elements from the beginning or the end of the original array. 

For example :

If the given array is [1, 2, 3, 4, 5], then [2, 3, 4], [1, 2], [5] are some subarrays while [1, 3], [2, 3, 5] are not.

If there are multiple subarrays with minimum length, find one which appears earlier in the array (i.e. subarray that starts with lower index).

If there is no such subarray, print an empty line.

Design a coupon/offers system - Customers must be intimated of new offers, offers must have an expiry date, and can be used by a customer only a certain no. of times.

• Share a difficult situation you faced in your work. How did you handle that?
• How do you ensure your learning as an individual continues?