I agree that some of the problems are too hard to be realistic. I made sure to not count those when I was analyzing my performance. As I said in the comment I'm linking to below, a few months ago I couldn't even do Fibonacci recursively. I just couldn't figure out how to structure the code, when to call the function, how to pass the results of each call up the stack etc. This is just one example. The other day I tried to do the brute force implementation of finding the median of 2 sorted arrays. Brute force as in have two pointers at the start of each array incrementing until you reach the median. It was too hard for me to code successfully and I spent 2-3 hours on it.
I wrote a comment that I realize should have been part of the original post on hindsight. It may give you more content if you choose to respond.
I wrote a comment that I realize should have been part of the original post on hindsight. It may give you more content if you choose to respond.
https://news.ycombinator.com/item?id=17594084