LeetCode Problem 448. Find All Numbers Disappeared In an Array || Java Solution Walkthrough

LeetCode is a great platform for people who want general coding practice, whether that be for interviews or just wanting to practice their problem solving. I will be taking you through all the steps of finding the optimal solution to each problem on the site following a logical ordering setout by LeetCode themselves.

In this video, we are going over the problem 448: Find All Numbers Disappeared In an Array, where the goal is to figure out which numbers between 1 and n, where n is the length of the array are missing from the input array nums.

This problem has a relatively simple solution that will beat 99% of submissions, and a very complicated solution that takes advantage of some strange quirks of Java. For this video we will use the simple solution which requires us to loop through a new array marking with elements are present, then we copy the elements which are not present into the list.

~~~ Stay Up To Date With My Social Media ~~~

#unknownkoder #leetcode #algorithms