[Last updated 5/2024] Master the Coding Interview: Data Structures + Algorithms (Udemy – Vietsub and Engsub)
About Course
Views
Master the Coding Interview.
Get more job offers, negotiate a raise: Everything you need to get the job you want!
What you’ll learn:
Ace coding interviews given by some of the top tech companies
Become more confident and prepared for your next coding interview
Learn, implement, and use different
Data Structures
Learn, implement and use different
Algorithms
Get more interviews
Professionally handle offers and negotiate raises
Become a better developer by mastering computer science fundamentals
Description:
This course, “
Master the Coding Interview: Data Structures + Algorithms
” is designed to help individuals prepare for technical interviews by focusing on key concepts in
data structures
and
algorithms
.
Link gốc:
https://www.udemy.com/course/master-the-coding-interview-data-structures-algorithms/
Time Course:
19.5 hours (264 Lectures + Documents)
Instructor
: Andrei Neagoie
Total Weight:
6.1 GB
** Note
:
Chú ý:
Course Content
11 – Data Structures Graphs
-
001 Graphs Introduction.mp4
02:28 -
002 Types Of Graphs.mp4
03:32 -
003 Exercise Guess The Graph.mp4
02:45 -
004 Graph Data.mp4
05:58 -
005 Exercise Graph Implementation.mp4
04:06 -
006 Solution Graph Implementation.mp4
04:50 -
007 Graphs Review.mp4
02:04 -
008 Data Structures Review.mp4
01:52 -
009 What Else Is Coming Up.mp4
01:53
21 – Extra Bits
-
003 From JTS Learn to Learn.mp4
01:59 -
004 From JTS Start With Why.mp4
02:43 -
006 How To Use Leetcode.mp4
02:27 -
007 AMA – 100,000 Students!!.mp4
38:30
20 – Contributing To Open Source To Gain Experience
-
001 Contributing To Open Source.mp4
14:08 -
002 Contributing To Open Source 2.mp4
09:40
19 – Extras Google, Amazon, Facebook Interview Questions
-
001 Coding Problems.mp4
01:25
18 – Thank You
-
002 Thank You.mp4
00:52
17 – Offer + Negotiation
-
001 Section Overview.mp4
02:10 -
002 Handling Rejection.mp4
04:07 -
003 Negotiation 101.mp4
09:40 -
004 Handling An Offer.mp4
09:03 -
005 Handling Multiple Offers.mp4
07:29 -
006 Getting A Raise.mp4
07:41 -
008 Section Summary.mp4
02:09
16 – Non Technical Interviews
-
001 Section Overview.mp4
02:38 -
002 During The Interview.mp4
09:03 -
004 Tell Me About Yourself.mp4
05:30 -
006 Why Us.mp4
05:06 -
007 Tell Me About A Problem You Have Solved.mp4
05:18 -
009 What Is Your Biggest Weakness.mp4
02:19 -
011 Any Questions For Us.mp4
03:24 -
013 Secret Weapon.mp4
08:11 -
014 After The Interview.mp4
05:24 -
015 Section Summary.mp4
03:56
15 – Algorithms Dynamic Programming
-
001 Dynamic Programming Introduction.mp4
01:51 -
002 Memoization 1.mp4
07:46 -
003 Memoization 2.mp4
03:56 -
004 Fibonacci and Dynamic Programming.mp4
05:33 -
005 Dynamic Programming.mp4
05:47 -
006 Implementing Dynamic Programming.mp4
09:12 -
008 Dynamic Programming Review.mp4
04:45
14 – Algorithms Searching + BFS + DFS
-
011 breadthFirstSearch().mp4
09:15 -
020 Searching + Traversal Review.mp4
04:21 -
019 Dijkstra + Bellman-Ford Algorithms.mp4
05:11 -
018 DFS in Graphs.mp4
02:49 -
017 BFS in Graphs.mp4
02:07 -
016 Graph Traversals.mp4
03:53 -
014 depthFirstSearch().mp4
12:03 -
013 PreOrder, InOrder, PostOrder.mp4
05:21 -
012 breadthFirstSearchRecursive().mp4
05:33 -
001 Searching + Traversal Introduction.mp4
01:33 -
010 Solution BFS vs DFS.mp4
03:15 -
009 Exercise BFS vs DFS.mp4
00:44 -
007 BFS vs DFS.mp4
03:20 -
006 DFS Introduction.mp4
03:23 -
005 BFS Introduction.mp4
02:44 -
004 Graph + Tree Traversals.mp4
03:55 -
003 Binary Search.mp4
06:05 -
002 Linear Search.mp4
03:37
13 – Algorithms Sorting
-
013 Solution Insertion Sort.mp4
02:06 -
027 Sorting Review.mp4
02:53 -
026 Sorting In Your Language.mp4
01:27 -
025 Solution Sorting Interview.mp4
07:07 -
024 Exercise Sorting Interview.mp4
01:27 -
022 Radix Sort + Counting Sort.mp4
04:17 -
020 Which Sort Is Best.mp4
04:40 -
018 Quick Sort.mp4
07:40 -
016 Solution Merge Sort.mp4
04:44 -
014 Merge Sort and O(n log n).mp4
08:59 -
001 Sorting Introduction.mp4
07:01 -
011 Insertion Sort.mp4
02:38 -
010 Dancing Algorithms.mp4
01:36 -
009 Solution Selection Sort.mp4
02:23 -
007 Selection Sort.mp4
02:39 -
006 Solution Bubble Sort.mp4
05:06 -
004 Bubble Sort.mp4
03:45 -
003 Sorting Algorithms.mp4
03:37 -
002 The Issue With sort().mp4
06:51
12 – Algorithms Recursion
-
001 Introduction to Algorithms.mp4
03:51 -
002 Recursion Introduction.mp4
05:36 -
003 Stack Overflow.mp4
06:17 -
004 Anatomy Of Recursion.mp4
10:27 -
005 Exercise Factorial.mp4
03:25 -
006 Solution Factorial.mp4
06:20 -
007 Exercise Fibonacci.mp4
01:59 -
008 Solution Fibonacci.mp4
11:21 -
009 Recursive VS Iterative.mp4
04:16 -
010 When To Use Recursion.mp4
04:00 -
012 Recursion Review.mp4
02:47
01 – Introduction
-
05:04
-
04:01
-
004 ZTM Resources.mp4
04:23
10 – Data Structures Trees
-
009 Solution lookup().mp4
04:54 -
018 Tree Review.mp4
00:51 -
017 Trie.mp4
03:16 -
016 Priority Queue.mp4
05:27 -
015 Quick Note on Heaps.mp4
01:08 -
014 Binary Heaps.mp4
05:36 -
012 AVL Trees + Red Black Trees.mp4
02:56 -
011 Solution remove().mp4
07:41 -
010 Extra Exercise remove().mp4
02:28 -
001 Trees Introduction.mp4
06:23 -
008 Solution insert().mp4
10:10 -
007 Exercise Binary Search Tree.mp4
03:57 -
006 BST Pros and Cons.mp4
02:26 -
005 Balanced VS Unbalanced BST.mp4
03:42 -
004 Binary Search Trees.mp4
06:11 -
003 O(log n).mp4
07:00 -
002 Binary Trees.mp4
05:45
09 – Data Structures Stacks + Queues
-
001 Stacks + Queues Introduction.mp4
02:58 -
002 Stacks.mp4
03:28 -
003 Queues.mp4
03:30 -
004 Exercise Stacks VS Queues.mp4
03:06 -
005 Solution Stacks VS Queues.mp4
03:39 -
007 Optional How Javascript Works.mp4
24:12 -
008 Exercise Stack Implementation (Linked Lists).mp4
02:23 -
009 Solution Stack Implementation (Linked Lists).mp4
08:58 -
010 Exercise Stack Implementation (Array).mp4
00:53 -
011 Solution Stack Implementation (Array).mp4
03:56 -
012 Exercise Queue Implementation.mp4
01:48 -
013 Solution Queue Implementation.mp4
07:50 -
014 Queues Using Stacks.mp4
02:04 -
015 Stacks + Queues Review.mp4
02:19
08 – Data Structures Linked Lists
-
010 Node Class.mp4
02:40 -
021 Linked Lists Review.mp4
05:07 -
020 Solution reverse().mp4
07:38 -
019 Exercise reverse().mp4
01:30 -
018 Singly VS Doubly Linked Lists.mp4
02:40 -
017 Solution Doubly Linked Lists.mp4
08:50 -
015 Doubly Linked Lists.mp4
03:18 -
014 Solution remove().mp4
05:21 -
013 Solution insert().mp4
13:08 -
011 insert().mp4
05:12 -
001 Linked Lists Introduction.mp4
02:26 -
009 Solution prepend().mp4
02:27 -
008 Solution append().mp4
05:25 -
007 Our First Linked List.mp4
08:38 -
006 What Is A Pointer.mp4
05:45 -
005 Solution Why Linked Lists.mp4
05:35 -
004 Exercise Why Linked Lists.mp4
02:05 -
003 Exercise Imposter Syndrome.mp4
02:55 -
002 What Is A Linked List.mp4
04:36
07 – Data Structures Hash Tables
-
001 Hash Tables Introduction.mp4
04:10 -
002 Hash Function.mp4
05:56 -
003 Hash Collisions.mp4
09:43 -
004 Hash Tables In Different Languages.mp4
03:30 -
005 Exercise Implement A Hash Table.mp4
03:50 -
006 Solution Implement A Hash Table.mp4
17:24 -
007 keys().mp4
06:11 -
009 Hash Tables VS Arrays.mp4
02:01 -
010 Exercise First Recurring Character.mp4
01:18 -
011 Solution First Recurring Character.mp4
16:10 -
013 Hash Tables Review.mp4
06:09
06 – Data Structures Arrays
-
001 Arrays Introduction.mp4
13:51 -
002 Static vs Dynamic Arrays.mp4
06:40 -
004 Optional Classes In Javascript.mp4
24:51 -
005 Implementing An Array.mp4
17:19 -
006 Strings and Arrays.mp4
01:04 -
007 Exercise Reverse A String.mp4
01:35 -
008 Solution Reverse A String.mp4
10:31 -
009 Exercise Merge Sorted Arrays.mp4
00:44 -
010 Solution Merge Sorted Arrays.mp4
14:12 -
012 Arrays Review.mp4
03:28
05 – Data Structures Introduction
-
001 Section Overview.mp4
01:58 -
002 What Is A Data Structure.mp4
05:53 -
003 How Computers Store Data.mp4
12:34 -
004 Data Structures In Different Languages.mp4
03:27 -
005 Operations On Data Structures.mp4
03:05
04 – How To Solve Coding Problems
-
001 Section Overview.mp4
05:04 -
002 What Are Companies Looking For.mp4
03:05 -
003 What We Need For Coding Interviews.mp4
03:27 -
004 Exercise Google Interview.mp4
02:31 -
005 Exercise Interview Question.mp4
20:33 -
006 Exercise Interview Question 2.mp4
22:59 -
007 Review Google Interview.mp4
01:30 -
009 Section Summary.mp4
03:35
03 – Big O
-
017 Big O Rule 3.mp4
03:13 -
028 Section Summary.mp4
04:43 -
027 Optional Javascript Loops.mp4
03:26 -
026 Exercise Twitter.mp4
07:13 -
025 Exercise Space Complexity.mp4
06:24 -
024 Space Complexity.mp4
02:22 -
023 3 Pillars Of Programming.mp4
03:32 -
022 O(n!).mp4
01:18 -
021 What Does This All Mean.mp4
05:32 -
020 Big O Cheat Sheet.mp4
03:18 -
019 Big O Rule 4.mp4
06:47 -
018 O(n^2).mp4
07:13 -
002 Setting Up Your Environment.mp4
02:53 -
016 Big O Rule 2.mp4
06:36 -
015 Big O Rule 1.mp4
04:28 -
014 Simplifying Big O.mp4
01:50 -
013 Solution Big O Calculation 2.mp4
02:29 -
011 Solution Big O Calculation.mp4
05:54 -
009 O(1).mp4
06:09 -
008 O(n).mp4
05:39 -
007 Big O and Scalability.mp4
11:08 -
006 What Is Good Code.mp4
06:57 -
003 Section Overview.mp4
02:24
02 – Getting More Interviews
-
001 Section Overview.mp4
05:39 -
002 Resume.mp4
05:09 -
003 Exercise Resume Walkthrough.mp4
17:05 -
004 Resume Review.mp4
02:37 -
006 What If I Don’t Have Enough Experience.mp4
15:02 -
009 LinkedIn.mp4
08:22 -
011 Portfolio.mp4
03:23 -
013 Email.mp4
08:24 -
015 Where To Find Jobs.mp4
06:02 -
017 When Should You Start Applying.mp4
03:34 -
018 Section Summary.mp4
02:17