SDE - Intern

You are given a string 'S' containing dots(.) and asterisks(*) only, where the dot represents free spaces, and the asterisk denotes lamps. A lamp can lighten up its own cell as well as its immediate neighboring cells. You need to determine the minimum number of extra lamps that have to be installed at some free spaces in the string so that the whole string will be illuminated i.e. all the indices of the string can have access to the light of some lamp.

Note :

If a lamp is present at index 'I', then it illuminates index 'I' - 1, 'I' and 'I' + 1.

If a lamp is present at index 0, then it illuminates only 0 and 1.

Given that the length of the string is greater than or equal to 2.

If a lamp is present at the last index, then it illuminates the last and the second last index, given that the length of the string is greater than or equal to 2.

The length of each string is guaranteed to be at least 1.

Mukesh is a hard worker and has a good running business. He has a list of profits he made in the last ‘N’ days. Mukesh wants to know what maximum profit he made in the few consecutive days. More Precisely he wants to know the maximum profit he made in any consecutive days in the range {‘A’, ‘B’} ( both inclusive).

You have to find the maximum profit Mukesh made in any consecutive days in the range {‘A’, ‘B’} ( both inclusive).

Note :

The profit of the Mukesh Business over ‘N’ days is shown by array/list ‘profit’. It may contain negative values as there will be a loss on those days.

Design and implement a data structure which supports the following operations:

insert(X): Inserts an element X in the data structure and returns true if the element was not present, and false otherwise.

remove(X): Removes the element X from the data structure, if present. Returns true if the element was present and false otherwise.

search(X): Search the element X in the data structure. Returns true if the element was present and false otherwise.

getRandom(): Return a random element present in the data structure.

Four types of queries denote these operations:

Type 1: for insert(X) operation.
Type 2: for remove(X) operation.
Type 3: for search(X) operation.
Type 4: for getRandom() operation.

Note:

It is guaranteed that at least one element will be present in the data structure when getRandom() operation is performed.

Follow Up:

Can you implement every operation such that it works in O(1) time?

What are semaphores?
What is virtual memory?

You are playing a video game, which contains an N x N grid. You start on the top left cell of the grid, and are free to move anywhere through the grid, any number of times.

Each cell in the grid has some number of points that you can collect from it and you can collect points at most once from each cell. Furthermore, it is possible to collect points from a cell, if and only if the cell lies on one of the two diagonals of the grid. Print the maximum number of points you can collect, given the grid.

For example:

If the grid is:
1 2
3 4
We can collect points from all cells as each cell lies on a diagonal. So, the maximum points will be 1+2+3+4 = 10.

1. Why did you decide to apply to this role?
2. What experience do you have that would be relevant to this role?
3. Tell me about your experience in …
4. What did you like most about the job description?
5. Why are you leaving your current job? / Why did you leave your previous job?
6. What do you know about our company’s product/services?
7. Tell me about this gap in your resume.