Is there any solution better than O(n square) ?

  • 0

    The tag part to figure out if two words are sharing the same letter are brilliant !
    I am wondering for the product part, if there is better solution than O(n square) ?


Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.