O(1) = Constant Time Complexity 🚀

This means the execution time of your code remains the same, no matter the input size.

Example: Accessing an array element by index.
Whether the array has 10 or 10M elements, it's equally fast! ⚡

#BigONotation #Algorithms #Coding