Would you agree that both ArrayList and LinkedList have the

Would you agree that both ArrayList and LinkedList have the same level of performance when inserting and removing elements in the middle or end of a list?

Solution

LinkedList has higher performance O(1) while inserting and removing elements in the middle of the list as compared to Arraylist O(n/2) in the middle of list

LinkedList and ArrayList both have same performance O(1) while inserting or removing elements at the end of list.

ArrayList is having best case performance here.