Section 1 : Introduction
|
Lecture 1 | INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM | |
|
Lecture 2 | About Proctor Testing | |
|
Lecture 3 | About Certification | |
|
Lecture 4 | Remove - INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM |
Section 2 : Getting More Interviews
|
Lecture 1 | Section Overview | 00:05:20 Duration |
|
Lecture 2 | Resume | 00:05:09 Duration |
|
Lecture 3 | Exercise Resume Walkthrough | 00:16:34 Duration |
|
Lecture 4 | Resume Review | 00:02:37 Duration |
|
Lecture 5 | Resources Resume Templates | |
|
Lecture 6 | What If I Don't Have Enough Experience | 00:15:03 Duration |
|
Lecture 7 | Optional Exercise Github Master | |
|
Lecture 8 | 00:08:23 Duration | |
|
Lecture 9 | Optional Exercise LinkedIn Endorsements | |
|
Lecture 10 | Portfolio | 00:03:23 Duration |
|
Lecture 11 | Resources Free Portfolio Templates | |
|
Lecture 12 | 00:08:24 Duration | |
|
Lecture 13 | Resources Email | |
|
Lecture 14 | Where To Find Jobs | 00:06:03 Duration |
|
Lecture 15 | Resources Where To Find Jobs | |
|
Lecture 16 | When Should You Start Applying | 00:03:34 Duration |
|
Lecture 17 | Section Summary | 00:02:17 Duration |
|
Lecture 18 | Monthly Industry Updates |
Section 3 : Big O
|
Lecture 1 | Setting Up Your Environment | 00:02:54 Duration |
|
Lecture 2 | Section Overview | 00:02:10 Duration |
|
Lecture 3 | Python, Java, CC++, C#, Golang, Swift, TypeScriptDeno + JS Solutions! | |
|
Lecture 4 | What Is Good Code | 00:06:57 Duration |
|
Lecture 5 | Big O and Scalability | 00:11:09 Duration |
|
Lecture 6 | O(n) | 00:05:39 Duration |
|
Lecture 7 | O(1) | 00:06:10 Duration |
|
Lecture 8 | Exercise Big O Calculation | |
|
Lecture 9 | Solution Big O Calculation | 00:05:55 Duration |
|
Lecture 10 | Exercise Big O Calculation 2 | |
|
Lecture 11 | Solution Big O Calculation 2 | 00:02:30 Duration |
|
Lecture 12 | Simplifying Big O | 00:01:51 Duration |
|
Lecture 13 | Big O Rule 1 | 00:04:29 Duration |
|
Lecture 14 | Big O Rule 2 | 00:06:37 Duration |
|
Lecture 15 | Big O Rule 3 | 00:03:14 Duration |
|
Lecture 16 | O(n^2) | 00:07:14 Duration |
|
Lecture 17 | Big O Rule 4 | 00:06:47 Duration |
|
Lecture 18 | Big O Cheat Sheet | 00:03:19 Duration |
|
Lecture 19 | What Does This All Mean | 00:05:32 Duration |
|
Lecture 20 | O(n!) | 00:01:18 Duration |
|
Lecture 21 | 3 Pillars Of Programming | 00:03:32 Duration |
|
Lecture 22 | Space Complexity | 00:02:23 Duration |
|
Lecture 23 | Exercise Space Complexity | 00:06:24 Duration |
|
Lecture 24 | Exercise Twitter | 00:07:14 Duration |
|
Lecture 25 | Optional Javascript Loops | 00:03:27 Duration |
|
Lecture 26 | Section Summary | 00:04:44 Duration |
Section 4 : How To Solve Coding Problems
|
Lecture 1 | Section Overview | 00:04:48 Duration |
|
Lecture 2 | What Are Companies Looking For | 00:03:06 Duration |
|
Lecture 3 | What We Need For Coding Interviews | 00:03:27 Duration |
|
Lecture 4 | Exercise Google Interview | 00:00:26 Duration |
|
Lecture 5 | Exercise Interview Question | 00:20:33 Duration |
|
Lecture 6 | Exercise Interview Question 2 | 00:22:59 Duration |
|
Lecture 7 | Review Google Interview | 00:01:30 Duration |
|
Lecture 8 | Optional Exercise Google Interview On Your Own | |
|
Lecture 9 | Section Summary | 00:03:36 Duration |
Section 5 : Data Structures Introduction
|
Lecture 1 | Section Overview | 00:01:42 Duration |
|
Lecture 2 | What Is A Data Structure | 00:05:53 Duration |
|
Lecture 3 | How Computers Store Data | 00:12:34 Duration |
|
Lecture 4 | Data Structures In Different Languages | 00:03:28 Duration |
|
Lecture 5 | Operations On Data Structures | 00:03:05 Duration |
Section 6 : Data Structures Arrays
|
Lecture 1 | Arrays Introduction | 00:13:38 Duration |
|
Lecture 2 | Static vs Dynamic Arrays | 00:06:41 Duration |
|
Lecture 3 | Quick Note Upcoming Video | |
|
Lecture 4 | Optional Classes In Javascript | 00:24:52 Duration |
|
Lecture 5 | Implementing An Array | 00:17:19 Duration |
|
Lecture 6 | Strings and Arrays | 00:01:05 Duration |
|
Lecture 7 | Exercise Reverse A String | 00:01:30 Duration |
|
Lecture 8 | Solution Reverse A String | 00:10:31 Duration |
|
Lecture 9 | Exercise Merge Sorted Arrays | 00:00:44 Duration |
|
Lecture 10 | Solution Merge Sorted Arrays | 00:14:12 Duration |
|
Lecture 11 | Interview Questions Arrays | |
|
Lecture 12 | Arrays Review | 00:03:29 Duration |
Section 7 : Data Structures Hash Tables
|
Lecture 1 | Hash Tables Introduction | 00:03:54 Duration |
|
Lecture 2 | Hash Function | 00:05:56 Duration |
|
Lecture 3 | Hash Collisions | 00:09:44 Duration |
|
Lecture 4 | Hash Tables In Different Languages | 00:03:31 Duration |
|
Lecture 5 | Exercise Implement A Hash Table | 00:03:45 Duration |
|
Lecture 6 | Solution Implement A Hash Table | 00:17:25 Duration |
|
Lecture 7 | keys() | 00:06:12 Duration |
|
Lecture 8 | Bonus keys() Without Collision | |
|
Lecture 9 | Hash Tables VS Arrays | 00:02:01 Duration |
|
Lecture 10 | Exercise First Recurring Character | 00:01:18 Duration |
|
Lecture 11 | Solution First Recurring Character | 00:16:11 Duration |
|
Lecture 12 | Interesting Tidbit Python Dictionaries | |
|
Lecture 13 | Hash Tables Review | 00:06:09 Duration |
Section 8 : Data Structures Linked Lists
|
Lecture 1 | Linked Lists Introduction | 00:02:27 Duration |
|
Lecture 2 | What Is A Linked List | 00:04:37 Duration |
|
Lecture 3 | Exercise Why Linked Lists | 00:02:05 Duration |
|
Lecture 4 | Solution Why Linked Lists | 00:05:36 Duration |
|
Lecture 5 | What Is A Pointer | 00:05:45 Duration |
|
Lecture 6 | Our First Linked List | 00:08:33 Duration |
|
Lecture 7 | Solution append() | 00:05:20 Duration |
|
Lecture 8 | Solution prepend() | 00:02:28 Duration |
|
Lecture 9 | Node Class | 00:02:41 Duration |
|
Lecture 10 | insert() | 00:05:13 Duration |
|
Lecture 11 | Quick Note Upcoming Video | |
|
Lecture 12 | Solution insert() | 00:13:08 Duration |
|
Lecture 13 | Solution remove() | 00:05:21 Duration |
|
Lecture 14 | Doubly Linked Lists | 00:03:18 Duration |
|
Lecture 15 | Exercise Doubly Linked Lists | |
|
Lecture 16 | Solution Doubly Linked Lists | 00:08:51 Duration |
|
Lecture 17 | Singly VS Doubly Linked Lists | |
|
Lecture 18 | Exercise reverse() | 00:01:31 Duration |
|
Lecture 19 | Solution reverse() | 00:07:39 Duration |
|
Lecture 20 | Linked Lists Review | 00:05:08 Duration |
Section 9 : Data Structures Stacks + Queues
|
Lecture 1 | Stacks + Queues Introduction | 00:02:45 Duration |
|
Lecture 2 | Stacks | 00:02:45 Duration |
|
Lecture 3 | Queues | 00:03:31 Duration |
|
Lecture 4 | Exercise Stacks VS Queues | 00:03:06 Duration |
|
Lecture 5 | Solution Stacks VS Queues | |
|
Lecture 6 | Quick Note Upcoming Video | |
|
Lecture 7 | Optional How Javascript Works | 00:24:12 Duration |
|
Lecture 8 | Exercise Stack Implementation (Linked Lists) | 00:02:17 Duration |
|
Lecture 9 | Solution Stack Implementation (Linked Lists) | 00:08:58 Duration |
|
Lecture 10 | Exercise Stack Implementation (Array) | 00:00:53 Duration |
|
Lecture 11 | Solution Stack Implementation (Array) | 00:03:56 Duration |
|
Lecture 12 | Exercise Queue Implementation | 00:01:48 Duration |
|
Lecture 13 | Solution Queue Implementation | 00:07:51 Duration |
|
Lecture 14 | Queues Using Stacks | 00:02:05 Duration |
|
Lecture 15 | Stacks + Queues Review | 00:02:19 Duration |
Section 10 : Data Structures Trees
|
Lecture 1 | Trees Introduction | 00:06:06 Duration |
|
Lecture 2 | Binary Trees | 00:05:45 Duration |
|
Lecture 3 | O(log n) | 00:07:00 Duration |
|
Lecture 4 | Binary Search Trees | 00:06:12 Duration |
|
Lecture 5 | Balanced VS Unbalanced BST | 00:03:39 Duration |
|
Lecture 6 | BST Pros and Cons | 00:02:27 Duration |
|
Lecture 7 | Exercise Binary Search Tree | 00:03:57 Duration |
|
Lecture 8 | Solution insert() | 00:10:11 Duration |
|
Lecture 9 | Solution lookup() | 00:04:55 Duration |
|
Lecture 10 | Bonus Exercise remove() | 00:02:28 Duration |
|
Lecture 11 | Solution remove() | 00:07:41 Duration |
|
Lecture 12 | AVL Trees + Red Black Trees | 00:02:56 Duration |
|
Lecture 13 | Resources AVL Trees + Red Black Trees | |
|
Lecture 14 | Binary Heaps | 00:05:36 Duration |
|
Lecture 15 | Quick Note on Heaps | 00:01:08 Duration |
|
Lecture 16 | Priority Queue | 00:05:28 Duration |
|
Lecture 17 | Trie | 00:03:17 Duration |
|
Lecture 18 | Tree Review | 00:00:52 Duration |
Section 11 : Data Structures Graphs
|
Lecture 1 | Graphs Introduction | 00:02:14 Duration |
|
Lecture 2 | Types Of Graphs | 00:03:32 Duration |
|
Lecture 3 | Exercise Guess The Graph | 00:02:45 Duration |
|
Lecture 4 | Graph Data | 00:05:59 Duration |
|
Lecture 5 | Exercise Graph Implementation | 00:04:06 Duration |
|
Lecture 6 | Solution Graph Implementation | 00:04:51 Duration |
|
Lecture 7 | Graphs Review | 00:02:05 Duration |
|
Lecture 8 | Data Structures Review | 00:01:52 Duration |
|
Lecture 9 | What Else Is Coming Up | 00:01:53 Duration |
Section 12 : Algorithms Recursion
|
Lecture 1 | Introduction to Algorithms | 00:03:36 Duration |
|
Lecture 2 | Recursion Introduction | 00:05:37 Duration |
|
Lecture 3 | Stack Overflow | 00:06:17 Duration |
|
Lecture 4 | Anatomy Of Recursion | |
|
Lecture 5 | Exercise Factorial | 00:03:25 Duration |
|
Lecture 6 | Solution Factorial | 00:06:20 Duration |
|
Lecture 7 | Exercise Fibonacci | 00:01:59 Duration |
|
Lecture 8 | Solution Fibonacci | 00:11:22 Duration |
|
Lecture 9 | Recursive VS Iterative | 00:04:16 Duration |
|
Lecture 10 | When To Use Recursion | 00:03:54 Duration |
|
Lecture 11 | Exercise Reverse String With Recursion | |
|
Lecture 12 | Recursion Review | 00:02:47 Duration |
Section 13 : Algorithms Sorting
|
Lecture 1 | Sorting Introduction | 00:06:46 Duration |
|
Lecture 2 | The Issue With sort() | 00:06:51 Duration |
|
Lecture 3 | Sorting Algorithms | 00:03:38 Duration |
|
Lecture 4 | Bubble Sort | 00:03:46 Duration |
|
Lecture 5 | Exercise Bubble Sort | |
|
Lecture 6 | Solution Bubble Sort | 00:05:07 Duration |
|
Lecture 7 | Selection Sort | 00:02:39 Duration |
|
Lecture 8 | Exercise Selection Sort | |
|
Lecture 9 | Solution Selection Sort | 00:02:23 Duration |
|
Lecture 10 | Dancing Algorithms | 00:01:36 Duration |
|
Lecture 11 | Insertion Sort | 00:02:38 Duration |
|
Lecture 12 | Exercise Insertion Sort | |
|
Lecture 13 | Solution Insertion Sort | 00:02:07 Duration |
|
Lecture 14 | Merge Sort and O(n log n) | 00:08:59 Duration |
|
Lecture 15 | Exercise Merge Sort | |
|
Lecture 16 | Solution Merge Sort | 00:08:59 Duration |
|
Lecture 17 | Stable VS Unstable Algorithms | |
|
Lecture 18 | Quick Sort | 00:07:40 Duration |
|
Lecture 19 | Optional Exercise Quick Sort | |
|
Lecture 20 | Which Sort Is Best | 00:04:41 Duration |
|
Lecture 21 | Resources Heap Sort | |
|
Lecture 22 | Radix Sort + Counting Sort | |
|
Lecture 23 | Resources Radix Sort + Counting Sort | |
|
Lecture 24 | Exercise Sorting Interview | 00:01:27 Duration |
|
Lecture 25 | Solution Sorting Interview | 00:07:07 Duration |
|
Lecture 26 | Sorting In Your Language | 00:01:27 Duration |
|
Lecture 27 | Sorting Review | 00:02:53 Duration |
Section 14 : Algorithms Searching + BFS + DFS
|
Lecture 1 | Searching + Traversal Introduction | 00:01:19 Duration |
|
Lecture 2 | Linear Search | 00:03:37 Duration |
|
Lecture 3 | Binary Search | 00:06:05 Duration |
|
Lecture 4 | Graph + Tree Traversals | 00:03:56 Duration |
|
Lecture 5 | BFS Introduction | 00:02:45 Duration |
|
Lecture 6 | DFS Introduction | 00:03:23 Duration |
|
Lecture 7 | BFS vs DFS | 00:03:21 Duration |
|
Lecture 8 | Resources BFS vs DFS | |
|
Lecture 9 | Exercise BFS vs DFS | 00:00:44 Duration |
|
Lecture 10 | Solution BFS vs DFS | 00:03:16 Duration |
|
Lecture 11 | breadthFirstSearch() | 00:09:15 Duration |
|
Lecture 12 | breadthFirstSearchRecursive() | 00:05:34 Duration |
|
Lecture 13 | PreOrder, InOrder, PostOrder | 00:05:21 Duration |
|
Lecture 14 | depthFirstSearch() | 00:12:03 Duration |
|
Lecture 15 | Optional Exercise Validate A BST | |
|
Lecture 16 | Graph Traversals | 00:03:53 Duration |
|
Lecture 17 | BFS in Graphs | 00:02:07 Duration |
|
Lecture 18 | DFS in Graphs | 00:02:50 Duration |
|
Lecture 19 | Dijkstra + Bellman-Ford Algorithms | 00:05:12 Duration |
|
Lecture 20 | Searching + Traversal Review | 00:04:22 Duration |
Section 15 : Algorithms Dynamic Programming
|
Lecture 1 | Dynamic Programming Introduction | 00:01:36 Duration |
|
Lecture 2 | Memoization 1 | 00:07:47 Duration |
|
Lecture 3 | Memoization 2 | 00:03:56 Duration |
|
Lecture 4 | Fibonacci and Dynamic Programming | 00:05:33 Duration |
|
Lecture 5 | Dynamic Programming | 00:05:48 Duration |
|
Lecture 6 | Implementing Dynamic Programming | 00:09:12 Duration |
|
Lecture 7 | Interview Questions Dynamic Programming | |
|
Lecture 8 | Dynamic Programming Review | 00:04:45 Duration |
Section 16 : Non Technical Interviews
|
Lecture 1 | Section Overview | 00:02:24 Duration |
|
Lecture 2 | During The Interview | 00:09:04 Duration |
|
Lecture 3 | Exercise Hero Stories | |
|
Lecture 4 | Tell Me About Yourself | 00:05:30 Duration |
|
Lecture 5 | Exercise Your Pitch | |
|
Lecture 6 | Why Us | 00:05:07 Duration |
|
Lecture 7 | Tell Me About A Problem You Have Solved | 00:05:10 Duration |
|
Lecture 8 | Exercise Past Projects | |
|
Lecture 9 | What Is Your Biggest Weakness | 00:02:19 Duration |
|
Lecture 10 | Exercise Your Biggest Weakness | |
|
Lecture 11 | Any Questions For Us | 00:03:24 Duration |
|
Lecture 12 | Resources Questions To Ask A Company | |
|
Lecture 13 | Secret Weapon | 00:08:12 Duration |
|
Lecture 14 | After The Interview | 00:05:24 Duration |
|
Lecture 15 | Section Summary | 00:03:56 Duration |
Section 17 : Offer + Negotiation
|
Lecture 1 | Section Overview | 00:01:55 Duration |
|
Lecture 2 | Handling Rejection | 00:04:08 Duration |
|
Lecture 3 | Negotiation 101 | 00:09:40 Duration |
|
Lecture 4 | Handling An Offer | 00:09:03 Duration |
|
Lecture 5 | Handling Multiple Offers | 00:07:29 Duration |
|
Lecture 6 | Getting A Raise | 00:07:41 Duration |
|
Lecture 7 | Exercise Negotiation Master | |
|
Lecture 8 | Section Summary | 00:02:10 Duration |
Section 18 : Thank You
|
Lecture 1 | Become an Alumni | |
|
Lecture 2 | Thank You | 00:00:37 Duration |
|
Lecture 3 | What You Can Do Now |
Section 19 : Extras Google, Amazon, Facebook Interview Questions
|
Lecture 1 | Coding Problems | 00:01:06 Duration |
|
Lecture 2 | Top Interview Questions | |
|
Lecture 3 | Amazon Interview Questions | |
|
Lecture 4 | Facebook Interview Questions | |
|
Lecture 5 | Google Interview Questions | |
|
Lecture 6 | Domain Specific Questions |
Section 20 : Contributing To Open Source To Gain Experience
|
Lecture 1 | Contributing To Open Source | 00:10:49 Duration |
|
Lecture 2 | Contributing To Open Source 2 | 00:09:43 Duration |
|
Lecture 3 | Exercise Contribute To Open Source |
Section 21 : Bonus Extra Bits
|
Lecture 1 | Learning Guideline | |
|
Lecture 2 | Quick Note Upcoming Videos | |
|
Lecture 3 | From JTS Learn to Learn | 00:02:00 Duration |
|
Lecture 4 | From JTS Start With Why | |
|
Lecture 5 | Coding Challenges | |
|
Lecture 6 | How To Use Leetcode | 00:02:28 Duration |