Leetcode-30: Find Substring with Concatenation of All Words

Photo by Dmitry Ratushny on Unsplash

Question:

Substring with Concatenation of All Words - LeetCode

(from Leet code : 13th, Aug-2022)

Hints:

i. Iterate each input words(map/dictionary) against given string (nested loop), to find index of each word.

ii. Save frequency of each word in another map to check the exact no of matches only.

Code & Explanation added along with comments:

Time Complexity: O(m*n) , m — no of words, n — string range with total word chars.

Space Complexity:

O(m*n + k), k — result list.

Please comment your queries or thoughts.

Thanks for your read and claps 👏 👏👏

#arraysinjava. #array #datastructures #codinginterviewquestions #codinginterview #faang #leetcode #animated #java #python #faang #motion