filmov
tv
LeetCode Question #217: Contains Duplicate
Показать описание
Jason Wang (IU '21) walks through a straightforward array problem that also uses a HashSet.
Time Complexity: O(n), where n is the size of the input array.
Space Complexity: O(n), where n is the size of the input array.
Chapters:
Intro - 0:00
Problem Overview - 0:20
Brute Force Solution - 0:50
Optimal Solution - 3:14
Submission & Discussion - 6:28
Time Complexity: O(n), where n is the size of the input array.
Space Complexity: O(n), where n is the size of the input array.
Chapters:
Intro - 0:00
Problem Overview - 0:20
Brute Force Solution - 0:50
Optimal Solution - 3:14
Submission & Discussion - 6:28
0:06:31
0:03:58
0:00:55
0:01:00
0:05:28
0:18:11
0:05:16
0:08:26
0:01:59
0:18:35
0:05:43
0:09:40
0:10:41
0:05:50
0:02:04
0:05:40
0:01:15
0:04:55
0:00:29
0:04:06
0:09:31
0:10:59
0:05:10
0:10:37