I recently spent some time revising for programming interview questions, and having done all of that work I wondered what I could do with it.
The result is a git repo of interview question algorithms that I’ve structured as a somewhat tongue-in-cheek utility; the kind of utility that i’d love to be able to use in a programming interview, but the kind would probably negate the point of the interview question in the first place.
The library solves programming questions that keep popping up, whether in books or online on sites such as HackerRank. This includes solutions to the following problems:
- Longest common subsequence
- Longest increasing subsequence
- Max intervals that can overlap
- Number of ways to reach a goal
- Matrix search algorithm
As an extra bit of practice, I also created a repo of solutions to Project Euler problems. These were mostly based on the HackerRank version of the problems, which typically require the most efficient solution to the problem rather than a single solution to a given input.