In this problem we will extend [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) by allowing insertion of a new character in **any position** not only at the end. Return the construction path of the longest word.\n\n**Example 1:**\n```\nInput: words = ["o", "or", "ord", "word", "world"]\nOutput: ["o", "or", "ord", "word", "world"]\n```\n\n**Example 2:**\n```\nInput: ["o", "or", "ord", "word", "world", "p", "ap", "ape", "appe", "apple", "apples"]\nOutput: ["p", "ap", "ape", "appe", "apple", "apples"]\n```

In this problem we will extend Longest Word in Dictionary by allowing insertion of a new character in any position not only at the end. Return the construction 