Oh. my. god. This has definitely been the hardest one so far; I remembered the traumatic experience since the university time and also rem...

Here is a problem that takes more time to code than to figure out: given N files where each line contains a timestamp (as long) and some dat...

This is an interesting exercise: implement a locking mechanism backed by a tree structure with parent pointers where a node can be locked if...

Disclaimer: this solution comes from interviewcake , where they mention this as being easier to (I guess) derive than the ones we saw before...

Well a good night's sleep always helps apparently. Yesterday we saw how to find a duplicate element in a constrained array in linear tim...

Sooo.. spoiler alert: this one was way harder than it should be thanks to 0-index arrays . Given an array of integers in the range 1..N an...

The closing chapter of my RPN journey, how to convert an infix notation expression to a postfix notation one, so from 3 + 4 we get 3 4 + ...