SDE - 2

Given an initial number x and two operations which are given below:
a) Multiply the number by 2.
b) Subtract 1 from the number.
The task is to find out the minimum number of operations required to convert the number x into y using only the above two operations. We can apply these operations any number of times.

Input : x = 4, y = 7
Output: 2
1.⁠ ⁠4*2 = 8
2.⁠ ⁠8-1 = 7

Given a string s of length n, find the alphabetically largest subsequence of length i possible for each i where (1 ≤ i ≤ n).
Note: A subsequence is a string left after deleting some or no characters from the original string without changing their order. For example, "ac" is a subsequence of "abcd" but "ca" is not.

Example
Consider s = "hrw". The alphabetically largest subsequence

of length 1 is "w".
of length 2 is "rw".
of length 3 is "hrw".
The answer is ["w", "rw", "hrw"], without quotes.

Given an array arr[] where each element represents the maximum number of steps that can be made forward from that index, the task is to find the minimum number of jumps to reach the end of the array starting from index 0.

Input: arr[] = {1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9}
Output: 3 (1-> 3 -> 9 -> 9)

Given string str of lower case English alphabets. One can choose any two characters in the string and replace all the occurrences of the first character with the second character and replace all the occurrences of the second character with the first character. Find the lexicographically smallest string that can be obtained by doing this operation at most once.

Input: str = “ccad”
Output: aacd

Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations:

1. get(key) - Return the value of the key if the key exists in the cache, otherwise return -1.

2. put(key, value), Insert the value in the cache if the key is not already present or update the value of the given key if the key is already present. When the cache reaches its capacity, it should invalidate the least recently used item before inserting the new item.

You will be given ‘Q’ queries. Each query will belong to one of these two types:

Type 0: for get(key) operation.
Type 1: for put(key, value) operation.

Note :

1. The cache is initialized with a capacity (the maximum number of unique keys it can hold at a time).

2. Access to an item or key is defined as a get or a put operation on the key. The least recently used key is the one with the oldest access time.

Mostly standard HM questions and about the project, I will list down a few
 

1. Tell me about yourself.
2. Why are you leaving your current organisation?
3. Went deep into the project.
4. Few questions on system design.
5. Most challenging project and why?
6. The time when you went above your responsibilities.