Time complexity
prakashn27 opened this issue · 2 comments
prakashn27 commented
http://www.programcreek.com/2013/02/leetcode-longest-substring-without-repeating-characters-java/
see java solution 2
why is the time complexity O(n^3)?
prakashn27 commented
it is O(n^3 ).
source from reditters
http://www.reddit.com/r/learnprogramming/comments/2s4rdq/complexity_doubt/
santhoshvai commented
Seems like posting in reddit gets good answers and increases our knowledge