fix(curriculum): correct stack typo (#65527)

This commit is contained in:
gurijalaspandana2104
2026-01-27 20:51:04 +05:30
committed by GitHub
parent 7df98cd4ab
commit f5ac708188
@@ -43,7 +43,7 @@ The time complexity of the push and pop operations is typically `O(1)`, a consta
When you push an element onto the stack, the element is simply added to the top.
When you pop an element form the stack, the element at the top is removed.
When you pop an element from the stack, the element at the top is removed.
Therefore, the time it takes to perform these operations remains constant regardless of the size of the stack.