Java LeetCode Walkthrough Number 1 || Max Consecutive Ones

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 the first video, we are going over the problem 485. Max Consecutive Ones, which is a simple array problem which prompts you to find the maximum number of ones which are uninterrupted inside the array. I walk through the logic and pseudo code behind the problem, step through the logic to prove that it is sound, and finally code the solution on LeetCode and show that it accomplishes the best runtimes on LeetCode.

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

~~~ Background Music Used In My Video ~~~

🎵 Song: 'Sappheiros - Embrace' is under a creative commons license license.
🎶 Music promoted by BreakingCopyright:

🎵 Song: 'Danlsan - Free With You' is free to use if you give credits.
🎶 Music promoted by BreakingCopyright:

🎵 Song: 'Insomnia - Sarah Jansen' is free to use on social media as long as credits are included
🎶 Music promoted by BreakingCopyright:

#unknownkoder #leetcode #algorithms