please write a python code to solve the code challenge. please show me the code you use and use the sample input and output for the problem.

Code Challenge: Solve the Overlap Graph Problem (restated below). . Input: A collection Patterns of k-mers. Output: The overlap graph Overlap (Patterns), in the form of an adjacency list. (You may return the nodes and their edges in any order.) Note: You don't need to account for repeated elements in Patterns in this problem Extra Dataset and Test Datasets Sample Input: ATGCG GCATG CATGC AGGCA GGCAT GGCAC Sample Output: CATGC -> ATGCG GCATG -> CATGC GGCAT -> GCATG AGGCA -> GGCAC, GGCAT