Hi team,
I could see there are many mistakes in time complexity cheet sheet. This is really not acceptable as many people will be preparing for their interviews using this material.
Mistakes i could see…
Arrays and Dynamic Arrays - given as O(1) for insertion. It has to O(n) as inserting at beginning or middle needs moving the elements.
Que: Deque is given as O(1) - it has to be O(n) as we move the elements towards front. Unless you are using linked list inside the implementation.
HashTable : Insertion and Retrival is given as O(n). But it is O(1) as we retrive the data by hashindex. It is the advantage of Hashtable.
Please correct them ASAP. And i request Educative.io to get the materials reviewed.