If we want to delete an item from an array at a random position without changing the order of items in the array, the time complexity of such operation would be linear, O(N) for traversal + additional O(N) for shifting all the items after the deleted...
![[Solution]237. Delete Node in a Linked List](https://cdn.hashnode.com/res/hashnode/image/stock/unsplash/b2ff87d224f33535a73053449df49119.jpeg)