SDET-Intern

Ninja loves beautiful numbers and also has two integers, ‘L’ and ‘R’, denoting an interval [L, R].

Given the interval [L, R], Ninja wants you to find the number of Beautiful numbers in the interval.

A Beautiful Number is a number that:

Becomes 1 by repeatedly replacing the number with the sum of squares of its digits.

If the number does not become 1, then it’s not a Beautiful Number.

For example, given interval = [1, 3]

We see that 1 is a Beautiful Number but 2,3 are not. Hence the answer is 1.

Output the single integer, the sum of all Beautiful Numbers in the given range.

Example:

Input: ‘L’ = ‘1’ ,  'R' = ‘3’

Output: 1

As ‘1’ is the only Beautiful Number.

3 is not Beautiful as, 
3 -> 9
9 -> 81
81 -> 65
65 -> 61 … and so on
It can be shown that we cannot get 1. 

Given 'N' number of intervals, where each interval contains two integers denoting the boundaries of the interval. The task is to merge all the overlapping intervals and return the list of merged intervals sorted in ascending order.

Two intervals will be considered to be overlapping if the starting integer of one interval is less than or equal to the finishing integer of another interval, and greater than or equal to the starting integer of that interval.

Example:

for the given 5 intervals - [1,4], [3,5], [6,8], [10,12], [8,9].
Since intervals [1,4] and [3,5] overlap with each other, we will merge them into a single interval as [1,5].

Similarly [6,8] and [8,9] overlaps, we merge them into [6,9].

Interval [10,12] does not overlap with any interval.

Final List after merging overlapping intervals: [1,5], [6,9], [10,12]

Given an array of integers, print the minimum of the absolute difference of all possible pairs of elements.

Example :

N = 5
ARR = [ 3, -6, 7, -7, 0 ]
Out of all pairs, (-7,-6) have a difference of ‘1’, and no other pair has less difference. So ‘ANS’ is ‘1’.    

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".

follow up:

Try to solve the problem in O(1) space complexity. 

Given an input string 'S' and a pattern 'P', implement a regular expression matching with the support of two special characters ‘.’ (dot) and ‘*’(asterisk) where

1. ‘.’ matches to any single character.
2. ‘*’ matches to zero or more of the preceding element.

If the input string 'S' matches the pattern 'P', then return true else, return false.

Note:

1. You have to match the entire string with the pattern given.

2. Both the strings, 'S' and 'P' contain only lower-case alphabets.

3. Only the pattern will contain additional characters ‘*’ and ‘.’ along with alphabets.