Your editing is very simple and very easy to understand...watched all of your vids all are Great. Keep it up man.
Why not loop through the array once and return the missing number? It's O(n) but on most scenarios it won't need to go through the whole array.
In the two_sum example you still have to look through your num_map (which only gets bigger and bigger) every time. Is the only difference here that checking if an item exits in a hashmap is faster than checking if an item exists in an array?
heres your 600th sub
@lucvaillancourt9923