-
Урок 1.
00:01:10
Introduction
-
Урок 2.
00:01:58
Setup and source code
-
Урок 3.
00:01:28
Tips for taking this course
-
Урок 4.
00:10:19
What is Big O Notation and how does it work?
-
Урок 5.
00:03:42
What's so special about arrays?
-
Урок 6.
00:01:08
What happens when you insert an element into an array?
-
Урок 7.
00:00:37
How does delete work?
-
Урок 8.
00:02:53
What happens when an array gets too big?
-
Урок 9.
00:01:20
What's different about arrays in Swift?
-
Урок 10.
00:01:19
What you need to know for the interview
-
Урок 11.
00:01:48
Tips before you enter the arcade
-
Урок 12.
00:15:08
Super common interview question #1
-
Урок 13.
00:10:00
Super common interview question #2
-
Урок 14.
00:05:40
Super common interview question #3
-
Урок 15.
00:06:10
What is a linked list?
-
Урок 16.
00:05:05
Add front
-
Урок 17.
00:05:07
Add back
-
Урок 18.
00:03:48
Insert
-
Урок 19.
00:10:20
Delete
-
Урок 20.
00:02:53
Linked lists in the real world
-
Урок 21.
00:01:29
How do linked lists differ from arrays?
-
Урок 22.
00:00:46
What you need to know for the interview
-
Урок 23.
00:03:47
Super common linked list interview question #1
-
Урок 24.
00:08:57
Super common linked list interview question #2a
-
Урок 25.
00:05:01
Super common linked list interview question #2b
-
Урок 26.
00:06:14
Super common linked list interview question #2c
-
Урок 27.
00:04:56
Super common linked list interview question #3
-
Урок 28.
00:00:37
Introduction
-
Урок 29.
00:03:53
Rules of reduction
-
Урок 30.
00:05:12
Big O rules in the Arcade
-
Урок 31.
00:03:03
Big O rules in the Arcade II
-
Урок 32.
00:02:06
What you need to know for the interview
-
Урок 33.
00:00:32
Stacks explained
-
Урок 34.
00:00:27
Queues explained
-
Урок 35.
00:02:58
What's so special about Stacks and Queues?
-
Урок 36.
00:04:19
How to build a stack and a queue from scratch
-
Урок 37.
00:07:06
Super common stack interview question #1
-
Урок 38.
00:06:26
Super common stack interview question #2
-
Урок 39.
00:05:48
Super common stack interview question #3
-
Урок 40.
00:01:14
What you need to know for the interview
-
Урок 41.
00:01:02
What's so special about hash tables?
-
Урок 42.
00:02:01
How do hashing functions work?
-
Урок 43.
00:01:58
How to convert a hash into an index
-
Урок 44.
00:00:57
Handling collisions
-
Урок 45.
00:00:36
Runtime characteristics of the hash table
-
Урок 46.
00:09:05
Building a hash table from scratch
-
Урок 47.
00:01:46
What you need to know for the interview
-
Урок 48.
00:02:25
What is a binary search tree?
-
Урок 49.
00:02:25
How do they work?
-
Урок 50.
00:05:02
Finding elements
-
Урок 51.
00:05:37
Inserting into
-
Урок 52.
00:01:16
Finding the minimum
-
Урок 53.
00:09:47
Handling deletes
-
Урок 54.
00:04:40
Binary tree traversal
-
Урок 55.
00:00:49
Runtime characteristics
-
Урок 56.
00:00:59
What you need to know for the interview
-
Урок 57.
00:02:55
Binary trees in the wild
-
Урок 58.
00:12:58
Super common binary search tree interview question #1
-
Урок 59.
00:06:48
Super common binary search tree interview question #2
-
Урок 60.
00:06:18
Super common binary search tree interview question #3
-
Урок 61.
00:00:46
Houston we have a problem
-
Урок 62.
00:02:24
What is the Fibonacci series?
-
Урок 63.
00:02:26
What is memoization and how can it help?
-
Урок 64.
00:02:32
Memoization in action
-
Урок 65.
00:01:21
What you need to know for the interview
-
Урок 66.
00:03:05
Bubble sort
-
Урок 67.
00:01:01
Bubble sort in action
-
Урок 68.
00:01:27
Bubble sort runtime
-
Урок 69.
00:02:55
Merge sort
-
Урок 70.
00:00:39
Merge sort runtime
-
Урок 71.
00:04:38
Quick sort
-
Урок 72.
00:00:49
Quick sort runtime
-
Урок 73.
00:02:17
What you need to know for the interview
-
Урок 74.
00:02:59
What are graphs?
-
Урок 75.
00:07:30
How do they work?
-
Урок 76.
00:05:18
Breadth first search
-
Урок 77.
00:05:16
Breadth first search in action
-
Урок 78.
00:03:06
Depth first search
-
Урок 79.
00:04:15
Depth first search in action
-
Урок 80.
00:01:49
What you need to know for the interview
-
Урок 81.
00:12:36
Super common graph question
-
Урок 82.
00:00:42
Introduction
-
Урок 83.
00:02:52
Unique characters
-
Урок 84.
00:01:59
Permutations
-
Урок 85.
00:05:10
URLify
-
Урок 86.
00:04:41
One away
-
Урок 87.
00:04:31
Compressor
-
Урок 88.
00:03:47
Duplicates
-
Урок 89.
00:04:48
Subtrees
-
Урок 90.
00:05:37
Min stacks
-
Урок 91.
00:03:03
Fizz Buzz
-
Урок 92.
00:02:31
Palindromes
-
Урок 93.
00:03:55
The Ransom Note
-
Урок 94.
00:08:04
Caesar Cipher
-
Урок 95.
00:02:27
String reversal
-
Урок 96.
00:03:01
Integer reversal
-
Урок 97.
00:02:40
Anagrams
-
Урок 98.
00:00:44
Introduction
-
Урок 99.
00:05:05
Common Google interview question
-
Урок 100.
00:06:22
How to interview at Google well
-
Урок 101.
00:00:32
Introduction
-
Урок 102.
00:04:12
Facebook question #1
-
Урок 103.
00:01:16
Facebook question #2
-
Урок 104.
00:05:31
Facebook question #3
-
Урок 105.
00:03:21
Facebook question #4
-
Урок 106.
00:00:35
Introduction
-
Урок 107.
00:00:53
Setting the stage
-
Урок 108.
00:01:48
The Amazon culture question
-
Урок 109.
00:03:05
The Amazon technical question
-
Урок 110.
00:05:57
How to best answer the culture question
-
Урок 111.
00:05:33
Amazon technical question answer
-
Урок 112.
00:02:15
The culture interview
-
Урок 113.
00:00:57
The systems interview
-
Урок 114.
00:02:42
The programming interview
-
Урок 115.
00:05:11
Final tips for interviewing well
-
Урок 116.
00:02:19
Where to go from here
-
Урок 117.
00:01:58
Final Words