README

Chapter 1: Arrays

• 2 Pointer problems - O(n) time / O(1) space
• Hashmap Problems - O(n) time / O(n) space
• Partition Problems - O(n) time / O(1) space
• Binary Search - O(log n) time / O(1) space
• Kadane's - O(n) time / O(1) space

Chapter 2: Strings

Notes

• Sorted Array, think Binary Search / Two Pointers
• Positive Integer Inputs think Sliding Window
• When you "store" an item in a Hashmap, you save it as the KEY and put the index of the array as the VALUE