I got a question similar to https://leetcode.com/problems/word-ladder/solution/ \nI gave a BFS based solution since I had seen the problem.\n\nThe Problem was described like so\n\n```\nGiven a safe list: 001 010 100 101 111\nFind a transformation from 000 to 111\n\nContraint: Change one char/bit at a time\n\nLength of the String is variable and N < 100000, N being length of String.\n```\n\nRejected with feedback that I gave a suboptimal solution. \n\nTime to write code was 12-15 mins.\n\nDisheartening, but that\'s what it is. Pick up your boots prepare harder and try again.

I got a question similar to https://leetcode.com/problems/word-ladder/solution/ \nI gave a BFS based solution since I had seen the problem.\n\nThe Problem was d