Register for our webinar

1 hour

Step 1

Step 2

Congratulations!

You have registered for our webinar

Oops! Something went wrong while submitting the form.

Step 1

Step 2

Confirmed

You are scheduled with Interview Kickstart.

Redirecting...

Oops! Something went wrong while submitting the form.

Head of Career Skills Development & Coaching

*Based on past data of successful IK students

Given the altitudes of the regions on a surface, determine the basins where water would collect if poured onto that surface.

Region whose four neighbors (right, left, up and down) are all higher in altitude is called a sink. All the water would collect in sinks. If a region is not a sink, it is guaranteed to have a single lowest neighbor where water will drain to. All regions that drain to a particular sink–directly or indirectly–collectively form one basin. Partition the surface into the basins and return their sizes in the non-decreasing order.

```
{
"matrix": [
[1, 5, 2],
[2, 4, 7],
[3, 6, 9]
]
}
```

Output:

```
[2, 7]
```

There are two basins, one consists of two cells and the other consists of seven. They are labeled with A’s and B’s here:

B B A

B B A

B B B

The sink of basin A is cell (0, 2). The sink of basin B is cell (0, 0).

```
{
"matrix": [
[0, 2, 1, 3],
[2, 1, 0, 4],
[3, 3, 3, 3],
[5, 5, 2, 1]
]
}
```

Output:

```
[4, 5, 7]
```

There are three basins. They are labeled with A, B and C here:

B B C C

B C C C

B C C A

B A A A

The sinks of basins A, B and C are (3, 3), (0, 0) and (1, 2) respectively.

- The function has one argument, a two-dimensional array of integers representing the altitudes of the regions of a rectangular surface.
- Return an array of integers representing the sizes of basins in the non-decreasing order.

Constraints:

- 1 <= total number of regions on the given surface <= 1000000
- 0 <= altitude of any region on the surface <= 1000000

Three solutions that we provided use different techniques to mark the basins, but in the end they all use the Counting Sort algorithm (see IK Sorting class) to sort the basin sizes in linear time.

For convenience, let’s define `n`

as the total number of regions on the given surface. In other words, `n`

is the product of the rows * columns of the given matrix.

In this naive approach we assign each cell a unique ID; we allocate a new matrix called `basins`

to store those IDs. We then iterate over the matrix and change the ID of each cell to the ID of the cell where it drains.

Consider this input matrix for example:

1 5 2

2 4 7

3 6 9

We start by creating a new matrix to store IDs and assign unique ID to each cell:

0 1 2

3 4 5

6 7 8

Then for each cell we change its ID as follows

(0, 0) is a sink so its ID doesn’t change.

(0, 1) drains to its lowest neighbor (0, 0) so we set its ID to 0.

(1, 1) drains to (0, 1) which in turn drains to (0,0) so we set the ID of (1, 1) to 0. We repeat the process for all cells and arrive at this:

0 0 1

0 0 1

0 0 0

Now we just count the total number of occurrences of remaining IDs and return those numbers in the non-ascending order.

O(n^{2}).

To assign an ID to any matrix cell, in the worst case we will traverse the whole matrix; that takes O(n^{2}) time.

The size of the output array is O(n); it takes O(n) time to sort it using the Counting Sort algorithm.

Summing up the two we get O(n^{2}) + O(n) = O(n^{2}).

O(n).

The matrix with the IDs takes O(n).

The recursion stack for the process of calculating the IDs takes O(n), too.

Finally, for the Counting Sort we use another array of size O(n).

O(n) + O(n) + O(n) = O(n).

O(n).

Input, auxiliary space used and the output each take O(n) space. Summing them up we get O(n).

```
/*
* Asymptotic complexity in terms of total number of regions in \`matrix\`(total_rows * total_columns) \`n\`:
* Time: O(n^2).
* Auxiliary space: O(n).
* Total space: O(n).
*/
// Counting Sort. See IK Sorting class or foundation.
void count_sort(vector<int> &arr) {
int max = *max_element(arr.begin(), arr.end());
int min = *min_element(arr.begin(), arr.end());
int range = max - min + 1;
vector<int> count(range), output(arr.size());
for(int i = 0; i < arr.size(); i++) {
count[arr[i] - min]++;
}
for(int i = 1; i < count.size(); i++) {
count[i] += count[i - 1];
}
for(int i = arr.size() - 1; i >= 0; i--) {
output[count[arr[i] - min] - 1] = arr[i];
count[arr[i] - min]--;
}
for(int i = 0; i < arr.size(); i++) {
arr[i] = output[i];
}
}
int get_sink(vector<vector<int>> &matrix, vector<vector<int>> &basins, int row, int column) {
int min_row = row, min_column = column;
// Check element which is at left.
if (column > 0 && matrix[row][column - 1] < matrix[min_row][min_column]) {
min_column = column - 1;
min_row = row;
}
// Check element which is at up.
if (row > 0 && matrix[row - 1][column] < matrix[min_row][min_column]) {
min_column = column;
min_row = row - 1;
}
// Check element which is at down.
if (row < matrix.size() - 1 && matrix[row + 1][column] < matrix[min_row][min_column]) {
min_column = column;
min_row = row + 1;
}
// Check element which is at right.
if (column < matrix[0].size() - 1 && matrix[row][column + 1] < matrix[min_row][min_column]) {
min_column = column + 1;
min_row = row;
}
if (row == min_row && column == min_column){
// If we reached at sink.
return basins[min_row][min_column];
}
// Recursively call to get sink for element matrix[min_row][min_column].
return get_sink(matrix, basins, min_row, min_column);
}
vector<int> find_basins(vector<vector<int>> &matrix) {
int row_count = matrix.size();
int column_count = matrix[0].size();
// To maintain ids of each element of matrix.
vector<vector<int>> basins(row_count, vector<int>(column_count));
int index = 0;
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
basins[i][j] = index++;
}
}
// To maintain id wise count of elements which will sink in that id.
unordered_map<int, int> basin_indexes;
for (int i = 0; i < row_count; i++) {
for (int j = 0; j < column_count; j++) {
int sink = get_sink(matrix, basins, i, j);
basin_indexes[sink] = basin_indexes[sink] + 1;
}
}
vector<int> basin_sizes;
for (auto pair : basin_indexes) {
basin_sizes.push_back(pair.second);
}
// Sorting by size of sinks.
count_sort(basin_sizes);
return basin_sizes;
}
```

One observation to make is that the cell with the lowest altitude in the entire matrix will always be a sink. Another one is that all the neighbors of the lowest cell will drain to that cell.

We can use these observations to systematically group cells into basins.

- Create a new matrix and initialize all cells with -1 (unmarked).
- Now iterate over the cells from lowest to highest altitude.
- If the current cell is unmarked, mark it with a new unique ID.
- Mark all its unmarked neighbors with the same ID.
- Finally, count how many times each unique ID occurs in the matrix and return those counts in the non-ascending order.

Consider this input matrix for example:

1 5 2

2 4 7

3 6 9

The matrix with IDs in the beginning:

-1 -1 -1

-1 -1 -1

-1 -1 -1

Start with the lowest altitude, that is 1 at (0, 0) and mark it with a new ID 0. Then change all its neighbors’ IDs to 0 too.

0 0 -1

0 -1 -1

-1 -1 -1

Next lowest regions are (0, 2) and (1, 0) with the altitude 2.

(0, 2) is unmarked, so we mark it with a new ID of 1. We skip the neighbor already marked and mark the remaining one with the same ID of 1.

0 0 1

0 -1 1

-1 -1 -1

(1, 0) is already marked so we change its unmarked neighbors’ IDs to be the same as it has.

0 0 1

0 0 1

0 -1 -1

Continue this until all cells have been processed. At that point the matrix will look like this:

0 0 1

0 0 1

0 0 0

It has two unique basin IDs. We now count how many times each of them occurs, sort those counts in the non-descending order and return.

O(n * log(n)).

Populating the sorted map of altitudes takes O(n * log(n)) time.

Processing cells afterwards takes constant time per cell, so O(n) for all cells.

The number of basins is O(n). It takes O(n) time to sort their sizes using the Counting Sort algorithm.

Summing up everything we get O(n * log(n)) + O(n) + O(n) = O(n * log(n)).

O(n).

Keeping track of the IDs of the matrix cells takes O(n) space.

The sorted map of the altitudes takes O(n) space, too.

The data structure we use for the Counting Sort takes another O(n).

Summing up everything we get O(n) + O(n) + O(n) = O(n).

O(n).

Input, auxiliary space used and the output each take O(n) space. Summing them up we get O(n).

```
/*
* Asymptotic complexity in terms of total number of regions in \`matrix\`(total_rows * total_columns) \`n\`:
* Time: O(n * log(n)).
* Auxiliary space: O(n).
* Total space: O(n).
*/
// Counting Sort. See IK Sorting class or foundational
void count_sort(vector<int> &arr) {
int max = *max_element(arr.begin(), arr.end());
int min = *min_element(arr.begin(), arr.end());
int range = max - min + 1;
vector<int> count(range), output(arr.size());
for(int i = 0; i < arr.size(); i++) {
count[arr[i] - min]++;
}
for(int i = 1; i < count.size(); i++) {
count[i] += count[i - 1];
}
for(int i = arr.size() - 1; i >= 0; i--) {
output[count[arr[i] - min] - 1] = arr[i];
count[arr[i] - min]--;
}
for(int i=0; i < arr.size(); i++) {
arr[i] = output[i];
}
}
vector<int> find_basins(vector<vector<int>> &matrix) {
int row_count = matrix.size();
int column_count = matrix[0].size();
// To maintain ids of each element of matrix
vector<vector<int>> basins(row_count, vector<int>(column_count, -1));
// Sorted map with altitudes as keys
// and the list of cell coordinates with that altitude as values.
map<int, vector<pair<int, int>>> altitudes;
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
altitudes[matrix[i][j]].push_back(make_pair(i, j));
}
}
int basin_index = 0;
for (auto list_of_coords : altitudes) {
for (pair<int, int> coordinates : list_of_coords.second) {
int row = coordinates.first;
int column = coordinates.second;
// If element itself is a sink.
if (basins[row][column] == -1){
basins[row][column] = basin_index++;
}
// Check element which is at left.
if (column > 0 && basins[row][column - 1] == -1){
basins[row][column - 1] = basins[row][column];
}
// Check element which is at up.
if (row > 0 && basins[row - 1][column] == -1){
basins[row - 1][column] = basins[row][column];
}
// Check element which is at down.
if (row < matrix.size() - 1 && basins[row + 1][column] == -1){
basins[row + 1][column] = basins[row][column];
}
// Check element which is at right.
if (column < matrix[0].size() - 1 && basins[row][column + 1] == -1){
basins[row][column + 1] = basins[row][column];
}
}
}
vector<int> basin_sizes(basin_index);
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
basin_sizes[basins[i][j]]++;
}
}
// Sorting by size of sinks.
count_sort(basin_sizes);
return basin_sizes;
}
```

This is an optimized version of the brute force approach. The difference is that here we mark all the cells we passed through while calculating the sink of a particular cell and ignoring any cell already processed.

- Matrix called
`basins`

is initialized with -1 (unmarked). It will store the basin IDs in the end. - Iterate over the matrix cells, skip cells already marked. In the loop, call the recursive function
`get_sink`

on the current cell and mark the current cell with the ID returned by that function. - Function
`get_sink`

recursively calls itself with the cell the current cell drains to–until we reach a sink or a cell that’s already marked (assigned an ID). It returns the ID of the deepest cell it reached in the recursion:- If it’s reached a marked cell, it returns its ID.
- Else it must be a sink. Mark it with a new unique ID and return that ID.

Consider this input matrix for example:

1 5 2

2 4 7

3 6 9

Initialize `basins`

ID matrix:

-1 -1 -1

-1 -1 -1

-1 -1 -1

(0, 0) with altitude 1 happens to be a sink, so we mark it with 0.

(0, 1) with altitude 5 drains to (0, 0) which is a sink, so we mark it with that sink’s ID, that’s 0.

(0, 2) with altitude 2 happens to be a sink, so we mark it with a new unique ID, that would be 1.

After processing three cells of the first row, `basins`

matrix looks like this:

0 0 1

-1 -1 -1

-1 -1 -1

We continue processing the rest of the cells like that and end up with `basins`

matrix looking like this:

0 0 1

0 0 1

0 0 0

It has two unique basin IDs. We now count how many times each of them occurs, sort those counts in the non-descending order and return.

O(n).

Unlike the brute force algorithm, here we won’t process any cell more than once because we mark the cells already processed; and it still takes constant time to process any one cell. Therefore the main processing loop now takes O(n) time.

Counting Sort still takes O(n) time, too.

O(n) + O(n) = O(n).

O(n), same as in the brute force approach.

The matrix with the IDs takes O(n) space.

The recursion stack for the process of calculating the IDs takes O(n), too.

Finally, for the Counting Sort we use another array of size O(n).

O(n) + O(n) + O(n) = O(n).

O(n).

Input, auxiliary space used and the output each take O(n) space. Summing them up we get O(n).

```
/*
* Asymptotic complexity in terms of total number of regions in \`matrix\`(total_rows * total_columns) \`n\`:
* Time: O(n).
* Auxiliary space: O(n).
* Total space: O(n).
*/
// Counting Sort. See IK Sorting class or foundation.
void count_sort(vector<int> &arr) {
int max = *max_element(arr.begin(), arr.end());
int min = *min_element(arr.begin(), arr.end());
int range = max - min + 1;
vector<int> count(range), output(arr.size());
for(int i = 0; i < arr.size(); i++) {
count[arr[i]-min]++;
}
for(int i = 1; i < count.size(); i++) {
count[i] += count[i-1];
}
for(int i = arr.size()-1; i >= 0; i--) {
output[ count[arr[i]-min] -1 ] = arr[i];
count[arr[i]-min]--;
}
for(int i=0; i < arr.size(); i++) {
arr[i] = output[i];
}
}
int get_sink(vector<vector<int>> &matrix, vector<vector<int>> &basins, int row, int column, int basin_index) {
if (basins[row][column] == -1) {
int min_row = row, min_column = column;
// Check element which is at left.
if (column > 0 && matrix[row][column - 1] < matrix[min_row][min_column]) {
min_column = column - 1;
min_row = row;
}
// Check element which is at up.
if (row > 0 && matrix[row - 1][column] < matrix[min_row][min_column]) {
min_column = column;
min_row = row - 1;
}
// Check element which is at down.
if (row < matrix.size() - 1 && matrix[row + 1][column] < matrix[min_row][min_column]) {
min_column = column;
min_row = row + 1;
}
// Check element which is at right.
if (column < matrix[0].size() - 1 && matrix[row][column + 1] < matrix[min_row][min_column]) {
min_column = column + 1;
min_row = row;
}
// If we found sink.
if (min_row == row && min_column == column) {
basins[row][column] = basin_index;
}
else {
// Recursively call to find sink for element matrix[min_row][min_column].
basins[row][column] = get_sink(matrix, basins, min_row, min_column, basin_index);
}
}
return basins[row][column];
}
vector<int> find_basins(vector<vector<int>> &matrix) {
int row_count = matrix.size();
int column_count = matrix[0].size();
// To maintain ids of each element of matrix.
vector<vector<int>> basins(row_count, vector<int>(column_count, -1));
int basin_index = 0;
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
if (get_sink(matrix, basins, i, j, basin_index) == basin_index){
basin_index++;
}
}
}
// To store sink sizes.
vector<int> basin_sizes(basin_index);
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
basin_sizes[basins[i][j]]++;
}
}
// Sorting on sink sizes.
count_sort(basin_sizes);
return basin_sizes;
}
```

We hope that these solutions to creating a mirror image of a binary tree have helped you level up your coding skills. You can expect problems like these at top tech companies like Amazon and Google.

If you are preparing for a tech interview at FAANG or any other Tier-1 tech company, register for Interview Kickstart’s FREE webinar to understand the best way to prepare.

Interview Kickstart offers interview preparation courses taught by FAANG+ tech leads and seasoned hiring managers. Our programs include a comprehensive curriculum, unmatched teaching methods, and career coaching to help you nail your next tech interview.

We offer 17 interview preparation courses, each tailored to a specific engineering domain or role, including the most in-demand and highest-paying domains and roles, such as:

- Back-end Engineering Interview Course
- Front-end Engineering Interview Course
- Full Stack Developer Interview Course

To learn more, register for the FREE webinar.

Note: Input and Output will already be taken care of.

Given the altitudes of the regions on a surface, determine the basins where water would collect if poured onto that surface.

Region whose four neighbors (right, left, up and down) are all higher in altitude is called a sink. All the water would collect in sinks. If a region is not a sink, it is guaranteed to have a single lowest neighbor where water will drain to. All regions that drain to a particular sink–directly or indirectly–collectively form one basin. Partition the surface into the basins and return their sizes in the non-decreasing order.

```
{
"matrix": [
[1, 5, 2],
[2, 4, 7],
[3, 6, 9]
]
}
```

Output:

```
[2, 7]
```

There are two basins, one consists of two cells and the other consists of seven. They are labeled with A’s and B’s here:

B B A

B B A

B B B

The sink of basin A is cell (0, 2). The sink of basin B is cell (0, 0).

```
{
"matrix": [
[0, 2, 1, 3],
[2, 1, 0, 4],
[3, 3, 3, 3],
[5, 5, 2, 1]
]
}
```

Output:

```
[4, 5, 7]
```

There are three basins. They are labeled with A, B and C here:

B B C C

B C C C

B C C A

B A A A

The sinks of basins A, B and C are (3, 3), (0, 0) and (1, 2) respectively.

- The function has one argument, a two-dimensional array of integers representing the altitudes of the regions of a rectangular surface.
- Return an array of integers representing the sizes of basins in the non-decreasing order.

Constraints:

- 1 <= total number of regions on the given surface <= 1000000
- 0 <= altitude of any region on the surface <= 1000000

Three solutions that we provided use different techniques to mark the basins, but in the end they all use the Counting Sort algorithm (see IK Sorting class) to sort the basin sizes in linear time.

For convenience, let’s define `n`

as the total number of regions on the given surface. In other words, `n`

is the product of the rows * columns of the given matrix.

In this naive approach we assign each cell a unique ID; we allocate a new matrix called `basins`

to store those IDs. We then iterate over the matrix and change the ID of each cell to the ID of the cell where it drains.

Consider this input matrix for example:

1 5 2

2 4 7

3 6 9

We start by creating a new matrix to store IDs and assign unique ID to each cell:

0 1 2

3 4 5

6 7 8

Then for each cell we change its ID as follows

(0, 0) is a sink so its ID doesn’t change.

(0, 1) drains to its lowest neighbor (0, 0) so we set its ID to 0.

(1, 1) drains to (0, 1) which in turn drains to (0,0) so we set the ID of (1, 1) to 0. We repeat the process for all cells and arrive at this:

0 0 1

0 0 1

0 0 0

Now we just count the total number of occurrences of remaining IDs and return those numbers in the non-ascending order.

O(n^{2}).

To assign an ID to any matrix cell, in the worst case we will traverse the whole matrix; that takes O(n^{2}) time.

The size of the output array is O(n); it takes O(n) time to sort it using the Counting Sort algorithm.

Summing up the two we get O(n^{2}) + O(n) = O(n^{2}).

O(n).

The matrix with the IDs takes O(n).

The recursion stack for the process of calculating the IDs takes O(n), too.

Finally, for the Counting Sort we use another array of size O(n).

O(n) + O(n) + O(n) = O(n).

O(n).

Input, auxiliary space used and the output each take O(n) space. Summing them up we get O(n).

```
/*
* Asymptotic complexity in terms of total number of regions in \`matrix\`(total_rows * total_columns) \`n\`:
* Time: O(n^2).
* Auxiliary space: O(n).
* Total space: O(n).
*/
// Counting Sort. See IK Sorting class or foundation.
void count_sort(vector<int> &arr) {
int max = *max_element(arr.begin(), arr.end());
int min = *min_element(arr.begin(), arr.end());
int range = max - min + 1;
vector<int> count(range), output(arr.size());
for(int i = 0; i < arr.size(); i++) {
count[arr[i] - min]++;
}
for(int i = 1; i < count.size(); i++) {
count[i] += count[i - 1];
}
for(int i = arr.size() - 1; i >= 0; i--) {
output[count[arr[i] - min] - 1] = arr[i];
count[arr[i] - min]--;
}
for(int i = 0; i < arr.size(); i++) {
arr[i] = output[i];
}
}
int get_sink(vector<vector<int>> &matrix, vector<vector<int>> &basins, int row, int column) {
int min_row = row, min_column = column;
// Check element which is at left.
if (column > 0 && matrix[row][column - 1] < matrix[min_row][min_column]) {
min_column = column - 1;
min_row = row;
}
// Check element which is at up.
if (row > 0 && matrix[row - 1][column] < matrix[min_row][min_column]) {
min_column = column;
min_row = row - 1;
}
// Check element which is at down.
if (row < matrix.size() - 1 && matrix[row + 1][column] < matrix[min_row][min_column]) {
min_column = column;
min_row = row + 1;
}
// Check element which is at right.
if (column < matrix[0].size() - 1 && matrix[row][column + 1] < matrix[min_row][min_column]) {
min_column = column + 1;
min_row = row;
}
if (row == min_row && column == min_column){
// If we reached at sink.
return basins[min_row][min_column];
}
// Recursively call to get sink for element matrix[min_row][min_column].
return get_sink(matrix, basins, min_row, min_column);
}
vector<int> find_basins(vector<vector<int>> &matrix) {
int row_count = matrix.size();
int column_count = matrix[0].size();
// To maintain ids of each element of matrix.
vector<vector<int>> basins(row_count, vector<int>(column_count));
int index = 0;
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
basins[i][j] = index++;
}
}
// To maintain id wise count of elements which will sink in that id.
unordered_map<int, int> basin_indexes;
for (int i = 0; i < row_count; i++) {
for (int j = 0; j < column_count; j++) {
int sink = get_sink(matrix, basins, i, j);
basin_indexes[sink] = basin_indexes[sink] + 1;
}
}
vector<int> basin_sizes;
for (auto pair : basin_indexes) {
basin_sizes.push_back(pair.second);
}
// Sorting by size of sinks.
count_sort(basin_sizes);
return basin_sizes;
}
```

One observation to make is that the cell with the lowest altitude in the entire matrix will always be a sink. Another one is that all the neighbors of the lowest cell will drain to that cell.

We can use these observations to systematically group cells into basins.

- Create a new matrix and initialize all cells with -1 (unmarked).
- Now iterate over the cells from lowest to highest altitude.
- If the current cell is unmarked, mark it with a new unique ID.
- Mark all its unmarked neighbors with the same ID.
- Finally, count how many times each unique ID occurs in the matrix and return those counts in the non-ascending order.

Consider this input matrix for example:

1 5 2

2 4 7

3 6 9

The matrix with IDs in the beginning:

-1 -1 -1

-1 -1 -1

-1 -1 -1

Start with the lowest altitude, that is 1 at (0, 0) and mark it with a new ID 0. Then change all its neighbors’ IDs to 0 too.

0 0 -1

0 -1 -1

-1 -1 -1

Next lowest regions are (0, 2) and (1, 0) with the altitude 2.

(0, 2) is unmarked, so we mark it with a new ID of 1. We skip the neighbor already marked and mark the remaining one with the same ID of 1.

0 0 1

0 -1 1

-1 -1 -1

(1, 0) is already marked so we change its unmarked neighbors’ IDs to be the same as it has.

0 0 1

0 0 1

0 -1 -1

Continue this until all cells have been processed. At that point the matrix will look like this:

0 0 1

0 0 1

0 0 0

It has two unique basin IDs. We now count how many times each of them occurs, sort those counts in the non-descending order and return.

O(n * log(n)).

Populating the sorted map of altitudes takes O(n * log(n)) time.

Processing cells afterwards takes constant time per cell, so O(n) for all cells.

The number of basins is O(n). It takes O(n) time to sort their sizes using the Counting Sort algorithm.

Summing up everything we get O(n * log(n)) + O(n) + O(n) = O(n * log(n)).

O(n).

Keeping track of the IDs of the matrix cells takes O(n) space.

The sorted map of the altitudes takes O(n) space, too.

The data structure we use for the Counting Sort takes another O(n).

Summing up everything we get O(n) + O(n) + O(n) = O(n).

O(n).

Input, auxiliary space used and the output each take O(n) space. Summing them up we get O(n).

```
/*
* Asymptotic complexity in terms of total number of regions in \`matrix\`(total_rows * total_columns) \`n\`:
* Time: O(n * log(n)).
* Auxiliary space: O(n).
* Total space: O(n).
*/
// Counting Sort. See IK Sorting class or foundational
void count_sort(vector<int> &arr) {
int max = *max_element(arr.begin(), arr.end());
int min = *min_element(arr.begin(), arr.end());
int range = max - min + 1;
vector<int> count(range), output(arr.size());
for(int i = 0; i < arr.size(); i++) {
count[arr[i] - min]++;
}
for(int i = 1; i < count.size(); i++) {
count[i] += count[i - 1];
}
for(int i = arr.size() - 1; i >= 0; i--) {
output[count[arr[i] - min] - 1] = arr[i];
count[arr[i] - min]--;
}
for(int i=0; i < arr.size(); i++) {
arr[i] = output[i];
}
}
vector<int> find_basins(vector<vector<int>> &matrix) {
int row_count = matrix.size();
int column_count = matrix[0].size();
// To maintain ids of each element of matrix
vector<vector<int>> basins(row_count, vector<int>(column_count, -1));
// Sorted map with altitudes as keys
// and the list of cell coordinates with that altitude as values.
map<int, vector<pair<int, int>>> altitudes;
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
altitudes[matrix[i][j]].push_back(make_pair(i, j));
}
}
int basin_index = 0;
for (auto list_of_coords : altitudes) {
for (pair<int, int> coordinates : list_of_coords.second) {
int row = coordinates.first;
int column = coordinates.second;
// If element itself is a sink.
if (basins[row][column] == -1){
basins[row][column] = basin_index++;
}
// Check element which is at left.
if (column > 0 && basins[row][column - 1] == -1){
basins[row][column - 1] = basins[row][column];
}
// Check element which is at up.
if (row > 0 && basins[row - 1][column] == -1){
basins[row - 1][column] = basins[row][column];
}
// Check element which is at down.
if (row < matrix.size() - 1 && basins[row + 1][column] == -1){
basins[row + 1][column] = basins[row][column];
}
// Check element which is at right.
if (column < matrix[0].size() - 1 && basins[row][column + 1] == -1){
basins[row][column + 1] = basins[row][column];
}
}
}
vector<int> basin_sizes(basin_index);
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
basin_sizes[basins[i][j]]++;
}
}
// Sorting by size of sinks.
count_sort(basin_sizes);
return basin_sizes;
}
```

This is an optimized version of the brute force approach. The difference is that here we mark all the cells we passed through while calculating the sink of a particular cell and ignoring any cell already processed.

- Matrix called
`basins`

is initialized with -1 (unmarked). It will store the basin IDs in the end. - Iterate over the matrix cells, skip cells already marked. In the loop, call the recursive function
`get_sink`

on the current cell and mark the current cell with the ID returned by that function. - Function
`get_sink`

recursively calls itself with the cell the current cell drains to–until we reach a sink or a cell that’s already marked (assigned an ID). It returns the ID of the deepest cell it reached in the recursion:- If it’s reached a marked cell, it returns its ID.
- Else it must be a sink. Mark it with a new unique ID and return that ID.

Consider this input matrix for example:

1 5 2

2 4 7

3 6 9

Initialize `basins`

ID matrix:

-1 -1 -1

-1 -1 -1

-1 -1 -1

(0, 0) with altitude 1 happens to be a sink, so we mark it with 0.

(0, 1) with altitude 5 drains to (0, 0) which is a sink, so we mark it with that sink’s ID, that’s 0.

(0, 2) with altitude 2 happens to be a sink, so we mark it with a new unique ID, that would be 1.

After processing three cells of the first row, `basins`

matrix looks like this:

0 0 1

-1 -1 -1

-1 -1 -1

We continue processing the rest of the cells like that and end up with `basins`

matrix looking like this:

0 0 1

0 0 1

0 0 0

O(n).

Unlike the brute force algorithm, here we won’t process any cell more than once because we mark the cells already processed; and it still takes constant time to process any one cell. Therefore the main processing loop now takes O(n) time.

Counting Sort still takes O(n) time, too.

O(n) + O(n) = O(n).

O(n), same as in the brute force approach.

The matrix with the IDs takes O(n) space.

The recursion stack for the process of calculating the IDs takes O(n), too.

Finally, for the Counting Sort we use another array of size O(n).

O(n) + O(n) + O(n) = O(n).

O(n).

Input, auxiliary space used and the output each take O(n) space. Summing them up we get O(n).

```
/*
* Asymptotic complexity in terms of total number of regions in \`matrix\`(total_rows * total_columns) \`n\`:
* Time: O(n).
* Auxiliary space: O(n).
* Total space: O(n).
*/
// Counting Sort. See IK Sorting class or foundation.
void count_sort(vector<int> &arr) {
int max = *max_element(arr.begin(), arr.end());
int min = *min_element(arr.begin(), arr.end());
int range = max - min + 1;
vector<int> count(range), output(arr.size());
for(int i = 0; i < arr.size(); i++) {
count[arr[i]-min]++;
}
for(int i = 1; i < count.size(); i++) {
count[i] += count[i-1];
}
for(int i = arr.size()-1; i >= 0; i--) {
output[ count[arr[i]-min] -1 ] = arr[i];
count[arr[i]-min]--;
}
for(int i=0; i < arr.size(); i++) {
arr[i] = output[i];
}
}
int get_sink(vector<vector<int>> &matrix, vector<vector<int>> &basins, int row, int column, int basin_index) {
if (basins[row][column] == -1) {
int min_row = row, min_column = column;
// Check element which is at left.
if (column > 0 && matrix[row][column - 1] < matrix[min_row][min_column]) {
min_column = column - 1;
min_row = row;
}
// Check element which is at up.
if (row > 0 && matrix[row - 1][column] < matrix[min_row][min_column]) {
min_column = column;
min_row = row - 1;
}
// Check element which is at down.
if (row < matrix.size() - 1 && matrix[row + 1][column] < matrix[min_row][min_column]) {
min_column = column;
min_row = row + 1;
}
// Check element which is at right.
if (column < matrix[0].size() - 1 && matrix[row][column + 1] < matrix[min_row][min_column]) {
min_column = column + 1;
min_row = row;
}
// If we found sink.
if (min_row == row && min_column == column) {
basins[row][column] = basin_index;
}
else {
// Recursively call to find sink for element matrix[min_row][min_column].
basins[row][column] = get_sink(matrix, basins, min_row, min_column, basin_index);
}
}
return basins[row][column];
}
vector<int> find_basins(vector<vector<int>> &matrix) {
int row_count = matrix.size();
int column_count = matrix[0].size();
// To maintain ids of each element of matrix.
vector<vector<int>> basins(row_count, vector<int>(column_count, -1));
int basin_index = 0;
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
if (get_sink(matrix, basins, i, j, basin_index) == basin_index){
basin_index++;
}
}
}
// To store sink sizes.
vector<int> basin_sizes(basin_index);
for (int i = 0; i < row_count; i++){
for (int j = 0; j < column_count; j++){
basin_sizes[basins[i][j]]++;
}
}
// Sorting on sink sizes.
count_sort(basin_sizes);
return basin_sizes;
}
```

We hope that these solutions to creating a mirror image of a binary tree have helped you level up your coding skills. You can expect problems like these at top tech companies like Amazon and Google.

If you are preparing for a tech interview at FAANG or any other Tier-1 tech company, register for Interview Kickstart’s FREE webinar to understand the best way to prepare.

Interview Kickstart offers interview preparation courses taught by FAANG+ tech leads and seasoned hiring managers. Our programs include a comprehensive curriculum, unmatched teaching methods, and career coaching to help you nail your next tech interview.

We offer 17 interview preparation courses, each tailored to a specific engineering domain or role, including the most in-demand and highest-paying domains and roles, such as:

- Back-end Engineering Interview Course
- Front-end Engineering Interview Course
- Full Stack Developer Interview Course

To learn more, register for the FREE webinar.

**Attend our free webinar to amp up your career and get the salary you deserve.**

Hosted By

Ryan Valles

Founder, Interview Kickstart

- Designed by 500 FAANG+ experts
- Live training and mock interviews
- 17000+ tech professionals trained

00

Days

:

00

Hrs

:

00

Mins

:

00

Secs