SDE - 2

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

Given a binary tree of integers, you are supposed to modify the given binary tree to a sum tree where each node value is replaced by the sum of the values of both left and right subtrees in the given tree. The value of leaf nodes is changed to zero.

Example:

Below is the example showing the input tree and its sum tree.  

You have been given a text message. You have to return the Run-length Encoding of the given message.

Run-length encoding is a fast and simple method of encoding strings. The basic idea is to represent repeated successive characters as the character and a single count. For example, the string "aaaabbbccdaa" would be encoded as "a4b3c2d1a2".

You are given an array 'NUM' consisting of N positive Integers. Your task is to find the total number of possible sequences of positive integers (greater than 1) whose product is 'X'.

The value of 'X' is calculated as the product of the N terms, where the ith term is generated by raising the ith prime number to the power of an ith element in the given array.

In mathematical terms, we can write X as:

X = 2 ^ NUM[1] * 3 ^ NUM[2] * 5 ^ NUM[3] * 7 ^ NUM[4] * 11 ^ NUM[5] * … up to Nth term

Note :

1. Sum of all the elements in the array 'NUM' will always be less than or equal to 400.
2. As the total number of such sequences can be very large, print the answer modulo 1000000007.

Why C++? The difference between C++ and C. (Learn)
What are constructors? Why are they used? What is the syntax for writing a constructor? (Learn)
What is OOPS? Explain the four pillars of OOPS with examples. (Learn)
What is foreign key, candidate key, and primary key? (Learn)
Different sorting algorithms. (Learn)
What is big data, machine learning, and IoT? (Learn) (They do not expect formal definitions. Support your answers with examples.)
They gave some code snippets and asked whether the code was right or wrong, as well as some output prediction questions. These questions were a little tricky.
They also asked me to write code in an online compiler. In my case, the code was based on Binary Search.
A brief discussion about the projects mentioned in the resume.

About relocation, plans for further study, different products of TCS, whether I had any issues working in shifts, and whether I had any backlogs or year gaps.