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.
I agree that it timesout if the algorithm is not efficient enough. Instead of relying on rudimental loops, try using a linked list which simplifies its complexity significantly to O(dn).
Arrays: Left Rotation
You are viewing a single comment's thread. Return to all comments →
The test case is a large array with a large amount of shits. If your algorithim is not effecient than it will time out.
Array size: 73642 Left shifts: 60581
I agree that it timesout if the algorithm is not efficient enough. Instead of relying on rudimental loops, try using a linked list which simplifies its complexity significantly to O(dn).