There is a DNA Strand having values as A , T , C , G.
All combinations are present in the the file.

Write a method which takes starting mutation string , ending mutation string and string bank and calculates the minimum mutation distance required. But the condition is that either of the start or end must be present in the bank.

Input:
AATTGGCC is starting and TTTTGGCA is ending then mutation distance will be 3. …

prashant kumar

Software Development Engineer Alexa AI. Sport programmer. http://linkedin.com/in/agprashant5

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store