SDE - 1

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

For example:

[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.

Given an array arr of length N consisting of positive and negative integers, return the length of the longest subarray whose sum is zero.

Given a rod of length ‘N’ units. The rod can be cut into different sizes and each size has a cost associated with it. Determine the maximum cost obtained by cutting the rod and selling its pieces.

Note:

1. The sizes will range from 1 to ‘N’ and will be integers.

2. The sum of the pieces cut should be equal to ‘N’.

3. Consider 1-based indexing.

You have been given a perfect binary tree of 'N' nodes. Your task is to reverse alternate levels of the given binary tree. That is reverse level 2, level 4, level 6, and so on. The root is at level 1.

A perfect binary tree is a binary tree in which all the interior nodes have two children, and all leaves have the same depth or same level.

Example :

Given binary tree :

After the reversal of alternate nodes, the tree will be :

Query on joining two different tables

What businesses does ola have?

Personal questions about family

Why do you want to join ola?