Nagarro interview question
What would be time complexities if we insert at the head node and delete from the tail node?
Interview Answer
Anonymous
12 Sept 2021
For insertion, it's O(1), For deletion, it's O (n)
What would be time complexities if we insert at the head node and delete from the tail node?
Anonymous
For insertion, it's O(1), For deletion, it's O (n)
Check out your Company Bowl for anonymous work chats.