## Print Right View of a Binary Tree

Given a binary tree, write an efficient algorithm to print right view of given binary tree.

Coding made easy

Given a binary tree, write an efficient algorithm to print right view of given binary tree.

Given a directed acyclic graph (DAG), print it in Topological order using Kahn’s Topological Sort algorithm. If the DAG has more than one topological ordering, print any of them.

Given a set S, generate all distinct subsets of it i.e., find distinct power set of set S. A power set of any set S is the set of all subsets of S, including the empty set and S itself.

Given a binary tree, write an iterative algorithm to print leaf to root path for every leaf node of binary tree. Use of Recursion is prohibited.

Given a binary search tree, find a pair with given sum present in it.

Given a binary tree, write an efficient algorithm to compute maximum width of it.

Consider a directed graph where weight of itsÂ edges can be one of x, 2x or 3x (x is a given integer), compute the least cost path from source to destination efficiently.

Given a square matrix, print maximum length snake sequence in it. A Snake sequence is defined as a sequence of numbers where each new number, which can only be located to the right or down of the current number, is either plus or minus one.

In k-partition problem, we need to partition an array of positive integers into k disjoint subsets that all have equal sum and they completely covers the set.

3-partition problem: Given a set S of positive integers, determine if it can be partitioned into three disjoint subsets that all have same sum and they cover S.

Given an array A which represents a binary tree such that the parent-child relationship is defined by (A[i], i) for every index i in the array A, build binary tree out of it.

Given an array of integers, find a subset in it that has maximum product of its elements.