NeetCode #699LC-472Hard1-D Dynamic Programming
← Back to All Problems#699 · #472 · Concatenated Words(连接词)
📌 Problem Statement & Constraints
Given an array of distinct strings
words, return all words that can be formed by concatenating at least two shorter words from the array. Constraints: 1 <= words.length <= 10^4, 1 <= words[i].length <= 30, and the total number of characters is at most 10^5.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!