Senior Software Engineer

You are given two positive integers M and K, your task is to find the maximum integer possible, by swapping at most K digits of M.

You can perform a maximum of K swap operations. If the integer becomes maximum in less than K operations, you can stop and return the output.

Note:- For simplicity, you will be provided with the integer M in the form of a ‘string’ data type for easier swap operations.

Example:-
INPUT : M = 123 , K = 1
OUTPUT: 312

In the above example, K = 1, hence only 1 swap operation is available.
Operation 1: Swap 1 with 3 so the integer becomes 312

INPUT : M = 567392 , K = 3
OUTPUT: 976532

In the above example, K = 3, hence a maximum of 3 swap operation available
Operation 1: Swap 5 with 9 so the integer becomes 967352
Operation 2: Swap 6 with 7 so the integer becomes 976352
Operation 3: Swap 3 with 5 so the integer becomes 976532

INPUT : M = 751, K = 2
OUTPUT: 751

In the above example, No swaps are required as it is already the maximum possible integer with that set of digits.

INPUT : M = 3849 , K = 0
OUTPUT: 3849

In the above example, K = 0, hence no swap operations are available.

You have been given a string STR and a non-empty string PTR. Your task is to find all the starting indices of PTR’s anagram in STR.

An anagram of a string is another string which contains the same characters and is obtained by rearranging the characters.

For example: ‘SILENT’ and ‘LISTEN’ are anagrams of each other. ‘ABA’ and ‘ABB’ are not anagram because we can’t convert ‘ABA’ to ‘ABB’ by rearranging the characters of particular strings.

Note:

1. Both STR and PTR consist of English uppercase letters.
2. Length of string 'STR' will always be greater than or equal to the length of string ‘PTR’.
3. In case, there is no anagram substring, then return an empty sequence.
4. In case of more than one anagrams, return the indices in increasing order.

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:

The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.

Follow Up :

Can you solve this problem in O(N) time and O(1) space complexity?

You have been given a string 'S' containing only three types of characters, i.e. '(', ')' and '*'.

A Valid String is defined as follows:

1. Any left parenthesis '(' must have a corresponding right parenthesis ')'.
2. Any right parenthesis ')' must have a corresponding left parenthesis '('.
3. Left parenthesis '(' must go before the corresponding right parenthesis ')'.
4. '*' could be treated as a single right parenthesis ')' or a single left parenthesis '(' or an empty string.
5. An empty string is also valid.

Your task is to find out whether the given string is a Valid String or not.

Introduce yourself.

What are your strengths and weaknesses?

Where do you see yourself in 5 years?

Could you give me an example of a time you showcased your leadership skills?