SDE - 1

Gary has a sequence 'ARR', consisting of 'N' integers.

We'll call a sequence ARR[i],  ARR[i+1], ..., ARR[j] where 1  ≤  i  ≤  j  ≤  N a subsegment of the sequence ARR. The value (j - i + 1) denotes the length of the subsegment.

Your task is to find the longest subsegment of ARR, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.

You need to return the length of the maximum subsegment that you can find by changing only one integer in the given sequence.

You are given an array 'arr' of length 'n', consisting of integers.

A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.

Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.

The sum of an empty subarray is 0.

Example :

Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]

Output: 11

Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].

You are given an arbitrary binary tree consisting of N nodes, your task is to find all the nodes of the tree that do not have a sibling.

A binary tree is a tree where every node has at most two child nodes.

Two nodes in a tree are called siblings if they are children of the same parent node i.e they have the same immediate ancestor node.

Note:

1. The root node is not considered as the node with no sibling.
2. If there are no such nodes, return -1.

For example, consider the following binary tree:

Here node 4 and 7 do not have any siblings.

Topic: impacts on social websites

Given two strings S and T consisting of lower case English letters. The task is to count the distinct occurrences of T in S as a subsequence.

A subsequence is a sequence generated from a string after deleting some or no characters of the string without changing the order of the remaining string characters. (i.e. “ace” is a subsequence of “abcde” while “aec” is not).

For example, for the strings S = “banana” and T=”ban”, output is 3 as T appears in S as below three subsequences.

[ban], [ba n], [b an ]

You have been given a binary tree of integers. You are supposed to serialize and deserialize (refer to notes) the given binary tree.

You can choose any algorithm to serialize/deserialize the given binary tree. You only have to ensure that the serialized string can be deserialized to the original binary tree.

Note :

Serialization is the process of translating a data structure or object state into a format that can be stored or transmitted (for example, across a computer network) and reconstructed later. The opposite operation, that is, extracting a data structure from stored information, is deserialization.

What you do and what not?

 HR asked about my family background, what are my hobbies, what should I do in my free time?