Explain Big O notation and analyze the time and space complexity of an algorithm you have implemented recently.

Sample answer preview

Big O notation describes the asymptotic behavior of an algorithm, meaning how its time or memory requirements evolve as input data size increases. It helps compare algorithm efficiency independently of hardware.