CareerCup

Wouldn't this be true if there are duplicates in the array and false otherwise?

Can be solved using trie by building suffixes trie.

Without other details we need to find if there are two equal numbers(map (number -> number counter)). If this is the case we found two subarrays of length 1.

solve is using max substring problem.

We can use Rabin Karp algorithm and generate hash for each possible sub-string using rolling hash. Using rolling hash reduces the complexity of generating hash since we will be reusing hash value of previous substring.

Add these to a map<hash, <start_index, length>>. So if we find to substrings with same hash and length then compare them. If they are equal then we have solution.

Can you please give an example and clarify the problem a bit more. Thanks

Create a map for each element in the array. if all values are even for all keys in the map then yes array can be divided into 2 subarrays.