Implement Neighbors to find the d-neighborhood of a string in Python

Input: A string Pattern and an integer d. Output: The collection of strings Neighbors(Pattern, d).

Sample Input: ACG 1 Sample Output: TCG ACG GCG CCG ACA ACT AGG AAG ATG ACC

What is the algorithm to solve this problem?? Much appreciated of help!