The probelm statement.
This task is a task of implementation. The constraints are very low so the simple brute force will pass easily. ust take every 3 letter string and start checking for that in the given string. And every time you find one increment the asnwer with 1. Here is a checking method I suggest. ust because the strings are of length 3 we can loop over the given string and check if the current character and the next to are equal the the first , second and thirdf characters of the short string.
Check the cource code for a beter understanding.
This task is a task of implementation. The constraints are very low so the simple brute force will pass easily. ust take every 3 letter string and start checking for that in the given string. And every time you find one increment the asnwer with 1. Here is a checking method I suggest. ust because the strings are of length 3 we can loop over the given string and check if the current character and the next to are equal the the first , second and thirdf characters of the short string.
Check the cource code for a beter understanding.
No comments:
Post a Comment