leetcode/en/lc/2070/ #3755
leetcode/en/lc/2070/
#3755
giscus[bot]
bot
Replies: 1 comment
-
|
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. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
leetcode/en/lc/2070/
LeetCode solutions in any programming language
https://doocs.github.io/leetcode/en/lc/2070/
Beta Was this translation helpful? Give feedback.
All reactions