(with large constant factors because all of the li...
# announcements
k
(with large constant factors because all of the lists beging created)
w
Interesting. What if we assumed the
isUnique(s.substring(i, j))
was done in O(N)?
k
That's what I assumed because it is
O(n)
right?
w
Yeah it is (N) from I can tell...
the point confusing me is
I tried to use a 'sliding window' approach
are the double loops still O(N^2) in the worst case?