给定两个字符串，检查它们是否等于k，每个长度为k的子字符串都出现在两个字符串上，并且必须为max

Question

I'm trying to solve a problem: Given 2 strings, I need to check if they're k-equal, meaning every sub string of length k in str1 appears in str2 and vice versa. The number of occurnces of the sub-strings does not have to be equal though. we can assume that the string are zero equal by default. Lastly, the k has to be the highest number we can find. thus if there are sub-strings of length 1 and length 2 that appear on both strings, we should return just the strings with length 2.

How can I approach this with Collections? for example with HashMap.

Example:

Answer 1

Hash all substring of str1 in a HashSet, lets say hash1. Now generate substrings of str2 and check if it exists in hash1 and also maintain a max variable . I thinks this should work but its kind of bruteforce approach.