Module 0: Welcome to #FullStackBuilder!
Week #1: Module 1 - Big O and Time Complexity
Week 1: Module 2 - Primitive Types
Week 2: Module 3 - Arrays
-
Arrays: Important Methods (3:24)
-
Common Traversals - Pattern 1.2.3 (4:05)
-
Storing Intermediate States (6:25)
-
Strategy (3:14)
-
**Success Mindset** - You miss 100% of the shots you don't take
-
HW - C01_plusOne
-
HW - C02_moveZeroes
-
HW - C03_jumpToEnd
-
HW - C04_multiplyArr
-
HW - C05_findKthLargest
-
HW - C06_pascal
-
HW - C07_mergeIntervals
-
HW - C08_subsets
-
HW - C09_buySellStockOnce
-
HW - C10_deleteDuplicate
-
HW - C11_spiralTraversal
-
HW - C12_twoSum
-
HW - C13_buySellStockTwice
-
HW - C14_intervalCapacity
Week 3: Module 4 - Strings
-
Strings: Introduction and Important Methods (3:21)
-
Common Traversal and Top Tips (5:57)
-
Case Study: Group Anagrams (6:46)
-
**Success Mindset** - Starve Your Distractions
-
HW - D01_zipZap
-
HW - D02_repeatString
-
HW - D03_findDuplicate
-
HW - D04_compressChar
-
HW - D05_groupAnagram
-
HW - D06_replaceWithPlus
-
HW - D07_reverseString
-
HW - D08_columnTitle
-
HW - D09_convertNumberToWords
Week 3: Module 5: Stacks, Queues and Hash Tables
Week 4: Module 6 - Recursion
Week 4: Module 7 - Searching
Week 5: Module 8 - Sorting
Week 5: Module 9 - Trees
-
Introduction (6:07)
-
Tree Traversals (3:54)
-
Tries (6:13)
-
Pitfalls and How to Approach (7:39)
-
HW - J01_allPaths
-
HW - J02_breadthFirstSearch
-
HW - J03_findLCA
-
HW - J04_isBalancedBinaryTree
-
HW - J05_isSymmetric
-
HW - J06_evenOddLevelSumDifference
-
HW - J07_findKthNodeWithInorder
-
HW - J08_pathsWithSum
-
HW - J09_inorderNextNodex
-
HW - J10_createMinimalHeightTree
-
HW - J11_countNodesInRange
-
HW - J12_closestElement
-
HW - J13_lowestCommonAncestor
-
HW - J14_findCeiling
-
HW - J15_kthLargest
-
HW - J16_isBinarySearchTree
-
HW - J17_isOrderedNodes
-
HW - J18_secondLargestElem
-
HW - J19_minHeightBst
-
HW - J20_addGreaterValue
Week 6: Module 10 - Linked List
Week 7: Module 11: Graphs
Week 7: Module 12 - System Design
Week 8: Module 13 - Dynamic Programming
-
Introduction: Overview (2:11)
-
Introduction: The characteristics of DP problems
-
Introduction: Techniques (6:50)
-
Case Study: Fibonacci Sequence - Introduction (2:15)
-
Case Study: Fibonacci Sequence - Implementation (2:33)
-
Case Study: Fibonacci Sequence - Top-down DP Implementation (2:36)
-
Case Study: Fibonacci Sequence - Time Complexity (2:12)
-
Case Study: Fibonacci Sequence - Evaluation Order (Important) (6:50)
-
Case Study: Fibonacci Sequence - Bottom-up DP Implementation (5:20)
-
Advanced Dynamic Programming Example: Maximum Stolen Value (111:48)
-
Case Study: Fibonacci Sequence (18:56)
-
HW - M01_maxStickValue
-
HW - M02_findChange
-
HW - M03_distinctSubsequences
-
HW - M04_editDistance
-
HW - M05_findDiceThrowWay
-
HW - M06_knapsack
-
HW - M07_longestSubsequence
-
HW - M08_staircase
-
HW - M09_maxStolenValue
Week 8: Module 14 - Summary
[Bonus] Week 9: Module 15 - JavaScript
-
JavaScript: Closure (48:48)
-
'this' keyword (25:52)
-
Bind (14:10)
-
Call and Apply (1:54)
-
Design Pattern: Observer (5:32)
-
Design Pattern: Singleton (2:43)
-
Design Pattern: Self Invoking Function (6:48)
-
The famous 'Promise'
-
HW - N01_bind_part1
-
HW - N02_bind_part1
-
HW - N03_eventEmitter
-
HW - N04_flattenArray
[Bonus] Week #10: Module 16 - Other topics
Module 14: Web Development
LIVE COACHING and Q&A CALLS
-
March 8th, 2019: Complexity Analysis and Primitive Types (85:33)
-
March 21st, 2019: Arrays (105:09)
-
March 25th, 2019: Strings (117:54)
-
April 1st, 2019: Recursion (104:10)
-
April 4th, 2019: Searching (107:57)
-
April 8th, 2019: Sorting (106:46)
-
April 11th: HW discussion (90:21)
-
April 15th, 2019: Trees (118:32)
-
April 18th, 2019: Graphs (111:43)
-
April 22nd, 2019: Linked List (64:08)
-
April 25th, 2019: Dynamic Programming (121:11)
-
April 29th, 2019: System Design (135:26)
-
May 2nd, 2019: JavaScript (122:33)
-
May 6th, 2019: Web Development (115:42)
-
May 9th, 2019: Summary and Strategy (86:08)
-
August 6th, 2019: Orientation (42:10)
-
August 13th, 2019: Bit Manipulation and Array (98:27)
-
August 20th, 2019: Strings, Stacks, Queues, and Hash Tables (109:09)
-
August 27th, 2019: Recursion and Searching (98:47)
-
September 11th: Framework to Solving Traversable Data Structure (66:04)
-
September 17th, 2019: Graphs and Linked Lists (125:17)
-
September 24th, 2019: Dynamic Programming (96:47)
-
October 1st, 2019: System Design (118:28)
-
October 8th, 2019: JavaScript and Job Search Strategies / Tips (89:42)
-
October 22nd, 2019: Arrays and Strings (108:26)
-
October 29th, 2019: Stacks, Queues, Hash Tables, Recursion and Searching (55:46)
-
November 5th, 2019: Sorting and Tree (72:34)
-
November 12th, 2019: Graphs and Linked List (78:16)
-
November 19th, 2019: Dynamic Programming (54:07)
Homework Solutions
-
B01_countBits
-
B02_divide
-
B03_conversion
-
B04_isPrime
-
B05_swapBits
-
B06_rectOverlap
-
B07_isPalindromeNumber
-
B08_reverseDigits
-
B09_toString
-
B10_hammingDistance
-
C01_plusOne
-
C02_moveZeroes
-
C03_jumpToEnd
-
C04_multiplyArr
-
C05_findKthLargest
-
C06_pascal
-
C07_mergeIntervals
-
C08_subsets
-
C09_buySellStockOnce
-
C10_deleteDuplicate
-
C11_spiralTraversal
-
C12_twoSum
-
C13_buySellStockTwice
-
C14_intervalCapacity
-
D01_zipZap
-
D02_repeatString
-
D03_findDuplicate
-
D04_compressChar
-
D05_groupAnagram
-
D06_replaceWithPlus
-
D07_reverseString
-
D08_columnTitle
-
D09_convertNumberToWords
-
E01_evaluateRPN
-
E02_isWellFormed
-
E03_findNearestRepetition
-
F01_countSubstring
-
F02_countTriangleStone
-
F03_countDigit
-
F04_countSpace
-
F05_power
-
G01_searchFirstOfTarget
-
G02_searchEntryEqualToItsIndex
-
G03_searchSmallestInCyclicalArr
-
G04_squareRoot
-
G05_matrixSearch
-
G06_findMissingNumber
-
G07_optimumDeliveryJob
-
G08_countOccurrence
-
G09_findSmallestMissingNumber
-
H01_intersectTwoSortedArrays
-
H02_mergeTwoSortedArrays
-
H03_mergeIntervals
-
J01_allPaths
-
J02_breadthFirstSearch
-
J03_findLCA
-
J04_isBalancedBinaryTree
-
J05_isSymmetric
-
J06_evenOddLevelSumDifference
-
J07_findKthNodeWithInorder
-
J08_pathsWithSum
-
J09_inorderNextNodex
-
J10_createMinimalHeightTree
-
J11_countNodesInRange
-
J12_closestElement
-
J13_lowestCommonAncestor
-
J14_findCeiling
-
J15_kthLargest
-
J16_isBinarySearchTree
-
J17_isOrderedNodes
-
J18_secondLargestElem
-
J19_minHeightBst
-
J20_addGreaterValue
-
K01_kthToLinkedList
-
K02_isCircularLinkedList
-
K03_removeDuplicates
-
K04_removeKthLast
-
K05_addTwoNumbers
-
L01_graphBFS
-
L02_fillPaint
-
L03_searchIsland
-
L04_getKnightMinStep
-
L05_searchMaze
-
L06_cloneAGraph
-
L07_hasRoute
-
L08_wordLadder
-
M01_maxStickValue
-
M02_findChange
-
M03_distinctSubsequences
-
M04_editDistance
-
M05_findDiceThrowWay
-
M06_knapsack
-
M07_longestSubsequence
-
M08_staircase
-
M09_maxStolenValue
-
n_001_bind_part1
-
n_002_bind_part2
-
n_003_eventEmitter
-
n_004_flattenArr
