1. Arrays and Strings

• https://leetcode.com/problems/unique-email-addresses/
• https://leetcode.com/problems/reverse-string/
• https://leetcode.com/problems/roman-to-integer/

2. Stack

• Videos
  • until 6:03 or whole video if you want an intro to queues
  • https://youtu.be/A3ZUpyrnCbM
• Homework Problems
  • https://leetcode.com/problems/baseball-game/description/ (Review)
  • https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/description/
  • https://leetcode.com/problems/backspace-string-compare/

3. Linked List

• Video 0.00 - 4.45 AND 10.23 - end
  • or full video if you want to see a Java implementation of a LinkedList class
  • https://youtu.be/N6dOwBde7-M
• Review
  • https://leetcode.com/problems/merge-two-sorted-lists
  • https://leetcode.com/problems/reverse-linked-list
• Homework Problems
  • https://leetcode.com/problems/remove-duplicates-from-sorted-list/
  • https://leetcode.com/problems/palindrome-linked-list

4. Review: Arrays + Strings + Stack

• Time complexities

  • I forgot to talk about this last time but it’s important you remember and understand them

    • the second half of above video will explain why linked lists have this time complexity

  • Note that all of these have space complexity of O(n)

    

• Homework

  • https://leetcode.com/problems/remove-element
  • https://leetcode.com/problems/plus-one/
  • https://leetcode.com/problems/add-strings/
  • https://leetcode.com/problems/min-stack/
  • https://leetcode.com/problems/implement-stack-using-queues/

5. Recursion

• Review
  • Reverse LinkedList
  • Fibonacci Number (Naive recursion) → O(2^n) time and O(n) space