SDE - 2

The office doors can only be open by using the ‘key-cards’ given to the workers. Whenever a worker uses their ‘key-card’ to unlock the door, the office’s security system saves his name and the time when he used it in ‘any order’. The security system programmed in such a way that, if any worker uses the ‘key-card’ strictly “more than two times in one hour”, then the system emits an ‘alert’.

You are given two string arrays ‘keyName’, and ‘keyTime’, denoting the ‘name’ and the ‘time’ of the worker when he used his ‘key-card’ in a “single day”. Your task is to find the list of “unique worker” names who received an ‘alert’.

Note:

1. The ‘keyName’ contains only the lower-case English alphabets.

2. The ‘keyTime’ is given in the 24-hour format “HH:MM”, such as “00:00”, “13:35”, and “23:59” are some of the valid times.

3. “08:05 - 09:05” is considered to be within a ‘one-hour’, whereas “12:05 - 13:06” is not considered to be within a ‘one-hour’ period.

4. The system saves the ‘name’ and the ‘time’ of the workers in ‘any order’.

5. Each pair of [‘keyName’, ‘keyTime’] is ‘unique’.

6. Print the output in ‘increasing’ order alphabetically. 

You are given two integers N and M. Can you find a number closest to N and divisible by M.

Here closest number to N means a number whose absolute difference is minimum with N. If there are two integers closest to N then the answer will be the one which is a smaller integer.

For Example:

Let N = 8 and M = 3
The numbers divisible by 3 are 3, 6, 9, …
From these numbers 9 is closest to 8. Thus, the answer is 9.

Tanmay and Rohit are best buddies. One day Tanmay gives Rohit a problem to test his intelligence and skills. He gives him an array of N natural numbers and asks him to solve the following queries:-

Query 0 :

0 x y

This operation modifies the element present at index x to y.

Query 1 :

1 x y 

This operation counts the number of even numbers in range x to y inclusive.

Query 2 :

2 x y 

This operation counts the number of odd numbers in range x to y inclusive.

You are given a string ‘str’.

Find the longest prefix in the string which is also a suffix of the string, excluding the string itself.

If there's no such string return an empty string "".

Example:

Input: ‘str’ = ‘ababcdabab’ 

Output: 'abab'

Explanation:
Here the prefix ‘abab’ is equal to the suffix ‘abab’. The length of the prefix is 4. There's no other prefix that has length > 4 and is also present as a suffix. Hence the answer is 'abab'. 

A thief wants to loot houses. He knows the amount of money in each house. He cannot loot two consecutive houses. Find the maximum amount of money he can loot.

You are given a 2-D matrix consisting of 0’s and 1’s with ‘N’ rows and ‘N’ columns, you are supposed to find all paths from the cell (0,0) (top-left cell) to the cell (N-1, N-1)(bottom-right cell). All cells with value 0 are blocked and cannot be travelled through while all cells with value 1 are open.

If you are currently at cell (x,y) then you can move to (x+1,y)(denoted by ‘D’), (x-1,y)(denoted by ‘U’), (x,y+1)(denoted by ‘R’), (x,y-1)(denoted by ‘L’) in one move. You cannot move out of the grid.

Example :

Create LLD/ classes including functions and parameters for a system on which a traveler can marks the places he/she has visited and location of places he/she is willing to visit.

Introduce yourself

What are your hobbies?

Tell us about your previous working roles?

What do you expect from us?