5 kyu

Merged String Checker

435 of 9,553Abbe

Description:

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 should be 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':

    s:  c o d e w a r s   = codewars
part1:  c   d   w         = cdw
part2:    o   e   a r s   = oears
Strings
Algorithms

Stats:

CreatedJan 29, 2015
PublishedMay 25, 2015
Warriors Trained44984
Total Skips10721
Total Code Submissions274837
Total Times Completed9553
Java Completions1637
Clojure Completions129
JavaScript Completions2726
CoffeeScript Completions29
Python Completions3029
C# Completions1155
Haskell Completions435
PHP Completions191
COBOL Completions6
C Completions155
C++ Completions292
Total Stars1432
% of votes with a positive feedback rating82% of 1211
Total "Very Satisfied" Votes873
Total "Somewhat Satisfied" Votes240
Total "Not Satisfied" Votes98
Ad
Contributors
  • Abbe Avatar
  • jhoffner Avatar
  • bkaes Avatar
  • MMMAAANNN Avatar
  • bstenzel Avatar
  • JohanWiltink Avatar
  • Voile Avatar
  • hobovsky Avatar
  • trashy_incel Avatar
  • MikChan Avatar
  • akar-0 Avatar
  • iming Avatar
  • sid114 Avatar
Ad