Namespaces

• namespace add_binary_strings Given two binary strings A and B consisting of only 0s and 1s. Find the resultant string after adding the two Binary Strings. Note: The input strings may contain leading zeros but the output string should not have any leading zeros.
• namespace binary_tree_from_string_with_bracket_representation Construct Binary Tree from String with bracket representation Construct a binary tree from a string consisting of parenthesis and integers. The whole input represents a binary tree. It contains an integer followed by zero, one or two pairs of parenthesis. The integer represents the roots value and a pair of parenthesis contains a child binary tree with the same structure. Always start to construct the left child node of the parent first if it exists.
• namespace full_binary_trees Count the Number of Full Binary Trees Given an array arr[] of n integers, where each integer is greater than 1. The task is to find the number of Full binary tree from the given integers, such that each non-leaf node value is the product of its children value.
• namespace greeter
• namespace maximum_sub_array Find out the maximum sub-array of non negative numbers from an array.
• namespace shenyrash_and_his_bits Shreyansh and his bits.