✅ List
• Access by index → O(1)
• Append → O(1)
• Insert at beginning → O(n)
• Delete from middle → O(n)
• Search (
in) → O(n)Best for: Ordered collections where fast indexing matters.
✅ Dictionary (dict)
• Lookup → O(1)
• Insert → O(1)
• Update → O(1)
• Delete → O(1)
Best for: Fast lookups using keys.
✅ Set
• Add → O(1)
• Remove → O(1)
• Membership test → O(1)
Best for: Removing duplicates and fast membership checks.
✅ Tuple
• Access → O(1)
• Search → O(n)
Best for: Read-only collections that shouldn't change.