This a repo that contains my solutions to the blind75 at leetcode!
Tech used: JavaScript, Typescript, and Java
All solutions are written in JS.
Some of the fun is writing the first solution coming to mind and then optimizing the solution with faster algorithms.
My instinct is always go for the O(N^2) solution because it is easier to visualize. As I am working through the challengers, I begin to see why certain algorithms are more efficient.
Recursion may not always be the optimal choice. Dynamic progamming is a way to improve recursive run times.