-
Урок 1.
00:02:11
Welcome! Introduction to this Course
-
Урок 2.
00:10:48
Hash Tables and Sorting for Beginners
-
Урок 3.
00:12:50
Program Execution in Memory
-
Урок 4.
00:22:16
Example of a great coding interview
-
Урок 5.
00:18:25
Traversing Array in Reverse (Using ESTCV Approach)
-
Урок 6.
00:02:13
Traverse from Both Ends ep1
-
Урок 7.
00:03:12
Traverse from Both Ends ep2
-
Урок 8.
00:03:02
Partitioning Array ep1
-
Урок 9.
00:05:20
Partitioning Array ep2
-
Урок 10.
00:03:20
Partitioning Array ep3
-
Урок 11.
00:03:04
Partitioning Array ep4
-
Урок 12.
00:07:01
Partitioning Array ep5
-
Урок 13.
00:01:51
Kadane's Algorithm Part 1: Intro to Subarrays
-
Урок 14.
00:03:44
Kadane's Algorithm Part 2: Problem Intro and Brute Force Solution
-
Урок 15.
00:03:37
Kadane's Algorithm Part 3: Kadane's Algorithm
-
Урок 16.
00:05:27
Kadane's Algorithm Part 4: Kadane Implementation
-
Урок 17.
00:02:28
Sliding Window using Two Pointers Part 1: Problem Intro and Clarifications
-
Урок 18.
00:06:22
Sliding Window using Two Pointers Part 2: Solving it with the Sliding Window Technique
-
Урок 19.
00:04:42
Sliding Window using Two Pointers Part 3: Implementation
-
Урок 20.
00:03:12
Prefix Sums Part 1: Algorithm using Prefix Sums
-
Урок 21.
00:02:30
Prefix Sums Part 2: Implementation
-
Урок 22.
00:05:15
Anatomy of a Scalable Web Application ep1
-
Урок 23.
00:12:38
Anatomy of a Scalable Web Application ep2
-
Урок 24.
00:04:16
Approach for System Design Interviews
-
Урок 25.
00:17:45
Approach for System Design Interviews + Uber/Lyft Design
-
Урок 26.
00:04:15
Load Balancers and App Servers ep1
-
Урок 27.
00:06:53
Load Balancers and App Servers ep2
-
Урок 28.
00:06:29
Load Balancers and App Servers ep3
-
Урок 29.
00:08:35
CAP Theorem for Beginners
-
Урок 30.
00:08:09
Sharding - Using Partition Functions
-
Урок 31.
00:08:38
Dynamic Sharding
-
Урок 32.
00:06:42
Sharding - Consistent Hashing
-
Урок 33.
00:02:27
Implementation ep1
-
Урок 34.
00:04:12
Implementation ep2
-
Урок 35.
00:03:51
Binary Search with Duplicates
-
Урок 36.
00:07:10
Search for Closest - Record and Move On
-
Урок 37.
00:05:16
Special Tricks ep1
-
Урок 38.
00:06:24
Special Tricks ep2
-
Урок 39.
00:07:29
Intro to Recursion and Memoization ep1
-
Урок 40.
00:02:29
Intro to Recursion and Memoization ep2
-
Урок 41.
00:05:27
Permutations/Combinations using Auxiliary Buffer Part 4
-
Урок 42.
00:06:27
Backtracking Spaceship
-
Урок 43.
00:05:08
Permutations/Combinations using Auxiliary Buffer Part 3: Print all Subsets of an Array
-
Урок 44.
00:05:27
Permutations/Combinations using Auxiliary Buffer Part 4: Permutations
-
Урок 45.
00:06:27
Backtracking Spaceship
-
Урок 46.
00:04:32
Backtracking Spaceship Video 2: Implementing the Function
-
Урок 47.
00:02:49
Backtracking Spaceship Video 3: Analyzing the Time and Space Complexity
-
Урок 48.
00:02:59
Implementation ep1
-
Урок 49.
00:01:42
Implementation ep2
-
Урок 50.
00:01:23
Append Function ep1
-
Урок 51.
00:02:10
Append Function ep2
-
Урок 52.
00:03:24
Deleting Nodes ep1
-
Урок 53.
00:01:39
Deleting Nodes ep2
-
Урок 54.
00:10:34
Slow Pointer, Fast Pointer
-
Урок 55.
00:10:12
Linked Hash Table
-
Урок 56.
00:03:03
Reversing a Linked List
-
Урок 57.
00:05:10
Stack - Intro
-
Урок 58.
00:05:11
Stack as Restriction ep1
-
Урок 59.
00:02:46
Stack as Restriction ep2
-
Урок 60.
00:05:27
Stack with Max
-
Урок 61.
00:07:04
Expression Evaluation 1. Postfix Expression
-
Урок 62.
00:07:25
Expression Evaluation 2. Infix Expression
-
Урок 63.
00:03:43
Expression Evaluation 3. Infix Expression Code
-
Урок 64.
00:02:54
Expression Evaluation 4. Infix Expression with Parenthesis
-
Урок 65.
00:05:52
Databases - Intro to Indexing and NoSQL ep1
-
Урок 66.
00:06:59
Databases - Intro to Indexing and NoSQL ep2
-
Урок 67.
00:02:38
Key-Value Stores incl. Object Stores, In Memory DBs 1.Introduction to Key Value Stores
-
Урок 68.
00:06:00
Queue - Intro ep2
-
Урок 69.
00:09:25
Wide Column Stores - e.g, HBase, Cassandra 1.Intro to Wide Column Stores
-
Урок 70.
00:02:55
Queue - Intro ep1
-
Урок 71.
00:06:00
Queue - Intro ep2
-
Урок 72.
00:07:05
Transaction Processing ep1
-
Урок 73.
00:05:25
Transaction Processing ep2
-
Урок 74.
00:02:55
Queue - Intro ep1
-
Урок 75.
00:06:00
Queue - Intro ep2
-
Урок 76.
00:02:45
Queue - Sliding Window ep1
-
Урок 77.
00:02:14
Queue - Sliding Window ep2
-
Урок 78.
00:05:24
Queue with Max
-
Урок 79.
00:07:27
Intro Part 1: Conditions where Dynamic Programming is Applicable
-
Урок 80.
00:03:59
Intro Part 2: Two ways of Implementing DP Solutions - Tabulation and Memoization
-
Урок 81.
00:04:45
Approaching Dynamic Programming Problems Part 1: Intro to Approaches
-
Урок 82.
00:12:04
Approaching Dynamic Programming Problems Part 2: Bottom-Up Thinking
-
Урок 83.
00:05:39
Approaching Dynamic Programming Problems Part 3: Top-Down Thinking
-
Урок 84.
00:07:28
Approaching Dynamic Programming Problems Part 4
-
Урок 85.
00:08:18
Max Diff
-
Урок 86.
00:03:25
2D Arrays
-
Урок 87.
00:07:35
Special Tricks
-
Урок 88.
00:03:53
Add/Multiply without Operators Part 1: BigInteger Addition Algorithm
-
Урок 89.
00:04:12
Add/Multiply without Operators Part 2: BigInteger Addition Implementation
-
Урок 90.
00:06:12
Add/Multiply without Operators Part 3: BigInteger Multiplication Algorithm + Implementation
-
Урок 91.
00:06:35
Hash Table - Implementation ep1
-
Урок 92.
00:07:11
Hash Table - Implementation ep2
-
Урок 93.
00:06:29
Hash Table - Hash Functions
-
Урок 94.
00:03:47
Hash Table - String Search
-
Урок 95.
00:07:25
Distributed File System Design ep1
-
Урок 96.
00:07:49
Distributed File System Design ep2
-
Урок 97.
00:07:04
Distributed File System Design ep3
-
Урок 98.
00:08:52
Distributed Processing using MapReduce ep1
-
Урок 99.
00:06:36
Distributed Processing using MapReduce ep2
-
Урок 100.
00:03:42
Distributed Processing using MapReduce ep3
-
Урок 101.
00:07:12
Distributed Processing using MapReduce ep4
-
Урок 102.
00:10:04
Spatial Indexing - Nearest Neighbors Search ep1
-
Урок 103.
00:01:54
Spatial Indexing - Nearest Neighbors Search ep2
-
Урок 104.
00:09:22
Spatial Indexing - Nearest Neighbors Search ep3
-
Урок 105.
00:05:08
Spatial Indexing - Nearest Neighbors Search ep4
-
Урок 106.
00:05:16
Graphs I - Basics
-
Урок 107.
00:09:16
Graphs I - DFS
-
Урок 108.
00:08:38
Graphs I - BFS
-
Урок 109.
00:09:19
Graphs I - Topological Sort
-
Урок 110.
00:07:11
Heaps - Intro, Implementation ep1
-
Урок 111.
00:11:27
Heaps - Intro, Implementation ep2
-
Урок 112.
00:07:03
Line Sweep - Intro
-
Урок 113.
00:12:05
Line Sweep - Skyline Problem
-
Урок 114.
00:08:46
Selection Algorithm - Intro, Implementation ep1
-
Урок 115.
00:08:25
Selection Algorithm - Intro, Implementation ep2
-
Урок 116.
00:09:56
Selection Algorithm - Intro, Implementation ep3
-
Урок 117.
00:02:13
Sorting Algorithms Intro
-
Урок 118.
00:03:02
Merge Sort and Quick Sort ep1
-
Урок 119.
00:05:51
Merge Sort and Quick Sort ep2
-
Урок 120.
00:06:00
Merge Sort and Quick Sort ep3
-
Урок 121.
00:03:10
Stability and Sorting Large Data ep1
-
Урок 122.
00:07:18
Stability and Sorting Large Data ep2
-
Урок 123.
00:08:09
Special Tricks
-
Урок 124.
00:05:46
Graphs II - Detecting Cycles
-
Урок 125.
00:09:26
Graphs II - Bipartite Graph
-
Урок 126.
00:02:13
Graphs II - Connected Components
-
Урок 127.
00:08:52
Bit Manipulation - Intro
-
Урок 128.
00:03:43
Bit Manipulation - Flip Bits
-
Урок 129.
00:06:31
Bit Manipulation - Get & Set Bits
-
Урок 130.
00:05:44
Bit Manipulation - Swap Bits
-
Урок 131.
00:04:38
Bit Manipulation - LSB
-
Урок 132.
00:05:22
Bit Manipulation - Complement of Integer
-
Урок 133.
00:05:54
Bit Manipulation - Duplicate XOR
-
Урок 134.
00:04:10
Binary Tree - Intro, Traversing ep1
-
Урок 135.
00:07:56
Binary Tree - Intro, Traversing ep2
-
Урок 136.
00:05:43
Binary Tree - Intro, Traversing ep3
-
Урок 137.
00:05:24
Binary Tree - Top to Bottom
-
Урок 138.
00:05:25
Binary Tree - Bottom to Top ep1
-
Урок 139.
00:05:05
Binary Tree - Bottom to Top ep2
-
Урок 140.
00:06:17
Binary Tree - Lowest Common Ancestor
-
Урок 141.
00:04:09
Binary Tree - Reconstruction
-
Урок 142.
00:02:09
Binary Search Tree - Intro, Implementation ep1
-
Урок 143.
00:06:01
Binary Search Tree - Intro, Implementation ep2
-
Урок 144.
00:04:11
Binary Search Tree - Record and Move On
-
Урок 145.
00:04:10
Binary Search Tree - Successor
-
Урок 146.
00:03:29
Binary Search Tree - LCA
-
Урок 147.
00:02:04
Binary Search Tree - Building Balanced BSTs
-
Урок 148.
00:06:00
Trie - Intro
-
Урок 149.
00:03:28
Trie - Implementation ep1
-
Урок 150.
00:04:05
Trie - Implementation ep2
-
Урок 151.
00:06:07
Majority Search - Half
-
Урок 152.
00:06:17
Majority Search - 1/k
-
Урок 153.
02:06:53
Examples of Sharding/Partitioning, Local/Global Indexing
-
Урок 154.
02:04:58
Understanding ACID vs BASE, Database Transactions
-
Урок 155.
02:02:17
Replication - Synchronous, Asynchronous
-
Урок 156.
02:03:04
Capacity Estimation + Different Types of Caching
-
Урок 157.
01:59:19
Facebook Manager Q&A
-
Урок 158.
02:08:40
Behavioral Interviews - Tips and Discussions
-
Урок 159.
02:02:40
Object Oriented Design Interviews (Design a Parking Lot)
-
Урок 160.
01:56:00
Q&A with a Candidate who got multiple offers
-
Урок 161.
01:58:50
System Design for Search Index (Amazon Elasticsearch, Apache Lucene)
-
Урок 162.
01:56:44
Mock Phone Interview - Expression Calculator
-
Урок 163.
01:57:14
Facebook News Feed Design (Recommendation System)
-
Урок 164.
02:06:48
Messaging Application System Design (WhatsApp, Messenger)
-
Урок 165.
02:03:15
Mock Interview - System Design (Facebook, Instagram)
-
Урок 166.
01:54:42
Consistent Hashing Discussion - Horizontally Scaling Systems
-
Урок 167.
02:00:23
2 Mock Phone Interviews - Algorithms
-
Урок 168.
02:04:57
Scaling your Algorithms for Large Data
-
Урок 169.
02:16:46
Improving Performance of Web Applications
-
Урок 170.
02:08:39
Video Sharing Service (Youtube, Netflix)
-
Урок 171.
02:04:45
Design a Job Scheduler
-
Урок 172.
02:01:27
Q&A with a successful candidate + Uber/Lyft System Design
-
Урок 173.
01:58:13
Design a Web Crawler
-
Урок 174.
01:58:39
Q&A with an Amazon engineer
-
Урок 175.
02:06:24
Q&A with a Google Tech Lead
-
Урок 176.
02:00:45
Q&A with a Google Engineer
-
Урок 177.
01:58:25
Security Considerations while Designing Web Applications
-
Урок 178.
02:04:01
Design HackerRank (Coding Competition Application)
-
Урок 179.
02:00:15
Q&A with an Amazon engineer )
-
Урок 180.
02:01:51
Sharding with Examples
-
Урок 181.
02:05:36
2 Good Mock System Design Interviews
-
Урок 182.
02:05:34
Transaction Isolation Levels
-
Урок 183.
02:10:34
2 Mock Interviews
-
Урок 184.
02:00:19
Example of a Good Mock System Design Interview
-
Урок 185.
02:12:25
Job Scheduler Design
-
Урок 186.
02:01:06
Producer-Consumer Problem
-
Урок 187.
00:11:46
Subarray Sum Problems ep1
-
Урок 188.
00:09:58
Subarray Sum Problems ep2
-
Урок 189.
00:06:29
Subarray Sum Problems ep3
-
Урок 190.
00:10:47
Dutch National Flag
-
Урок 191.
00:08:04
Backtracking Problems ep1
-
Урок 192.
00:05:15
Backtracking Problems ep2
* Mock Interview : Design a logging System in a Social Network (2:07 Hrs)
* Mock Interview : Design an A/B Testing System (2:07 Hrs)
* Job Scheduler Design
* Producer-Consumer Problem