Determine the number of disconnected groups (connected components) within a given undirected graph. You're provided the graph's edges and need to find how many separate, reachable islands of nodes exist.

Design a data structure that efficiently stores a set of strings and allows for prefix-based searches. Implement methods to insert strings, search for complete words, and check if any word starts with a given prefix.

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.