4 kyu
Recover a secret string from random triplets
8,775 of 17,718zpconn
Description:
There is a secret string which is unknown to you. Given a collection of random triplets from the string, recover the original string.
A triplet here is defined as a sequence of three letters such that each letter occurs somewhere before the next in the given string. "whi" is a triplet for the string "whatisup".
As a simplification, you may assume that no letter occurs more than once in the secret string.
You can assume nothing about the triplets given to you other than that they are valid triplets and that they contain sufficient information to deduce the original string. In particular, this means that the secret string will never contain letters that do not occur in one of the triplets given to you.
Algorithms
Similar Kata:
Stats:
Created | Aug 20, 2014 |
Published | Aug 25, 2014 |
Warriors Trained | 70912 |
Total Skips | 21274 |
Total Code Submissions | 149430 |
Total Times Completed | 17718 |
Python Completions | 8775 |
Java Completions | 2005 |
JavaScript Completions | 5388 |
Ruby Completions | 675 |
Haskell Completions | 322 |
Clojure Completions | 106 |
Rust Completions | 527 |
Crystal Completions | 15 |
Swift Completions | 128 |
Total Stars | 2639 |
% of votes with a positive feedback rating | 94% of 2175 |
Total "Very Satisfied" Votes | 1944 |
Total "Somewhat Satisfied" Votes | 195 |
Total "Not Satisfied" Votes | 36 |