## Notes MIKE is an acronym for an approach to DSA problems: - **M**inimally sketch a naive solution - **I**dentify upper and lower bounds in Big O notation - **K**eywords/triggers for ways to optimize solution - **E**mploy Boosters (other ways to find optimizing solutions) ## Minimally Sketch a Naive Solution - Don't focus on optimization because you run the risk of not coming up with anything. - Use pseudo code that resembles human language more than code, because it will be buggy. - Think of edge cases, and eventually focus on non-trivial ones ## Identify Upper and Lower Bounds