Nagarro Interview Question
What is the time complexity for insertion and deletion?
Interview Answer
Anonymous
Sep 12, 2021
For insertion, it's O(n), For deletion, it's O(1)
What is the time complexity for insertion and deletion?
Anonymous
For insertion, it's O(n), For deletion, it's O(1)
Check out your Company Bowl for anonymous work chats.