This repository contains notes and examples for the Leetcode Data Strucutures and Algorithms Crash Course.
- Two pointers Approach: Solve an array problem in O(n) time complexity.
- Sliding Window Approach: Solve finding a valid (longest) subarray in O(n) time complexity.
- Prefix Sum:
- Checking for the existence
- Counting