Count Valid Word Occurrences | LeetCode 3926 | Weekly Contest 501 | Java | Developer Coder

本站添加: 2026-05-11

[00:00:01][music] >> Hello everyone, welcome back to my YouTube channel. So now I'm going to solve question number two of weekly contest 501.

[00:00:08]Count valid word occurrences. So in this problem you are given an array of strings chunks.

[00:00:15]The strings are concatenated in order to form a single string S.

[00:00:20]You are also given an array of strings queries.

[00:00:24]A word is defined as a substring of S that consists of lower case English letters A to Z.

[00:00:32]May include hyphens only if each hyphen is surrounded by lower case English letters.

[00:00:41]Each hyphen should be surrounded by lower case English letters.

[00:00:46]And is not part of a longer substring that also satisfies the above conditions.

[00:00:55]Then a word is defined as a substring of S.

[00:00:59]Any character that is not a lower case English letter or a valid hyphen act as a separator.

[00:01:06]We have to return an integer array answer such that answer of I is the number of occurrences of queries of I's as a word in S.

[00:01:16]A substring is a contiguous non-empty sequence of characters within a string.

[00:01:22]Okay.

[00:01:23]So let's see what we need to do here. So see this example number one. So chunks is like this, right? So first merge them, right? Concatenate them. So it is going to look like this. Hello world hello, something like this. Okay.

[00:01:39]So you have to create one string builder.

[00:01:42]And in string builder you have to add all these characters one by one. Append all the characters. Okay.

[00:01:49]So you will get something like this.

[00:01:50]Hello world hello.

[00:01:52]Concatenating all strings in chunks gives you this, right?

[00:01:56]Then here hello hello is appearing two times.

[00:02:00]Done.

[00:02:01]World is appearing one time.

[00:02:03]w o r, it is not appearing anywhere, right? So, it's zero. That's it.

[00:02:08]The valid words in S are hello which appears twice and world which appears once.

[00:02:13]Thus, the answer is this. Okay, we will see a few more examples, all right?

[00:02:17]So, here you have something like this.

[00:02:19]So, first concatenate everything. So, you will get something like this.

[00:02:22]A, then two hyphens are there, okay?

[00:02:25]Then, A, then hyphen, then again hyphen, then C, all right?

[00:02:30]Now, here start from here. A, then after that hyphen is there, okay? So, now here before this hyphen there is one lowercase English character, but after this hyphen there is one more hyphen.

[00:02:45]So, that simply means that this is not a valid word, right? So, as of now, we have just this word as of now. So, just add this A. A frequency is one as of now, okay?

[00:02:58]Then after that, move further.

[00:03:01]So, here you see one more hyphen, right?

[00:03:03]I'm just iterating over all the characters in this particular concatenated string.

[00:03:08]Okay, there is one hyphen, but before that there is more one more hyphen, right? So, this is not a valid starting point. Right? And a valid starting point is always going to start from a lowercase English character. Right? Then after that, B.

[00:03:20]Okay, B is there. Then after that, there is one space, right? This is a as a separator. So, now B frequency is one, right?

[00:03:29]Now after that, you move here. A, okay?

[00:03:32]Then after that, there is one hyphen, okay? So, I will check if before that there is one lowercase English character and after that also there should be one lowercase English character. No, it is not there. So, break it. So, A A is appearing now two times.

[00:03:45]Then after that, I move here. This is not a valid starting point. Then I move here.

[00:03:50]Okay? So, here I see C.

[00:03:53]And that's it. There's nothing after that. So, in the end we are left with just this particular word C. C is occurring one time.

[00:04:00]So, now it is saying queries is A. A is occurring two times. That's it. B is occurring one time. That's it. C is occurring one time. That's it.

[00:04:08]So, this is what you need to do.

[00:04:10]Concatenating all strings in chunks gives you this.

[00:04:13]The valid words in S are A which appears twice, B which appears once, and C which appears once. So, the answer is this.

[00:04:20]That's it.

[00:04:21]So, that's what we need to do. Very simple. Here if you see this example number three.

[00:04:26]Chunks is like this. Only hello we have, right? So, it is asking us to search for hello. Hello is appearing appearing one time.

[00:04:33]L is not appearing. So, that's it. 1 0.

[00:04:35]The valid word in S is hello which appears once. So, the answer is this.

[00:04:40]That's it. And here if you see the constraints. So, chunks.length is from 1 to 10^5. Chunks i.length is from 1 to 10^5.

[00:04:49]Chunks of i may consist of lower case English letters.

[00:04:53]Spaces and hyphens. Okay. So, chunks of i only consist of lower case English letters.

[00:05:01]Spaces and hyphens. That's it. We will not see anything else.

[00:05:04]All right. That's a good thing actually, right? The total height total length of all the strings in chunks doesn't exceed this. Okay.

[00:05:12]Queries.length is from 1 to 10^5. Okay.

[00:05:15]Queries i.length is from 1 to 10^5.

[00:05:18]Queries of i is a valid word. All right.

[00:05:21]So, this is going to be one valid word only, right?

[00:05:24]>> [snorts] >> All right.

[00:05:26]The total length of all the strings in queries doesn't exceed this.

[00:05:32]Input. Okay. So, here concatenate everything first. A hyphen B. C hyphen D. It's already one only, right? So, concatenate it only, right? Now, here if you see A then after it hyphen is there.

[00:05:48]And here if you see lowercase, here you see lowercase. Then move further, B.

[00:05:52]Okay, then there is one separator. So, this is one valid word. A-B is one valid word. Okay. Now, after that proceed here.

[00:06:01]Uh space, then C start from C, then hyphen. That's it. A-B occurs one time.

[00:06:06]Here lowercase, not lowercase, so C is one word, right?

[00:06:10]Then this is not a starting word, then D, then after that there is one separator, so D is one valid word. Then here E E, okay.

[00:06:19]You can start from E, then hyphen. So, this is valid. F is valid.

[00:06:24]Uh here hyphen is valid, then G, then there is end. So, we have to add this EFG. This is also valid. Right? So, now here if you see, uh these are the queries. So, E is occurring zero time.

[00:06:35]You are not seeing A here. B is not here. AB is not here. CD is not here. C is here one time. D is here one time.

[00:06:45]EFG is not here, right? Okay, that's it.

[00:06:48]That's it. So, now let's see the code.

[00:06:52]So, first thing is nothing but concatenation you need to do.

[00:06:55]So, string builder you are getting and then you are iterating over all these chunks one by one.

[00:07:00]And you are just concatenating all the strings. That's it. Then once you concatenate all the strings to string builder, just convert it to one string, big string.

[00:07:11]Right? Then after that you have to extract the valid words.

[00:07:15]So, you are creating one map, string and integer frequency, and you are going to create one string builder word. And N is nothing but the S.length, right? And then you are iterating over all the N elements you have.

[00:07:29]Over all the N characters, right? Of this string.

[00:07:34]This particular string you are iterating over here.

[00:07:36]Then you are going to pick that particular character.

[00:07:39]And then you have to check if the character is lowercase, then just append this to your string builder.

[00:07:45]If it is a hyphen, then you have to check it is a valid hyphen only if surrounded by letters. So, if word.length is greater than zero, right? And the next I plus one, it should be not go out of bound, right? And character is a lowercase at s.

[00:08:06]character at I plus one, okay? If character is a lowercase at this particular position, right? Then only you have to continue forming the word. Otherwise, you have to add the word in the in this frequency map, okay? So, here frequency you're passing and the particular word, okay? So, this is the one method I will write.

[00:08:28]If it is separator, then also you have to add the word, right? And last word also we need to add, right? In the end, the last word. Because after last word, you will not see any separator or anything, right? So, you have to add that as well.

[00:08:42]So, after that, you have to iterate over the queries and you have to just take the frequency and return that.

[00:08:47]That's it. This is what you need to do here.

[00:08:50]Clear?

[00:08:51]Now, how this add word is going to work?

[00:08:54]So, simple here, you are passing the map and the word. If word length is zero, just simply return. There's nothing to do.

[00:09:03]Otherwise, just change this particular string builder to string.

[00:09:07]Then you have to remove the invalid trailing hyphens, right?

[00:09:12]So, if you see something like this, then you have to remove it, right? If it is there. You can ignore this line as well.

[00:09:21]I don't think it will create any issue.

[00:09:22]You have to check if the word is becoming empty or not. So, if it is not empty, then you have to operate this to frequency, right?

[00:09:32]And once all this is done, then you have to set the length of this particular word to zero, right? Because you have to move to the next word.

[00:09:40]So, that's what we need to do, right?

[00:09:43]So, I hope that you guys are able to understand question number two of weekly contest 501.

[00:09:49]And if you guys still have any doubts, then please feel free to ask in comment section.

[00:09:53]Till then, keep coding and keep practicing. We'll see you in the next video. Thank you. Bye-bye.