Hi guys,
I loved this puzzle !
I have one question, is there an issue with Kotlin answers ?
How can all my tests be green but none of the validators pass ? 
(of course I didnāt hardcoded answers 
)
Anyone can help me ? I guess Iām not allowed to paste my code here so Iām quite stuck 
Update : I rewrited my solution in Java (same algo) and all validators pass.
So I guess there might be an issue with Kotlin 
I have the same problem, with Kotlin
canāt submit any of my solution with this language
so now I am rewriting them in python
Hope they fix it soon
The puzzle statement is way too wordy. Felt like I was reading a charles dickens novel and the important information gets lost in the paragraphs. A more concise statement would be useful. As a side note, this problem seems much harder than it actually is. Maybe a note of that would help?
Very soon you will agree that a too wordy statement is much much better than a āI assume you know everything so I will not say muchā statement.
Some spoiler hints are in this thread. Review them if you need to.
Just giving some ways to improve the statement, no need to take it personally. Yes, Iād prefer a wordy statement over a wordless statement, but Iād prefer a concise statement to both of those.
And I solved the puzzle just fine,not sure where I implied I needed it, but thanks for the passive aggressive tip nonetheless lol.
to me, your first message seemed more aggressive than @java_coffee_cupās answer and didnāt imply you had solved the puzzle
Youāve made your point about the length of the statement and the author has the right to disagree.
Why post? Just to agitate? He didnāt disagree with me either, he agreed it was wordy. He just doesnāt appear to care.
The point of the discussion area is to post comments and concerns, so itās not aggressive to post constructive criticism. Getting mad and being like āoh well if you need help feel free to search for someā. Who asked for help lol? The problem is simple. Itās just wordy.
Of course the community manager post to agitateā¦ 
You have not implied you need help, but neither the oppositeā¦ And you are the one who became aggressive when @java_coffee_cup supposed you need someā¦
The point of the discussion area of a puzzle is to speak about this puzzle. So if you have unrelated criticisms, please use a private message.
Well, since you posted your feedback and the author answered, lets close the digression.
This is a great beginner problem, but it doesnāt really test implementation of stacks, since with a little thought about it, one realizes that its not necessary to keep track of stacks at all, just remember the set of the topmost values of all stacks. It is irrelevant how large the stacks are or what values lie under the topmost item in each stack, so you can forget about them.
I came here just to say this. I was suprised to see the stack skill tag on the results panel.
Why in the example the stacking was: aab bcc , we could have done :ab abcc, ? Or whatās the āefficientā rule, i undestand that when ship b come, it can take the two container at once, but it doesnt do A. So do i go with the less stacking area or is there something else?
By the statement, āefficientā means using the least ground areas, and no need to retrieve a container from middle of a stack.
Although the solution of the problem is actually simple, I donāt think this problem should be an āeasyā problem because the solution is not as straightforward as other problems in the same category. Does anyone agree? Just wanted to share my opinion here
I understand this is supposed to be solved using stacks, but while looking at the pattern, it felt like it was a Longest Increasing Subsequence problem. My code got accepted with it but I wonder if there are any cases where it might fail.
First iteration put M on first stack.
Second iteration puts I on top of M on first stack.
Third iteration canāt put W on first stack, so a new stack is created with W.
ā¦
According to me you donāt need stacks to solve this because it is not the requirement to produce the content of the stacks. You only need to return the number of stacks, so you only need to keep track of the top container of each stack, to see if you can put the new container on top of it or not.
You are wrong, this puzzle does not require any knowledge about any algorithm or data structure or advanced math or anything else, just a little bit thinking.
Wow, you replied to a question that was asked more than 3 years ago, and the question was not about stacks as a data structure, but about stacks of containers.
Thatās exactly why it is not an easy puzzle, because it requires reasonment and logic and does not require any standard algorithms. I solved it with paper and pencil and logic as you said. Than itās all clean and easy isnāt it? How long did it take you to solve this puzzle Genius ???
it is not an easy puzzle, because it requires reasonment and logic
Well said. Very logical and reasonable. Any problems needing a brain to solve are not easy. All easy puzzles should be no-brain exercises. The easy puzzle area should better be named as no-brainer area.
Easy = no-brain
Learning from this logic.