HackerRank - Game of Two Stacks | Full solution with visuals | Study Algorithms скачать в хорошем качестве

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

You are given two stacks and a maximum sum. A score is determined by the maximum number of elements that you can pop such that the total sum is less than the maximum sum. You need to determine the maximum number of elements that you can pop such that the sum remains less than the maximum sum. Watch this video to find an easy solution along a with a dry-run of code. Chapters: 00:00 - Intro 01:21 - Problem Statement and Description 04:51 - Greedy Approach 07:10 - Why does Greedy fail? 09:36 - Efficient Solution 13:02 - Dry-run of Code 16:29 - Final Thoughts Actual problem on HackerRank: https://www.hackerrank.com/challenges... 📚 Links to topics I talk about in the video: Stacks:    • Stack Data Structure explained with animat...   HackerRank solutions:    • HackerRank Solutions   📘 A text based explanation is available at: https://studyalgorithms.com Code on Github: https://github.com/nikoo28/java-solut... Test-cases on Github: https://github.com/nikoo28/java-solut... 📖 Reference Books: Starting Learn to Code: https://amzn.to/36pU0JO Favorite book to understand algorithms: https://amzn.to/39w3YLS Favorite book for data structures: https://amzn.to/3oAVBTk Get started for interview preparation: https://amzn.to/39ysbkJ 🔗 To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalg... 🎥 My Recording Gear: Recording Light: https://amzn.to/3pAqh8O Microphone: https://amzn.to/2MCX7qU Recording Camera: https://amzn.to/3alg9Ky Tablet to sketch and draw: https://amzn.to/3pM6Bi4 Surface Pen: https://amzn.to/3pv6tTs Laptop to edit videos: https://amzn.to/2LYpMqn 💻 Get Social 💻 Follow on Facebook at:   / studyalgos   Follow on Twitter at:   / studyalgorithms   Follow on Tumblr at:   / studyalgos   Subscribe to RSS feeds: https://studyalgorithms.com/feed/ Join fan mail: http://eepurl.com/g9Dadv #hackerrank #programming #interview