HackerRank - Missing Numbers | Full solution with examples and visuals

Missing Numbers is a programming challenge on HackerRank. You are given an array, and an artist is trying to transport those numbers to a different array. In the process, he misses some of those numbers. These are termed as missing numbers. We need to find these numbers in a sorted manner. Watch the video to understand the problem in a simplified manner. I then work along with you to solve it first using a Brute Force approach, and then an efficient approach. All along with visuals and explanations.

00:00 - Intro
01:04 - Problem Statement and Test Case
03:11 - Brute Force Solution
05:49 - Efficient Solution
09:54 - Dry-run of code
12:10 - Final thoughts

📚 Links I talk about in the video:
Actual problem on HackerRank: https://www.hackerrank.com/challenges...
Code on Github: https://github.com/nikoo28/java-solut...
Test cases on GitHub: https://github.com/nikoo28/java-solut...

📘 A text based explanation is available at: https://studyalgorithms.com/array/hac...

🔗 To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalg...

💻 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/

#hackerrank #programming #tutorial