title: How to decide which approach need to be used to write algorithms?
body: <p>A light store owner has several bulb chains of different types which consist of bulbs of different colors in different order. In addition to that, he has large collection of bulbs of each colors. A bulb chain is identified by the color sequence of its bulbs. He wants to transform one type of bulb chain into another type of bulb chain by either by:</p>
  
  <p>• Adding a bulb at some location.
  • Removing a bulb from a location.
  • Replacing a bulb with another bulb of different colour.</p>
  
  <p>Given two color sequences of two different bulb chains, Find the minimum no. of operations required to do this transformation. (Assume each color can be represented by a character and hence, color sequence of a bulb chain can be represented as sequence of characters or a string.)
  Input/Output Specifications Input:
  • First color sequence (string A)
  • Second color sequence (String B)</p>
  
  <p>Output:
  Minimum No. of operations required to transform first bulb chain into the second (integer)</p>
  
  <p>Examples Input1 : "asdfgh" 
  input2 : "sdfgh" </p>
  
  <p>Output : 1 </p>
  
  <p>Input1 : "x" 
  input2 : "asdf" </p>
  
  <p>Output : 4</p>
  
  <p>in the above given scenario, how to find the solution and what must be the first step ? i am an enthusiast and beginner in algorithm writing .</p>