Software Engineer

You are given an integer N. Your task is to convert the number to its equivalent Hexadecimal.

Note - All letters in Hexadecimal (A-F) must be in uppercase.

For example:

If N = 50, then output will be 32.
If N = -50, then output will be FFFFFFCE.

Ninja has been given a program to do basic string compression. For a character that is consecutively repeated more than once, he needs to replace the consecutive duplicate occurrences with the count of repetitions.

Example:

If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".

The string is compressed only when the repeated character count is more than 1.

Note :

The consecutive count of every character in the input string is less than or equal to 9.

How Spring boot application works , hibernate questions .
Garbage collector algorithims , string questions .

1.How to resolve cross team dependecy . 
2. Where you see yourself down the line after 5 years . 
It was general interview not such technical .