┏July
┣━━Day 000 → Resources ⋰ Notes
┗━━Day 000 → Pre-Course Work
┏August
┣━━Week 01 → Basic ⋰ Advanced JS
┣━━Week 02 → Data Structures I & II
┣━━Week 03 → DOM ⋰ React I
┗━━Week 04 → React II ⋰ Redux
┏September
┣━━Week 05 → HTTP/AJAX ⋰ SPA/Routing
┣━━Week 06 → Client Testing ⋰ Node/Express
┣━━Week 07 → MongoDB I & II
┗━━Week 08 → MongoDB III ⋰ Auth
┏October
┣━━Week 09 → Client Auth ⋰ Server Testing
┣━━Week 10 → React Native I ⋰ React Native II
┣━━Week 11 → DevOps & Deployment
┗━━Week 12 → Break Week — Personal Project
┏November
┣━━Week 13 → Computer Architecture I & II
┣━━Week 14 → Intro to C ⋰ Intro to Operating Systems
┗━━Week 15 → OS: Processes ⋰ OS: Scheduler
┏December
┗━━Holiday Break
┏January
┣━━Week 16 → Theory of Computation ⋰ Algorithms Refresher
┣━━Week 17 → Graphs ⋰ Algorithms II
┗━━Week 18 → Security ⋰ Cellular Automata
┏February
┗━━Week 01 → Started 14-Week Teaching Assistant/Web Developer Internship!
┣━━CS2 Recorded Lectures Spreadsheet
┣━━Syllabus
┣━━Git Commands Cheat Sheet
┣━━GitHub Cheat Sheet
┣━━CLI Cheat Sheet
┗━━JavaScript Notes
Pre-Course Work — Outline
₁₎ Lambda School — JavaScript Minicamp
┣━HW 1 (7/23/17)
┣━HW 2 (7/23/17)
┣━HW 3 (7/23/17)
┗━HW 4 → Notes (7/25/17)
₂₎ Codecademy — Learn HTML & CSS: Part I (10/16)
₃₎ Codecademy — Learn JavaScript (10/16)
₄₎ Learn.co — Git, Command Line (9/16)
₅₎ Stanford Online — CS 101 (7/31/17)certificate
₆₎ Codecademy — jQuery (8/2/17)
₇₎ Codecademy — React 101 → Notes (8/4/17)
₁₁₎ Lambda Pro — React
┗━ Lecture → HW 1 → Notes
₈₎ Eloquent JavaScript — Chapter #3:
₉₎ Eloquent JavaScript — Chapter #4:
₁₀₎ Codecademy — React 102
₁₁₎ Lambda Pro — React
┣━ Lecture → HW 2
┣━ Lecture → HW 3
┣━ Lecture → HW 4
┗━ Lecture → HW 5
₁₂₎ Node
₁₃₎ ES6
₁₃₎ MongoDB
₁₄₎ Khan Academy — Internet 101
₁₎ ES6 ⋰ Scope ⋰ const & let⋰ Arrow Functions ⇒ ⋰ Semicolons ⋰ Template Literals
₂₎ Basic JavaScript — Mini Sprint Solution
₁₎ Basic JavaScript — Mini Sprint
₁₎ Anonymous & Callback Functions ⋰ map() ⋰ Iterating Over Arrays & Array of Objects
₂₎ How to Solve a Problem ⋰ Basic JS Review ⋰ Advanced JS/arrays.js Overview ⋰ reduce()
₃₎ Brown Bag — Slack Overview — Ryan Hamblin
₁₎ Code Challenge #1 — longestString (for loop ⋰ forEach() ⋰ sort())
₂₎ Basic JavaScript — Sprint Solution
₃₎ this ⋰ new ⋰ call() ⋰ apply() ⋰ Closures ⋰ class ⋰ extends ⋰ getter ⋰ Callbacks
₁₎ Advanced JavaScript — Mini Sprint
₁₎ Code Challenge #2 — reverseCase.js
₂₎ Brown Bag — VS Code ⋰ Quokka — Ryan Hamblin
₃₎ Advanced JS — Q&A
₁₎ Advanced JavaScript — Sprint
₁₎ Code Challenge #3 — isUnique.js ⋰ Big O Notation ⋰ nested for loops ⋰ new Set()]()
₂₎ Brown Bag — Machine Learning — Darren Ames
₃₎ Advanced JS — Q&A
₁₎ Code Challenge #4 — callBackPractice.js
₂₎ Data Structures I ⋰ Linear Time O(n) Complexity ⋰ Constant Time O(1) Complexity ⋰ Quadratic Time O(n²) Complextiy ⋰ Linked Lists ⋰ Stacks ⋰ Queues ⋰ Hash Tables ⋰ Hash Function Examples ⋰ Hash Table Insertion ⋰ Hash Table Collisions
₁₎ Data Structures I — Mini Sprint
₂₎ Code Challenge #5 — removeDuplicates.js
₁₎ Code Challenge #5 — removeDuplicates.js
₂₎ Brown Bag — Vim — Sean Chen
₃₎ Data Structures I — Q&A ⋰ getter & setter ⋰ limited Arrays ⋰ hash functions ⋰ Objects stored in memory ⋰ Linked Lists
₁₎ Data Structures I — Sprint
₂₎ Code Challenge #6 — waterJugs.md
₁₎ Code Challenge #6 - waterJugs.js
₂₎ Data Structures I — Solutions
₃₎ Data Structures II — Mini Sprint ⋰ Trees ⋰ Binary Search Trees ⋰ Graphs
₁₎ Data Structures II — Sprint
₂₎ Code Challenge #7 — forLoopTimeout.js
₁₎ Code Challenge #7 — forLoopTimeout.js
₂₎ Brown Bag - HTTP ⋰ IPC ⋰ Protocol ⋰ Node ⋰ Express - Thomas Comer
₃₎ Data Structures II — Breadth First Search using a Queue
₁₎ Data Structures II — Sprint
₂₎ Code Challenge #8 — largestPrimePalindrome.js
₁₎ Code Challenge #8 — largestPrimePalindrome.js
₂₎ Brown Bag — Modern JS Tools — Kent C. Dodds
₃₎ Data Structures II — Q&A ⋰ Heaps
₁₎ Data Structures II — Sprint
₂₎ Code Challenge #9 — constructors.js
₁₎ Code Challenge #9 — constructors.js
₂₎ Week 2 Feedback Session
₃₎ Data Structures II — Solution Lecture
₄₎ DOM ⋰ HTML & CSS
₅₎ DOM ⋰ HTML & CSS
₁₎ Code Challenge #10 — commonCharacters.js
₂₎ DOM ⋰ HTML & CSS
₁₎ Code Challenge #10 — commonCharacters.js
₂₎ Brown Bag — Oh My ZSH!
₃₎ DOM ⋰ HTML & CSS Q&A
₁₎ Code Challenge #11 — evenOccurrences.js
₂₎ DOM ⋰ HTML & CSS
₁₎ Code Challenge Review #11 — evenOccurrences.js
₂₎ DOM — Solution Lecture
₃₎ DOM — Q&A
₄₎ React I — Mini Sprint
₁₎ Code Challenge #12 — stringCompression.js
₂₎ React I — Mini Sprint
₁₎ Code Challenge #12 — stringCompression.js
₂₎ Brown Bag — Binary
₃₎ React I Q&A
₁₎ Code Challenge #13 — vowelCount.js
₂₎ React I — Sprint
₁₎ Code Challenge #13 — vowelCount.js
₂₎ Brown Bag — Tech in Real Estate
₃₎ React I — Q&A
₁₎ Code Challenge #14 — meanMedianMode.js
₁₎ Code Challenge #14 — meanMedianMode.js
₂₎ React I — Solution Lecture
₃₎ React II — Mini Sprint
₄₎ React II — Mini Sprint Review
₅₎ React II — Q&A
₁₎ Code Challenge #15 — sumDigits.js
₂₎ React II — Mini Sprint
₃₎ React II — Sprint
₁₎ Code Challenge #15 — sumDigits
₂₎ Brown Bag — Bullet Journaling
₃₎ React II — Q&A
₁₎ Code Challenge #16 — armstrongNumbers
₂₎ React II — Sprint
₁₎ Code Challenge #16 — armstrongNumbers
₂₎ React II — Solution Lecture
₃₎ Redux — Lecture
₄₎ Redux — Mini Sprint
₅₎ Redux — Mini Sprint Solution
₁₎ Code Challenge #17 — reverseNumber
₂₎ Redux — Mini Sprint
₁₎ Code Challenge #17 — reverseNumber
₂₎ Brown Bag — Piazza
₃₎ Redux — Q&A
₁₎ Code Challenge #18 — sortString
₂₎ Redux — Sprint
₁₎ Code Challenge #18 — sortString
₂₎ Code Challenge #19 — commonCharacters
₃₎ Brown Bag — What Comes After Coding Bootcamp?
₄₎ Redux — Q&A
₁₎ Code Challenge #20 — nextPalindrome
₂₎ Redux — Solution Lecture
₃₎ HTTP/AJAX — Lecture
₄₎ HTTP — Mini Sprint Review
₅₎ HTTP/AJAX — Q&A
₁₎ Code Challenge #20 — nextPalindrome
₂₎ HTTP/AJAX — Mini Sprint
₁₎ Code Challenge #21 — collatzSequence
₂₎ Brown Bag — Combating Imposter Syndrome
₃₎ HTTP/AJAX — Q&A
₁₎ Code Challenge #21 — collatzSequence
₂₎ HTTP/AJAX — Sprint
₁₎ Code Challenge #22 — sumAndProduct
₂₎ HTTP/AJAX — Solution Lecture
₃₎ HTTP/AJAX — Feedback Session
₄₎ React Router — Lecture
₅₎ React Router — Q&A
₁₎ Code Challenge #22 — sumAndProduct
₂₎ React Router — Mini Sprint
₃₎ React Router — Sprint
₁₎ Code Challenge #23 — Logic Gates
₂₎ Brown Bag — Coffee's Origins
₃₎ React Router — Q&A
₁₎ Code Challenge #23 — Logic Gates
₂₎ React Router — Sprint
₁₎ Code Challenge #23 — Reverse Linked List
₂₎ React Router — Solution Lecture
₃₎ Client Testing
₄₎ Client Testing — Mini Sprint Lecture
₅₎ Client Testing — Q&A
₁₎ Code Challenge #23 — Reverse Linked List
₂₎ Client Testing — Mini Sprint
₁₎ Code Challenge #25 — Breadth First Search
₂₎ Brown Bag — Reason (Jared Forsyth)
₃₎ Client Testing - Q&A
₁₎ Code Challenge #25 — Breadth First Search
₂₎ Client Testing — Sprint
₁₎ Code Challenge #26 — Deep Equals
₂₎ Node.js & Express — Lecture
₁₎ Code Challenge #26 — Deep Equals
₂₎ Node.js & Express — Mini Sprint
₃₎ Node.js & Express — Sprint
₁₎ Code Challenge #27 — Roman Numerals Encoder
₂₎ Brown Bag — Startups ⋰ VC Funding ⋰ Lambda School Q&A
₃₎ Node.js & Express — Q&A
₁₎ Code Challenge #27 — Roman Numerals Encoder
₂₎ Node.js & Express — Sprint
₁₎ Code Challenge #28 — Twin Primes
₂₎ Node.js & Express — Q&A
₁₎ Code Challenge #28 — Twin Primes
₁₎ Code Challenge #29 — Money Format
₂₎ Node.js & Express — Solution Lecture
₃₎ MongoDB — Lecture
₄₎ MongoDB — Mini Sprint Q&A
₁₎ Code Challenge #29 — Money Format
₂₎ MongoDB — Sprint
₁₎ Code Challenge #30 — Merged Objects
₂₎ Brown Bag — Fitness
₃₎ MongoDB — Q&A
₁₎ Code Challenge #30 — Merged Objects
₂₎ MongoDB — Sprint
₁₎ Code Challenge #31 — Expanded Numbers
₂₎ MongoDB — Solution Lecture
₃₎ MongoDB II — Lecture
₄₎ MongoDB II — Setup
₁₎ Code Challenge #31 — Expanded Numbers
₂₎ MongoDB II — Sprint
₁₎ Code Challenge #32 — Equal Sides
₂₎ Brown Bag — Producing Music
₃₎ MongoDB II — Q&A
₁₎ Code Challenge #32 — Equal Sides
₂₎ MongoDB II — Sprint
₁₎ Code Challenge #33 — CSS Animations
₂₎ Brown Bag — Intermittent Fasting
₃₎ MongoDB II — Q&A
₁₎ Code Challenge #33 — CSS Animations
₂₎ MongoDB II — Sprint
₁₎ Code Challenge — Days Between
₂₎ MongoDB II — Solution
₃₎ MongoDB III — Lecture
₄₎ MongoDB III — Q&A
₁₎ Code Challenge — Days Between
₂₎ MongoDB III — Mini Sprint
₁₎ Code Challenge — Chained Functions
₂₎ Brown Bag — Respect the Web Engineer
₃₎ MongoDB III — Q&A
₁₎ Code Challenge — Chained Functions
₂₎ MongoDB III — Sprint
₁₎ Code Challenge — String to Camel Case
₂₎ MongoDB III Solution
₃₎ Auth — Lecture
₁₎ Code Challenge — String to Camel Case
₂₎ Auth — Sprint
₁₎ Code Challenge — Consecutive Strings
₂₎ Brown Bag — Log all the Things
₁₎ Code Challenge — Consecutive Strings
₂₎ Auth — Sprint
₁₎ Code Challenge — to Binary String
₁₎ Code Challenge — to Binary String
₁₎ Code Challenge — Largest Difference
₂₎ Auth — Solution Lecture
₃₎ Client Authentication — Lecture
₁₎ Code Challenge — Largest Difference
₂₎ Client Authentication — Mini Sprint
₁₎ Code Challenge — Largest Contiguous Sum
₂₎ Brown Bag — eSports
₃₎ Client Authentication — Q&A
₁₎ Code Challenge — Largest Contiguous Sum
₂₎ Client Authentication — Sprint
₁₎ Code Challenge — get All Product Except at Index
₂₎ Client Authentication — Solution
₃₎ Server Testing & Documentation — Lecture
₁₎ Code Challenge — get All Product Except at Index
₂₎ Server Testing — Sprint
₁₎ Code Challenge — Stack Machine
₂₎ Brown Bag — Typescript
₃₎ Server Testing — Q&A
₁₎ Code Challenge — Stack Machine
₂₎ Server Testing — Sprint
₁₎ Code Challenge — Balanced Brackets
₂₎ Brown Bag — Meditation & Learning
₁₎ Code Challenge — Balanced Brackets
₂₎ Server Testing — Sprint
₁₎ Code Challenge — Bubble Sort
₂₎ Server Testing — Solution
₃₎ React Native I — Lecture
₁₎ Code Challenge — Bubble Sort
₂₎ React Native I — Sprint
₁₎ Code Challenge — Operators
₂₎ Brown Bag — eMacs
₁₎ Code Challenge — Operators
₂₎ React Native I — Sprint
₁₎ Code Challenge — Insertion Sort
₂₎ React Native I — Solution
₃₎ React Native II
₁₎ Code Challenge — Insertion Sort
₂₎ React Native II — Sprint
₁₎ Code Challenge #47 — Merge Sort
₂₎ Brown Bag — Security
₃₎ React Native II — Q&A
₁₎ Code Challenge #47 — Merge Sort
₂₎ React Native II — Sprint
₁₎ Code Challenge #48 — Markdown Tables
₂₎ Brown Bag — A Tale of JS Debugging
₃₎ React Native II — Q&A
₁₎ Code Challenge #48 — Markdown Tables
₂₎ React Native II — Sprint
₁₎ Code Challenge #49 — Binary Array Sort in O(n)
₂₎ React Native II — Solution Lecture
₃₎ DevOps/Deployment — Lecture
₄₎ DevOps/Deployment — Q&A
₁₎ Code Challenge #49 — Binary Array Sort in O(n)
₂₎ DevOps/Deployment — Mini Sprint
₁₎ Brown Bag — Promises | Async/Await
₂₎ DevOps/Deployment — Q&A
₁₎ Code Challenge #51 — Prime Reduction
₂₎ DevOps/Deployment Solution
₁₎ Code Challenge #51 — Prime Reduction
₁₎ Code Challenge #52 — Digits Raised to Consecutive Powers (CS1)
₂₎ Brown Bag — Rubik's Cube
₁₎ Code Challenge #52 — Digits Raised to Consecutive Powers
₁₎ Code Challenge #53 — Robot Paths
₂₎ Brown Bag — State of Lambda School
₁₎ Code Challenge #53 — Robot Paths
₁₎ Brown Bag — Product Management
₁₎ Code Challenge #54 — Rotated Array Search
₂₎ Computer Architecture I
₃₎ Computer Architecture Addendum
₁₎ Code Challenge #54 — Rotated Array Search
₂₎ Computer Architecture I
₁₎ Code Challenge #55 — Full (4-bit) Adder
₂₎ Brown Bag — Making Music
₁₎ Code Challenge #55 — Full (4-bit) Adder
₁₎ Computer Architecture I Solution
₂₎ Computer Architecture II
₁₎ Code Challenge #56 — Telephone Words
₁₎ Code Challenge #56 — Telephone Words
₁₎ Code Challenge #57 — String Compression
₁₎ Code Challenge #57 — String Compression
₁₎ Code Challenge #58 — Quick Sort
₂₎ Computer Architecture II — Solution
₃₎ Intro to C
₁₎ Code Challenge #58 — Quick Sort
₂₎ The C Programming Language
₁₎ Code Challenge #59 — Overlapping Rectangles
₂₎ Brown Bag — Front-End Interview Questions
₃₎ C Programming Lang I
₄₎ C Programming Lang I — Q&A
₅₎ C Programming Lang I — Pointers
₆₎ C Programming Lang I — Q&A
₁₎ Code Challenge #59 — Overlapping Rectangles
₂₎ The C Programming Language
₁₎ Code Challenge #60 — Route Between Nodes
₂₎ C Programming Language I — Solution
₃₎ Operating Systems: Processes
₁₎ Code Challenge #60 — Route Between Nodes
₂₎ Processes — Sprint
₁₎ Code Challenge #61 — Implement Queue from 2 Stacks made with Obj
₂₎ Operating Systems: Scheduling
₃₎ Brown Bag — Open Source Software
₁₎ Code Challenge #61 — Implement Queue from 2 Stacks made with Obj
₂₎ Scheduling — Sprint
₁₎ Code Challenge #62 — Rand7 to Rand5
₂₎ Brown Bag — The Modlet Pattern
₁₎ Code Challenge #62 — Rand7 to Rand5
₁₎ Code Challenge #63 — [C] Calculate Total, Avg, Percentage
₂₎ OS: Scheduling — Solution
₃₎ Applied C Programming — Intro
₄₎ Applied C Programming — Mini Review
₅₎ Applied C Programming — Q&A
₁₎ Code Challenge #63 — [C] Calculate Total, Avg, Percentage
₂₎ Applied C Programming
₁₎ Code Challenge #64 — Nth Fibonacci
₂₎ Applied C Programming — Q&A
₁₎ Code Challenge #64 — Nth Fibonacci
₂₎ Applied C Programming
₁₎ Code Challenge #65 — [C] Highest Product of Three
₂₎ Applied C Programming — Q&A
₃₎ Applied C Programming — Q&A
₁₎ Code Challenge #65 — [C] Highest Product of Three
₂₎ Applied C Programming
₁₎ Code Challenge #66 — [C] Stack
₂₎ Applied C Programming — Solution
₃₎ Theory of Computation — Intro
₄₎ Theory of Computation — Pt. 2
₁₎ Code Challenge #66 — [C] Stack
₂₎ Theory of Computation — Sprint
₁₎ Code Challenge #67 — [C] Linked List
₂₎ Brown Bag — React Testing with Jest
₃₎ Theory of Computation — Q&A
₁₎ Code Challenge #67 — [C] Linked List
₂₎ Theory of Computation — Sprint
₁₎ Code Challenge #68 — [C] Binary Search Tree
₂₎ Theory of Computation — RegEx | State Machines
₃₎ Theory of Computation — Q&A
₁₎ Code Challenge #68 — [C] Binary Search Tree
₂₎ Theory of Computation — Sprint
₁₎ Code Challenge #69 — [C] Insertion Sort
₂₎ Theory of Computation — Q&A
₁₎ Code Challenge #69 — [C] Insertion Sort
₂₎ Theory of Computation — Sprint
₁₎ Code Challenge #70 — [C] Queue Using Stack
₂₎ Algorithms Overview
₃₎ Algorithms Refresher
₄₎ Knapsack Q&A
₁₎ Code Challenge #70 — [C] Queue Using Stack
₂₎ Knapsack Sprint
₁₎ Code Challenge #71 — [C] Quick Sort
₂₎ Knapsack Solution
₃₎ Algorithms Analysis
₁₎ Code Challenge #71 — [C] Quick Sort
₂₎ Quick Sort — Khan Academy
₁₎ Brown Bag — CS1 Capstone Demo
₂₎ Sprint Challenge Solution
₁₎ Theory of Computation/Algorithms — Sprint Challenge
₁₎ Code Challenge #72 — [Py] Python Crash Course
₂₎ Graphs I — Intro
₃₎ Graphs I — Q&A
₁₎ Code Challenge #72 — [Py] Python Crash Course
₂₎ Graph I — Sprint
₁₎ Code Challenge #73 — [Py] Lists
₂₎ Graphs I — Q&A (Breadth-First Search)
₃₎ Graphs I — Q&A (Time Complexity)
₁₎ Code Challenge #73 — [Py] Lists
₂₎ Graph I — Sprint
₁₎ Code Challenge #74 — [Py] Mean Median Mode
₂₎ Graphs I — Q&A (BFS Solution, Connected Components, DFS)
₃₎ Graphs I — Q&A (Animating BFS Refactor)
₁₎ Code Challenge #74 — [Py] Mean Median Mode
₂₎ Graph I — Sprint
₁₎ Code Challenge #75 — [Py] Linked List
₂₎ Graphs II — Connected Component Solution
₃₎ Sprint Challenge Solution
₁₎ Code Challenge #75 — [Py] Linked List
₂₎ Sprint Challenge — Graphs
₁₎ Code Challenge #76 — [Py] Doubly Linked Lists
₂₎ Security & Cryptography
₃₎ Security & Cryptography — Q&A
₁₎ Code Challenge #76 — [Py] Doubly Linked Lists
₂₎ Secret Gists — Sprint
₁₎ Code Challenge #77 — `[Py] Making Change
₂₎ Secret Gists — Solution
₃₎ Blockchain
₁₎ Code Challenge #77 — `[Py] Making Change
₁₎ Code Challenge #78 — [Py] Find Rotation Point
₂₎ Cellular Automata
₃₎ Cyclic Cellular Automata Live-Coding
₁₎ Code Challenge #78 — [Py] Find Rotation Point
₂₎ Conway's Game of Life — Sprint
₁₎ Code Challenge #79 — [Py] LRU Cache
₂₎ Conway's Game of Life — Solution
₃₎ Relational Databases — Intro
₄₎ Relational Databases — Q&A
₁₎ Code Challenge #79 — [Py] LRU Cache
₂₎ Relational Databases — Sprint
₁₎ Brown Bag
₂₎ Sprint Challenge Solution
₃₎ Capstone Project Idea Pitches
₁₎ Sprint Challenge — Security / Automata