Leetcode Problem 433. Minimum Genetic Mutation

433. Minimum Genetic Mutation

Leetcode Solutions

Initialize a queue and a set for BFS and to keep track of visited nodes, respectively.
Add startGene to the queue and the visited set.
While the queue is not empty, process nodes level by level.
For each node, check if it is the endGene. If so, return the number of mutations (level).
If not, iterate through each character of the gene, and for each character, try all possible mutations ('A', 'C', 'G', 'T').
If the mutated gene is in the bank and has not been visited, add it to the queue and mark it as visited.
If the endGene is not found after the BFS completes, return -1.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen