Problem Challenge: Composite Count

Problem statement

A combined word is defined as a string that's created by joining at least two shorter words given in the array. The composite count of a word is defined as the number of shorter words present in each word. Given an array of unique strings, return the composite count of all the words of the array.

Example 1

Sample input