SDE - 1

You have been given the root of two binary trees ‘ROOT1’ and ‘ROOT2’. You need to find if the two trees are flip equivalent or not after performing some flip operations on ‘TREE1’.

A flip operation is defined as: Choose any node and swap the left and right subtrees of that node.

Note:

All the values of the tree are unique.

For Example:

For the given binary trees

Tree 1 can be made flip equivalent to Tree 2 by flipping the left and right sub trees of the node with value = 2. 

You are given an integer array/list ‘ARR’ of size 'N' that is sorted in ascending order. Your task is to return '1' if and only if you can split it into one or more increasing subsequences such that each subsequence consists of consecutive integers and has a length of at least 3. Else, return '0'.

Note: An increasing sequence is a sequence where the difference between ith and i + 1th number is 1 exactly. For example : 1, 2, 3, 4 or 3, 4, 5 or -1, 0, 1 are all increasing subsequences.

For example:

Given ‘N’ = 4 and ‘ARR’[] = 1, 2, 3, 4.
The answer will be ‘1’ because an increasing subsequence of [1, 2, 3, 4]  having length greater than 3 can be made.

Ninja is given a few numbers, and he is being asked to rearrange the numbers so that every second element is greater than its left and right element.

Suppose the given array is [1, 2, 3, 4, 5] then the rearranged array can be [1, 3, 2, 5, 4].

You have measure 4litre using 3 cups of 3,5 and 8 litres.

This round was completely about my projects and my previous internships. There was lot of drilling on my projects like motive behind doing it.Futher improvement in Your project.

No problems were asked just said do u want to ask about me or the company. And how was my interview experience.