[FEATURE] Distinct Number OF Islands Using DFS Algorithm

[gaurav-iitb]

Detailed description

Given a boolean 2D matrix grid of size n * m. You have to find the number of distinct islands where a group of connected 1s (horizontally or vertically) forms an island. Two islands are considered to be distinct if and only if one island is not equal to another (not rotated or reflected).

Context

This algorithm opens a wide variety of questions and this is basic need to other questions. This Question is the upgradation of the number of islands problem and is helpful in getting in-depth clarity

Possible implementation

Using the DFS algorithm and traversing every possible islands to get the number of islands

Additional information

No response

[harshagrawal523]

already done in previous issue

[gaurav-iitb]

@harshagrawal523 this is different question from that kindly read the desc properly

[gaurav-iitb]

@Panquesito7 @mishraabhinn please review my PR for this question

[thewpingmonk]

please assign this issue to me

[prabhatsingh985]

Please assign this task , I would really love to work at this

[PrakarshSingh5]

hi sir/madam can you please assign me i want to contribute

[Amisha2093]

Please, assign this problem to me.

[Masoom9587]

hello sir can you assign this issue to me i want to solve this issue.

[github-actions[bot]]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!