Keep Multiplying Found Values by Two - Leetcode 2154 - Python
0:00 · Watch on YouTube
NeetCode solves LeetCode's "Keep Multiplying Found Values by Two." He puts the array into a hash set, then keeps doubling original as long as the current value is in the set. This gives O(n) time and O(n) space. It be...