Given a mapping from every image ID to a list of its near-duplicate image IDs, write an algorithm to group these images into distinct connected near-duplicate clusters using BFS, DFS, or Union-Find.
Problem
Given a mapping from every image ID to a list of its near-duplicate image IDs, write an algorithm to group these images into distinct connected near-duplicate clusters using BFS, DFS, or Union-Find.
Your answer
Try one AI text evaluation on us
Get structured feedback, scored against a 4-axis rubric. Premium unlocks unlimited.
