O(1) - Constant Time

Easy

If you already know where it is, you don't wander. The fastest O(1).

BasicsComplexity

O(1) is "Constant Time", where you know the location or can calculate it, finishing instantly regardless of N.

1/6

Whether 10 or 1 million, O(1) only handles one single dot.

Basics

O(1) is "Constant Time", where you know the location or can calculate it, finishing instantly regardless of N.

Best

O(1)

Average

O(1)

Worst

O(1)

Space Complexity

O(1)

O(1) - Constant Time | AlgoNote