We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I use your logic but i changed a little bit. Instead of storing in arrays, i store data in stacks and i compare top elements(i mean each of peek()) and popped the maximum element recursively until the top elements are equal.it works for me but only for 3 cases i get runtime error because of too much recursion. Good logic!
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Equal Stacks
You are viewing a single comment's thread. Return to all comments →
I use your logic but i changed a little bit. Instead of storing in arrays, i store data in stacks and i compare top elements(i mean each of peek()) and popped the maximum element recursively until the top elements are equal.it works for me but only for 3 cases i get runtime error because of too much recursion. Good logic!