Programming, Coding, Technology, Python, Leetcode.
prob if s >= r: return num This would be an O(n) time and constant space solution? Can we get any better this? Yes and no. Technically speaking, no matter what we do, we will have an O(n) time complexity because we have to traverse the arrays to match our domains to the generated values. And we