{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n\t\u003cp\u003e\nHaving two strings X and Y, What is the minimum number of moves you need to make in order to convert the string X to the string Y?\n\u003c/p\u003e\n\n\u003cp\u003eThere are three available moves. The first one is to insert a single character into one of the two strings. The second move is to erase a single character from one of the two strings. The last is to replace a single character from one of strings with another character.\u003c/p\u003e\n\n\n\u003ch3\u003eInput\u003c/h3\u003e\n\u003cp\u003eT - number of test cases\u003c/p\u003e\n\u003cp\u003eFor each test case: The two strings, X and Y.\u003c/p\u003e\n\n\u003cp\u003eThe two strings will contain only uppercase characters and they won\u0027t be longer than 2000 characters.\u0026nbsp;\u003c/p\u003e\n\n\u003cp\u003eThere will only be 10 test cases in the data set.\u003c/p\u003e\n\n\u003ch3\u003eOutput\u003c/h3\u003e\n\u003cp\u003eFor each test case, only one line, minimum number of moves to convert string X to string Y.\u003c/p\u003e\n\n\u003ch3\u003eExample\u003c/h3\u003e\n\u003cdiv\u003e\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1\nFOOD\nMONEY\n\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e\n\u003c/div\u003e"}}]}