# Count the Number of Ideal Arrays (LeetCode 4155)
Interview drill note.
## Approach
Union-find or BFS layers when connectivity or components matter.
## Complexity
State time and space clearly; call out edge cases (empty input, duplicates, extremes).
## Practice tip
Rehearse the explanation out loud. An [www.linkjob.ai](https://www.linkjob.ai/) helps keep structure under time pressure.
## Notes (r0058)
Disclosure: personal study notes; I am affiliated with Linkjob AI.