Fruit Connectivity

GraphHash TableString

You are given a string representing different types of fruits, where each fruit is represented by its initial (e.g., 'A' for Apple, 'B' for Banana). Your task is to create a graph where each node represents a fruit, and an edge between two nodes exists if the corresponding fruits appear consecutively in the string at least once. Return a representation of the graph showing all nodes and their respective connections.

Example 1

Input

[
  "ABAB"
]

Output

{A: [B], B: [A]}

Explanation. The input string 'ABAB' shows 'A' and 'B' appearing consecutively. A graph representation would have edges connecting 'A' to 'B' and 'B' to 'A'.

Example 2

Input

[
  "A"
]

Output

{A: []}

Explanation. The input string 'A' contains only one type of fruit resulting in a graph with node 'A' having no edges.

Example 3

Input

[
  "ABCAC"
]

Output

{A: [B, C], B: [A, C], C: [B, A]}

Explanation. Here, 'A' connects to both 'B' and 'C', 'B' connects to 'A' and 'C', and 'C' connects to 'B' and 'A'.

Follow-up: Can you modify your solution to handle inputs where fruit types are represented by more than one letter?

Constraints:

The input string will only contain uppercase letters and will be at least one character long.

Views: 3