語言：英語|大?。?.40 GB |持續(xù)時間：22小時41米

在谷歌、臉書、蘋果和亞馬遜等FAANG公司面試時練習(xí)數(shù)據(jù)結(jié)構(gòu)和算法問題

你將學(xué)到什么

使用不同的數(shù)據(jù)結(jié)構(gòu)和算法解決從簡單到困難的問題

如何解決主要科技公司提出的一些最受歡迎的面試問題

循序漸進(jìn)、系統(tǒng)地分解編碼面試問題

流行問題模式

算法和數(shù)據(jù)結(jié)構(gòu)

要求

有javascript基礎(chǔ)知識者優(yōu)先

具備基本數(shù)據(jù)結(jié)構(gòu)和算法的基礎(chǔ)知識者優(yōu)先

描述

LeetCode本質(zhì)上是一個由最受歡迎的科技公司（谷歌、亞馬遜、臉書、微軟等）提出的真實(shí)面試問題的巨大存儲庫。LeetCode的問題也是它的優(yōu)勢，它非常巨大，事實(shí)上，來自最受歡迎公司的面試官經(jīng)常直接問他們在LeetCode上找到的問題，因此，很難在大量的問題中找到真正重要的問題，這就是本課程的目的。我在LeetCode上花了無數(shù)個小時，我告訴你，你不必做同樣的事情，仍然可以在大型科技公司找到工作。課程概述：在本課程中，我整理了這些大公司提出的最重要、最受歡迎的面試問題，并以真正的循序漸進(jìn)的方式進(jìn)行了解釋，以幫助您準(zhǔn)確了解如何解決這些類型的問題。這些問題是經(jīng)過精心挑選的，以確保全面涵蓋最流行的技術(shù)、數(shù)據(jù)結(jié)構(gòu)，以及面試中使用的算法，這樣你就可以概括你在其他問題上學(xué)到的模式。每個問題都有多個視頻：解釋和直覺視頻：我們對問題及其解決方案進(jìn)行詳細(xì)解釋，這個視頻會更長，因?yàn)槲覀儗栴}進(jìn)行一步一步的解釋。編碼視頻：我們一起對解釋視頻中討論的解決方案進(jìn)行編碼。演練視頻：我們仔細(xì)檢查每一行代碼，看看它的作用。我們將在本課程中使用基本的javascript來編碼我們的解決方案，本課程的編碼部分優(yōu)先考慮先前的javascript知識，但不是必需的。這些問題被分類以便于導(dǎo)航，并將定期更新為更流行和有趣的問題。本課程將涵蓋的一些內(nèi)容包括：數(shù)組和字符串面試問題。搜索面試問題和算法。動態(tài)編程面試問題?；厮菝嬖噯栴}（逐步可視化）。樹和圖面試問題和算法。數(shù)據(jù)結(jié)構(gòu)，如堆棧、隊列、地圖、鏈表等。換句話說，這門課程是你理想工作的一站式商店。

Overview
Section 1: Microsoft Array Question: Container with most water (Medium)

Lecture 1 Introduction to the problem

Lecture 2 Brute Force solution Intuition

Lecture 3 pseudocode walkthrough

Lecture 4 Better Approach intuition

Lecture 5 Approach 2 Pseudocode walkthrough

Lecture 6 Implementing the code

Section 2: Google Array Question: Valid mountain array (Easy)

Lecture 7 Introduction to the problem

Lecture 8 How to think about this problem

Lecture 9 Pseudocode Walkthrough

Lecture 10 Implementing the code

Section 3: Google Array Question: Boats to save people (Medium)

Lecture 11 Problem Introduction

Lecture 12 How to intuitively think about this problem

Lecture 13 Pseudocode Walkthrough

Lecture 14 Implementing the code

Section 4: Facebook Array Question: Move Zeroes (Easy)

Lecture 15 Brute force Intuition

Lecture 16 Brute force pseudocode walkthrough

Lecture 17 Better Approach Intuition

Lecture 18 Better Approach Pseudocode walkthrough

Lecture 19 Implementing the code

Section 5: Amazon Array Question: Longest substring without repeating characters (Medium)

Lecture 20 Introduction to the problem

Lecture 21 Brute Force Intuition

Lecture 22 Pseudocode walkthrough

Lecture 23 Approach 2 Intuition

Lecture 24 Approach 2 pseudocode walkthrough

Lecture 25 Implementing the code

Section 6: Arrays Question:Find first and last position of element in sorted Array (Medium)

Lecture 26 Introduction to the problem and brute force approach

Lecture 27 Brute force Pseudocode walkthrough

Lecture 28 Approach 2: Optimal Approach intuition

Lecture 29 Pseudocode walkthrough part 1

Lecture 30 Pseudocode walkthrough part 2

Lecture 31 Implementing the code

Section 7: Google Array question: first bad version (Easy)

Lecture 32 Introduction To The Problem And Brute Force Approach

Lecture 33 Optimal Solution Intuition

Lecture 34 Optimal solution pseudocode walkthrough

Lecture 35 Implementing the code

Section 8: Microsoft Math Question: Missing Number (Easy-ish)

Lecture 36 Introduction to the problem

Lecture 37 Approach 1: Brute Force Approach

Lecture 38 Approach 2: A Better Approach Explanation

Lecture 39 PseudoCode Walkthrough For Approach 2

Lecture 40 Implementing the code

Lecture 41 Approach 3: Optimal Approach

Lecture 42 Implementing the optimal approach

Section 9: Amazon Math Question: Count Primes

Lecture 43 Problem Introduction And Brute Force Explanation

Lecture 44 Pseudocode Walkthrough For Brute Force Approach

Lecture 45 Approach 2: Optimal solution

Lecture 46 Pseudocode Walkthrough For Optimal Approach

Lecture 47 Code Implementation

Section 10: Airbnb Math Question: Single Number

Lecture 48 Introduction to the problem and brute force approach

Lecture 49 Pseudocode walkthrough for brute approach

Lecture 50 Approach 2: better Approach

Lecture 51 Implementing the code

Lecture 52 Approach 3: optimal approach

Lecture 53 Implementing the optimal approach

Section 11: Amazon Math Question: Robot return to origin (Easy)

Lecture 54 Explaining the problem

Lecture 55 Implementing the code

Section 12: Facebook Math Question: Add Binary (Easy)

Lecture 56 Introduction to the problem

Lecture 57 Examples of binary additions

Lecture 58 Pseudocode Implementation

Lecture 59 Pseudocode Walkthrough

Lecture 60 Implementing the code

Section 13: Google Hash Tables / Dictionaries question: Two Sum (Easy)

Lecture 61 Approach 1: Introduction to the problem and brute force approach

Lecture 62 Brute force Pseudocode Implementation

Lecture 63 Pseudocode Walkthrough

Lecture 64 Approach 2: Optimal Approach Explanation

Lecture 65 Pseudocode Walkthrough

Lecture 66 Code Implementation

Section 14: Google Hash Tables / Dictionaries question: Contains Duplicate

Lecture 67 Introduction to the problem and multiple approaches

Lecture 68 Optimal Approach

Lecture 69 Implementing the code

Section 15: Google Hash Tables / Dictionaries question: Majority Element

Lecture 70 Approach 1 Intuition

Lecture 71 Approach 1 Pseudocode Walkthrough

Lecture 72 Approach 2 - Majority Element Intuition

Lecture 73 Implementing Approach 2 code

Lecture 74 Approach 3 Intuition - Optimal solution

Lecture 75 Approach 3 Walkthrough - Optimal solution

Lecture 76 Implementing Approach 3 (optimal approach)

Section 16: Facebook Hash Tables / Dictionaries question: Group Anagrams (Medium)

Lecture 77 Explanation - Group Anagrams - Medium #49

Lecture 78 Code - Group Anagrams - Medium #49

Section 17: Hash Tables / Dictionaries question: 4sum 2 (Medium)

Lecture 79 Brute force Explanation

Lecture 80 Brute Force Pseudocode Walkthrough

Lecture 81 Approach 2: Optimal approach

Lecture 82 Implementing the code

Section 18: Microsoft Hash Tables / Dictionaries question: LRU Cache (Medium)

Lecture 83 Introduction to the problem

Lecture 84 Input/Ouput for the problem

Lecture 85 Intuition behind the problem

Lecture 86 Pseudocode implementation

Lecture 87 Pseudocode Walkthrough

Section 19: Linkedin Hash Tables / Dictionaries question: Minimum Window Substring (Hard)

Lecture 88 Explanation - Minimum Window Substring - part 1

Lecture 89 Explanation - Minimum window substring - part 2

Lecture 90 Explanation - Minimum window substring - part 3

Lecture 91 Pseudocode Implementation

Lecture 92 Pseudocode Walkthrough

Lecture 93 Code - Minimum Window Substring - Hard #76

Section 20: Apple Linked list question: Merge Two Sorted Lists (Easy)

Lecture 94 Explanation - Merge Two Sorted Lists - Easy #21

Lecture 95 Pseudocode Implementation - Merge Two Sorted Lists - Easy #21

Lecture 96 Walkthrough - Merge Two Sorted Lists - Easy #21

Lecture 97 Code - Merge Two Sorted Lists - Easy #21

Section 21: Amazon Linked list question: Linked list cycle (Medium)

Lecture 98 Explanation - Linked List Cycle - Easy #141

Lecture 99 Intuition - Linked List Cycle - Easy #141

Lecture 100 Walkthrough - Linked List Cycle - Easy #141

Lecture 101 Code - Linked List Cycle - Easy #141

Section 22: Microsoft Linked list question: Reverse linked list (Medium)

Lecture 102 Explanation - Reverse Linked List

Lecture 103 Intuition - Reverse Linked List

Lecture 104 pseudocode Implementation & Walkthrough - Reverse Linked List

Lecture 105 Implementing the code - Reverse Linked List

Section 23: Adobe Linked list question: Add two numbers (Medium)

Lecture 106 Explanation - Add Two Numbers

Lecture 107 Intuition - Add Two Numbers

Lecture 108 Pseudocode Implementation - Add Two Numbers

Lecture 109 Walkthrough - Add Two Numbers - Medium #2

Lecture 110 Code - Add Two Numbers

Section 24: Linked list question: Remove Nth node from end of list (Medium)

Lecture 111 Explanation - Remove Nth Node From End of List

Lecture 112 Intuition - Remove Nth Node From End of List

Lecture 113 Walkthrough - Remove Nth Node From End of List

Lecture 114 Approach 2 Explanation - Remove Nth Node From End of List

Lecture 115 Approach 2 Walkthrough - Remove Nth Node From End of List - Medium #19

Lecture 116 Code - Remove Nth Node From End of List

Section 25: Linked list question: Odd Even linked list (Medium)

Lecture 117 Explanation - Odd Even Linked List

Lecture 118 Intuition - Odd Even Linked List

Lecture 119 Pseudocode Implementation - Odd Even Linked List

Lecture 120 Walkthrough - Odd Even Linked List

Lecture 121 Code - Odd Even Linked List

Section 26: Google Linked list question: Merge K sorted lists (Hard)

Lecture 122 Explanation - Merge K Sorted Lists - Hard #23

Section 27: Facebook Backtracking question: Subsets (Medium)

Lecture 123 Explanation - Subsets

Lecture 124 Cascading solution explanation - Subsets

Lecture 125 Cascading solution walkthrough - Subsets

Lecture 126 Backtracking Approach 2 explanation - Subsets

Lecture 127 Implementing the code

Section 28: Amazon Backtracking question: Letter Combination of a Phone Number (Medium)

Lecture 128 Explanation - Letter Combinations of a Phone Number

Lecture 129 Intuition - Letter Combinations of a Phone Number

Lecture 130 Walkthrough - Letter Combinations of a Phone Number

Lecture 131 Code - Letter Combinations of a Phone Number

Section 29: Uber Backtracking question: Combination Sum (Medium)

Lecture 132 Explanation the problem

Lecture 133 Intuition behind the problem

Lecture 134 Walkthrough over the pseudocode

Lecture 135 Implementing the code

Section 30: Bloomberg Backtracking question: Palindrome Partitioning (Medium)

Lecture 136 Explaining the problem

Lecture 137 Pseudocode implementation

Lecture 138 Walkthrough over pseudocode

Lecture 139 Implementing the code

Section 31: Microsoft Trees question: Symmetric Trees (Easy)

Lecture 140 Explaining the problem

Lecture 141 Intuition behind the problem

Lecture 142 Walkthrough over pseudocode

Lecture 143 Implementing the code

Section 32: Google Trees question: Maximum Depth of a Binary Tree (Easy)

Lecture 144 Explaining the problem

Lecture 145 Intuition and pseudocode implementation

Lecture 146 Walkthrough over pseudocode

Lecture 147 Implementing the code

Section 33: Amazon Trees question: Path Sum (Easy)

Lecture 148 Explaining the problem

Lecture 149 Intuition behind the problem

Lecture 150 Walkthrough over pseudocode

Lecture 151 Coding the solution

Section 34: Facebook Trees question: Lowest Common Ancestor of a Binary Tree (Medium)

Lecture 152 Explaining the problem

Lecture 153 Intuition behind the problem

Lecture 154 Pseudocode implementation

Lecture 155 Walkthrough over pseudocode

Section 35: Google Trees question: Kth Smallest Element In a BST (Medium)

Lecture 156 Explaining the problem

Lecture 157 Optimized Solution Explanation- Kth Smallest Element in a BST - Medium #230

Lecture 158 Code - Kth Smallest Element in a BST - Medium #230

Section 36: Microsoft Trees question: Serialise And Deserialise Binary Tree (Hard)

Lecture 159 Explaining the "Serialisation"

Lecture 160 Walkthrough over pseudocode (Serialisation)

Lecture 161 Explaining the "Deserialisation"

Lecture 162 Walkthrough over pseudocode (Deserialisation)

Section 37: Microsoft Trees question: Binary Tree Maximum Path Sum (Hard)

Lecture 163 Explaining the problem

Lecture 164 Intuition behind the problem

Lecture 165 Walkthrough over pseudocode

Lecture 166 Coding the solution

Section 38: Google Stack Question: Min Stack (Easy)

Lecture 167 Brute force explanation - Min Stack - Easy #155

Lecture 168 Walkthrough over pseudocode

Lecture 169 Optimal solution explanation

Section 39: Amazon Stack Question: Valid Parenthesis (Easy)

Lecture 170 Explaining the problem

Lecture 171 Intuition behind this problem

Lecture 172 Pseudocode Implementation

Lecture 173 Walkthrough over the pseudocode

Lecture 174 Code - Valid Parenthesis - Easy #20

Section 40: Apple Stack Question: Binary Tree Level Order Traversal (Medium)

Lecture 175 Explaining the problem

Lecture 176 Walkthrough over pseudocode

Lecture 177 Implementing the code

Section 41: Microsoft Queue Question: Binary Tree Zigzag Level Order Traversal (Medium)

Lecture 178 Explaining the problem

Lecture 179 Intuition behind the problem

Lecture 180 Walkthrough over pseudocode

Lecture 181 Optimal solution explanation

Lecture 182 Optimal solution pseudocode walkthrough

Lecture 183 Implementing the code

Section 42: Stack Question: Binary Tree Postorder Traversal (Medium)

Lecture 184 Explanation of the problem

Lecture 185 Implementing the code

Section 43: Google Dynamic Programming Question: House Robber (Easy)

Lecture 186 Explanation behind the problem

Lecture 187 Intuition behind the problem

Lecture 188 2nd Approach: Bottom Up dynamic programming

Lecture 189 Walkthrough behind pseudocode

Lecture 190 Implementing the code

Section 44: Facebook Dynamic Programming Question: Best Time To Buy And Sell Stocks (Easy)

Lecture 191 Explanation behind the problem

Lecture 192 Intuition behind the problem

Lecture 193 Walkthrough over pseudocode

Lecture 194 Optimal solution explanation

Lecture 195 Coding the solution

Section 45: Amazon Dynamic Programming Question: Climbing Stairs (Easy)

Lecture 196 Explaining the problem

Lecture 197 Intuition behind the problem

Lecture 198 Implementation the pseudocode

Lecture 199 Bottom up approach explanation

Lecture 200 Bottom up approach walkthrough - Climbing Stairs - Easy #70

Lecture 201 Bottom up optimization - Climbing Stairs - Easy #70

Lecture 202 Code - Climbing Stairs - Easy #70

Section 46: Google Dynamic Programming Question: Coin Change (Medium)

Lecture 203 Explaining the problem

Lecture 204 Intuition behind the problem

Lecture 205 Pseudocode Implementation and optimisation

Lecture 206 Bottom up approach explanation

Lecture 207 Implementing the code

Section 47: Bloomberg Dynamic Programming Question: Unique Paths (Medium)

Lecture 208 Explaining the problem

Lecture 209 Pseudocode Implementation and walkthrough

Lecture 210 Implementing the code

Section 48: Microsoft Dynamic Programming Question: Longest Palindromic Substring (Medium)

Lecture 211 Explanation of the problem

Lecture 212 Initial Intuition behind the problem

Lecture 213 Optimising the previous solution

Lecture 214 Pseudocode Implementation

Lecture 215 Walkthrough over pseudocode

Lecture 216 Implementing the code

Section 49: Amazon Dynamic Programming Question: Trapping Rain Water (Hard)

Lecture 217 Explaining the problem

Lecture 218 Implementing the solution

鏈接：https://pan.baidu.com/s/1fL9diMiIHusTo_nYQnlZRw?

提取碼：yene?

--來自百度網(wǎng)盤超級會員V6的分享