SDE - 1

You’re given a 2 dimensional array 'GRID' of N * M size, representing a Gold mine. Each cell of this grid contains an integer that represents the amount of gold present in that cell.

Your task is to return the maximum amount of gold you can collect using the following conditions:

1. Every time you reach a cell, you collect all the gold present in that cell.


2. You can go one step left, right, up, or down from your current cell’s position.

3. You can’t visit the cell which you have already visited.

4. You can’t visit a cell with 0 gold.

5. You can choose any cell to start and stop collecting gold.

Given a list of processes where each value represents the memory consumption of a process and a variable mmm represents the number of processes to be removed, we need to delete mmm contiguous processes from the list and return the minimum amount of main memory used by the remaining processes.

Given an array arr[] of size N and an integer X, the task is to find the number of ordered pairs (i, j) such that i != j and X is the concatenation of the numbers arr[i] and arr[j]

Given a binary 2D matrix, find the number of islands. A group of connected 1s forms an island.

Given an array of n integers. Count the total number of sub-arrays having total distinct elements, the same as that of the total distinct elements of the original array.

Asked about the types of indexing and how indexing can be applied. (Learn)

Where do you see yourself in 5 years?

What tech stack did you use in your project?

What are the challenges did you face while making your project?