I came across this problem in an interview website. The problem asks for efficiently implement three stacks in a single array, such that no stack overflows until there is no
first stack grows at 3n, second stack grows at 3n+1, third grows at 3n+2
for n={0...N}