Solution 1 brute force simulation

  • t-complexity: $O(N^2i * L)$ N is length of words, L is length of words[i]

  • s-complexity: $O(1)$

Previous0318_Maximum_Product_of_Word_LengthsNext0319_Bulb_Switcher

Last updated