HackerRank - Game of Two Stacks | Full solution with visuals | Study Algorithms

[@gilbishkosma4593]

Earlier I was trying to solve this using recursion, but getting timelimit exceed in it, thanks for the solution, this one worked for me and the code is easy to read also.

[@nikoo28]

I usually avoid recursion. It is so hard to understand and debug 😅

[@ANJALIGUPTA-vq1cv]

i thought the same greedy approach and after unlocking the test case i get to know what im doing wrong.Thanks for the perfect explanation

[@nikoo28]

You are most welcome :)

[@lautaroblasco]

Great video man, it really helped me to understand the problem.

[@b9944236]

Nice explanation, thanks.

[@miomydude]

Very clear thought and explanation. Thank you very much.

[@jjoelthomas]

Amazing work. Keep it up!

[@rishabmudliar558]

Thanks for explaining the approach. Could you do a DP approach? I initially tried it out but I got timeout error and then applied memoization but then my solution got weird so I came to your video. Thanks anyways:)

[@ahadkhan6630]

Thank you so much ... We made the solution clear but as I can see this solution actually violates the functions of the stack you can see that in the second loop, there must be some other solution

[@nikoo28]

What function of the stack feels violated to you? I can try to clarify.

[@pranavdeshpande6385]

Great explaination!

[@SomanathMikali-f7f]

37:27 That Game of two stacks is failing for the large number of inputs, getting time exceed error, is it probably that we use recursion huge number of times?

[@doubtee15428]

Sir if maximum sum is 10 instead of 11 then according to your logic it requires 3 element from stack 1 But answer is same 4

[@nikoo28]

Try doing a dry run of the code with your input arguments. The logic I provided will check for all combinations, you will always check for elements from second stack

[@shubhadarajmane7323]

Could you please explain Time and Space Complexity of efficient approach that you have used?

[@nikoo28]

The time complexity would be O(m + n) where 'm' and 'n' are the length of two stacks. That is because it might be possible you have to iterate through all elements of both the stacks for a very large maxSum. The space complexity would be O(1), as you are not consuming any extra space.

[@shubhadarajmane7323]

Ok...Thanks

[@dineshkinibailoor340]

@@nikoo28 arent you running while inside second for loop? so it should be n^2 right?

[@gauravgupta1803]

Thank you so much 💘

[@ANJALIGUPTA-vq1cv]

thank you sir

[@siddhantjagdish2554]

Thank you!

[@nikoo28]

Always welcome

[@sreepadhsandilya5854]

very helpful....thank you..

[@nikoo28]

You're welcome!

[@ramkrishnainmotion]

can we use dynamic programming ?

[@pranavmishra5516]

sir do u take any classes

[@nikoo28]

not yet...but can plan it sometime in the future.

[@saarthjhaveri8716]

whats the logic behind this?

[@nikoo28]

Think like this, “you only need to use additional elements if using them will increase the number of elements used” So, the general idea is to use one full stack first. Now, try to use the second stack. Remove one element at a time from the first stack and try including elements from second stack.

[@HarshitSharma-kk6yz]

Hello

[@ramkrishnainmotion]

3 5 105 100 4 2 6 6 6 6 6 please explain this example...! ig we have to do in perspective of both stack then return the maximum one