SDE - 1

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++. Difference between C++ and C.
What’s constructors. Why are they used? Syntax of writing a constructor.
What is OOPS. Explain 4 pillars of OOPS along with examples.
What is foreign key, candidate key and primary key.
Different sorting algorithms.
What is big data, machine learning, IoT? (They do not expect formal definitions. Support your answers with examples)
They gave some code snippets and asked whether the code is right or wrong. Also some output prediction questions. These questions were a little tricky.
They also asked to write a 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
If any issue working in shifts
Inquired whether I had any backlogs or year gaps.