We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
This is O(n) where n is the length of the queries array. It is independent of the length of the input array, since it grabs the input array elements by index and only has to loop through the queries to grab each one.
Circular Array Rotation
You are viewing a single comment's thread. Return to all comments →
Ah,thanks I got it.. It's all about algorithmic complexity.
This is O(n) where n is the length of the queries array. It is independent of the length of the input array, since it grabs the input array elements by index and only has to loop through the queries to grab each one.