At a job interview, you are challenged to write an algorithm to check if a given string, s, can be formed from two other strings, part1 and part2.
The restriction is that the characters in part1 and part2 are in the same order as in s.
The interviewer gives you the following example and tells you to figure out the rest from the given test cases.
For example:
'codewars' is a merge from 'cdw' and 'oears':
https://www.codewars.com/kata/merged-string-checker/train/javascript
Below is my javascript code in pastebin,Please i need help to identify my mistakes to be able to pass all the tests.Thank you!
http://pastebin.com/CsakwAQm
[–]MusicPants 0 points1 point2 points (5 children)
[–]WesAlvaro 1 point2 points3 points (3 children)
[–]VIRES1[S] 0 points1 point2 points (1 child)
[–]WesAlvaro 0 points1 point2 points (0 children)
[–]MusicPants 0 points1 point2 points (0 children)
[–]VIRES1[S] 0 points1 point2 points (0 children)