DSA Python 2025 - Count Distinct Islands Using DFS | Shape Normalization | GFG - Part 132 [Hindi]

🚀 Welcome to Part 132 of Code & Debug’s DSA Python Course!

In this lecture, we dive into the GFG Problem: Count Number of Distinct Islands, where the goal is to identify uniquely shaped islands in a binary grid, even if their positions differ. We solve this using a smart DFS approach by tracking relative positions from the base cell.

📚 What you’ll learn in this video:
✅ Understanding what makes two islands “distinct”
✅ DFS approach to explore full island shape
✅ How to normalize shapes using relative coordinates
✅ Using Python sets to store unique shapes
✅ Time and space complexity breakdown

💡 Why is this important?
This problem builds intuition for shape hashing, a powerful concept in grid and matrix problems. It’s an advanced extension of "Number of Islands" and tests how well you can generalize grid traversal patterns.

👉 Practice the problem on GeeksforGeeks:
🔗 https://www.geeksforgeeks.org/problem...

👉 Refer to the article for better understanding:
🔗 https://codeanddebug.in/blog/number-o...

👉 📄 Access the full YouTube DSA Playlist Sheet (All Questions in Order):
🔗 https://docs.google.com/spreadsheets/...

👉 Enroll in this FREE DSA Python course here:
🔗 https://codeanddebug.in/course/master...

👉 Enroll for Self-Paced Advanced DSA course here:
🔗 https://codeanddebug.in/course/zero-t...

🙏 Thank you for supporting Code & Debug! Don’t forget to like, share, and subscribe to our channel. Hit the 🔔 bell icon to stay updated with our latest lectures.

#DistinctIslands #GFG #DFSGrid #PythonDSA #DSA2025 #CodeAndDebug #IslandShapes #ShapeHashing #CodingInterviews #Part132