To access the questions, please click link

✨A step-by-step procedure or a set of rules designed to solve a specific problem.

Code Complexity = Time Complexity + Space Complexity

Time Complexity -> How long does our code take to execute?

Space Complexity -> How much space does our code occupy in memory?

Big O: Defines how the usage of resources, such as execution time or memory, grows in relation to the size of the data.

❗️Big O is always calculated by considering the worst-case scenario.

O(1) ➡ Constant
O(n) ➡ Linear
O(n²) ➡ Quadratic
log(n) ➡Logarithmic
nlog(n) ➡ Log Linear
O(n³) ➡ Cubic
O(n!) ➡ Factorial 
O(2^n) ➡ Exponential

🎇 To better understand, you can examine this link