Great code explanations. Can you please explain how the space complexity for Solution 1 is O(logn+m), because I understand that extra space of m is required when zipping queries with range m in the for loop.
Thanks :)