intdroduce talk - 11 mins\nOOP - inheritance encapsulation - 15-20 mins\nexact question longest substring non repeating - https://leetcode.com/problems/longest-substring-without-repeating-characters/ - 30 mins\n\nonly got O(n2) O(n2).... waffled for the last 7ish mins on improving O(n2) memory to O(n)...\n\nthis is my exact code: https://leetcode.com/playground/s6k8i9r9\n\ni mean its a medium with 30% pass rating i had only 30 mins... do you think i did enough based on my ans to pass?

intdroduce talk - 11 mins\nOOP - inheritance encapsulation - 15-20 mins\nexact question longest substring non repeating - https://leetcode.com/problems/longest-