knaxuslearn · build · ship

Union-Find

Track which items are connected as you merge groups. 87 problems from 44 companies, most widely asked first. Tick them off as you go; your ticks stay in this browser.

problems
87
hard
38
done
0

87 of 87 problems

  1. 1Number of Islands (opens LeetCode in a new tab)Array, Depth-First Search, Breadth-First SearchMedium27companies
  2. 2Longest Consecutive Sequence (opens LeetCode in a new tab)Array, Hash Table, Union-FindMedium26companies
  3. 3Max Area of Island (opens LeetCode in a new tab)Array, Depth-First Search, Breadth-First SearchMedium14companies
  4. 4Accounts Merge (opens LeetCode in a new tab)Array, Hash Table, StringMedium13companies
  5. 5Evaluate Division (opens LeetCode in a new tab)Array, String, Depth-First SearchMedium10companies
  6. 6Making A Large Island (opens LeetCode in a new tab)Array, Depth-First Search, Breadth-First SearchHard10companies
  7. 7Is Graph Bipartite? (opens LeetCode in a new tab)Depth-First Search, Breadth-First Search, Union-FindMedium9companies
  8. 8Make Lexicographically Smallest Array by Swapping Elements (opens LeetCode in a new tab)Array, Union-Find, SortingMedium9companies
  9. 9Surrounded Regions (opens LeetCode in a new tab)Array, Depth-First Search, Breadth-First SearchMedium9companies
  10. 10Number of Operations to Make Network Connected (opens LeetCode in a new tab)Depth-First Search, Breadth-First Search, Union-FindMedium8companies
  11. 11Number of Provinces (opens LeetCode in a new tab)Depth-First Search, Breadth-First Search, Union-FindMedium8companies
  12. 12Find the Safest Path in a Grid (opens LeetCode in a new tab)Array, Binary Search, Breadth-First SearchMedium7companies
  13. 13Min Cost to Connect All Points (opens LeetCode in a new tab)Array, Union-Find, Graph TheoryMedium7companies
  14. 14Minimize Malware Spread (opens LeetCode in a new tab)Array, Hash Table, Depth-First SearchHard7companies
  15. 15Number of Distinct Islands (opens LeetCode in a new tab)Array, Hash Table, Depth-First SearchMedium7companies
  16. 16Possible Bipartition (opens LeetCode in a new tab)Depth-First Search, Breadth-First Search, Union-FindMedium7companies
  17. 17Swim in Rising Water (opens LeetCode in a new tab)Array, Binary Search, Depth-First SearchHard7companies
  18. 18Divide Nodes Into the Maximum Number of Groups (opens LeetCode in a new tab)Depth-First Search, Breadth-First Search, Union-FindHard6companies
  19. 19Number of Connected Components in an Undirected Graph (opens LeetCode in a new tab)Depth-First Search, Breadth-First Search, Union-FindMedium6companies
  20. 20Number of Enclaves (opens LeetCode in a new tab)Array, Depth-First Search, Breadth-First SearchMedium6companies
  21. 21Power Grid Maintenance (opens LeetCode in a new tab)Array, Hash Table, Depth-First SearchMedium6companies
  22. 22Redundant Connection (opens LeetCode in a new tab)Depth-First Search, Breadth-First Search, Union-FindMedium6companies
  23. 23Smallest String With Swaps (opens LeetCode in a new tab)Array, Hash Table, StringMedium6companies
  24. 24Count Servers that Communicate (opens LeetCode in a new tab)Array, Depth-First Search, Breadth-First SearchMedium5companies
  25. 25Find if Path Exists in Graph (opens LeetCode in a new tab)Depth-First Search, Breadth-First Search, Union-FindEasy5companies
  26. Showing 25 of 87

"Companies" counts the companies in DSA Atlas that have asked the problem at any time. Patterns and data structures come from LeetCode topic tags. Your ticks are saved in this browser only, and shared with the company pages.

Credits

These lists are the work of two open GitHub projects. Thank you to their authors.

Problem text stays on LeetCode; we link to it. Frequencies are relative within a company.

Last synced