🌃
Limited Algorithm
Ctrlk
  • Summary
  • Hash & TreeMap
  • Queue &Stack & PQ
  • Hybrid Data Structure
  • Graph
    • Summary
    • 基本功&母体 skip
    • Graph Theory II& III Problem of Connectivity and Reachable
      • Question 0 Traversal & Reachable模版
      • Question 1 Island 母体二刷
      • Question 2 Number of connected Components in an Undirected Graph
      • Question 3 Bipartite
      • Question 1 Graph Valid Tree
      • Question 2 Keys and Rooms
      • Question 3 Evaluate Division
      • Question 4 Account Merge
      • Question 5 Check for Ccontradictions in Equations
      • Question 6 Similar String Groups
    • Graph Theory IV& V:  Shortest Path: BFS
    • Graph Theory VI: Shortest Path III Dijkstra Algorithm
    • Graph Theory VIII Topological Order
    • Graph Theory IX Introduction to Disjoint Set(Union Find)
    • Graph Theory X: Union Find More Ractcce on UF
    • Graph Theory XI: UF 拓展 && Minimum Spanning Tree I & II
  • Graph Backtracking and Others
  • Tree
  • Pure Recursion & Backtracking
  • Dynamic Programming
  • Others
  • Array& LinkedList & String
  • Adavance Two Pointer
  • Advance Sliding Window
  • Advance Binary Search
  • Advance Young's Matrix
  • Java Knowledge
Powered by GitBook
On this page
  1. Graph
  2. Graph Theory II& III Problem of Connectivity and Reachable

Question 6 Similar String Groups

PreviousQuestion 5 Check for Ccontradictions in EquationsNextGraph Theory IV& V:  Shortest Path: BFS