How do you generate and count all N digit numbers that can't use repeating digits? E.g. 0123, 0124... > 5,040 combinations.


Locker Number W/O Repeats

Interleaving Iterator
Creating an iterator of iterators is a popular interview question. This queueleveraging solution is very simple, effective, and easy to remember.

The Heap Data Structure
A heap is a specialized data structure that is designed to always yield the smallest element in O(lg(n)) time (assuming it is a minheap; a maxheap would do the opposite. It is the foundation of a priority queue.

MapRStreams Crash Course
A basic overview of MapRStreams and its architecture.

MapR Streams 5.2 – Consumer Group Hang; Related to ShutDown
This is a deep dive into the MapRStreams internals in order to help you understand and mitigate a bad consumergroup hang bug.

It begins!
Hey, I'm John Humphreys, and this is the first post to my new blog!