SDE - 1

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.

No one knows about Ninja, what he is thinking and what he wants to do. Now Ninja asks for the family tree from his father. His family tree is in the form of a binary tree and each node ( or we can say a family member ) is mentioned with some integer. Now his father asks him to write a code so that he is able to calculate the sum of all child nodes with even grandparents, that is, the grandparents node with an even integer value.

So your task is to calculate the sum of values of all nodes that have even valued grandparents. Grandparents refer to the parent of the parent node or we can say the two levels above node is a grandparent node.

Example :

Consider the following binary tree :

So the sum of child nodes having even valued grandparents is ‘4 + 8 + 1 + 9 + 2 = 24’

Design a parking lot

URL Shortener