String Reconstruction from Fragments
Given an array of strings representing consecutive fragments of an original string, reconstruct the original string by arranging the fragments in the correct order. Each fragment connects directly to the next, with no overlaps or gaps.
Asked at:
Microsoft
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Early November, 2026
Mid-level
Given an array of strings, where each string represents a consecutive fragment of an original string, reconstruct the original string by arranging the fragments in the correct sequence. Input: ["et", "om", "co", "pl", "mp", "le"] Output: "complete"
Hello Interview Premium
Your account is free and you can post anonymously if you choose.