(Medium) Leetcode 3: Longest Substring Without Repeating Characters

preview_player
Показать описание

00:00 reading PROBLEM and digesting TEST CASES
04:30 identifying some possible EDGE CASES and sussing out some RULES
09:30 brainstorming some possible approaches
16:00 first major breakthrough
18:09 deciding on a DATA STRUCTURE to use
18:20 manually stepping through a test case
19:50 second major breakthrough: store a chr's index as its values in object
23:06 pseudocode
31:06 writing first line of code of ALGORITHM
36:36 test driving algo
39:30 mistakenly say 4 instead of 3 for the value of the repeated chr `a` in the `uniq` object which leads to some confusion
40:07 encountering a syntax error
40:31 fixing 1st bug
41:05 encountering a failing test case and manually stepping through algo
43:30 SUCCESS (very slowly!)
Рекомендации по теме
visit shbcf.ru