SDE - 1

You are given two strings ‘A’ and ‘B’ of length ‘N’ and ‘M’ respectively. You need to construct a new string ‘C’ by merging both strings in such a way that the relative order of characters in ‘A’ and ‘B’ is the same in string ‘C’.

For example, if the string ‘A’ is of length 3 then the first character of string ‘A’ should be placed before the second and third characters of string ‘A’ in string ‘C’. Similarly, the second character of string ‘A’ should be placed after the first character and before the third character of string ‘A’ in string ‘C’.

The cost of merging the strings is given by the number of consecutive characters in string ‘C’ that are not equal + 1, i.e. ‘C[ i ] != ‘C[ i + 1]’.

Find the minimum cost of merging both strings.

Example:

Input: ‘N’ = 3, ‘M’ = 3, ‘A’ = aba, ‘B’ = aab 

Output: 3

One of the valid strings with minimum cost after merging ‘A’ and ‘B’ is ‘aaabba’. The order of characters of string ‘A’ as well as ‘B’ is maintained in the string ‘aaabba’ and the cost of this string is (1 + 2) = 3.

You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.

You can assume that the value of N will always be greater than 1. So, the answer will always exist.

Second Highest Salary. (Practice)

1. In React how many ways we can style the website. (Learn)
2. Difference between ReactJS and NextJS. (Learn)
3. Explain how DOM in reacting works. (Learn)
4. How state was managed before React Hooks was introduced. (Learn)

Introduce yourself briefly.

Why do you want to join us?

Where do you see yourself in 5 years?