Javascript -> JavaScript (English) (#35183)
* Javascript -> JavaScript (English) * Update technical documentation page for required change * Update use-class-syntax-to-define-a-constructor-function.english.md * Update left-factorials.md
This commit is contained in:
committed by
The Coding Aviator
parent
fed6ffb606
commit
e84ae45008
@@ -7,7 +7,7 @@ title: Learn how a Stack Works
|
||||
- Stacks are an abstract data structures.
|
||||
- They follow LIFO (Last In First Out) or FILO (First In Last Out) principle.
|
||||
- Stack's insertion and deletion operations are of **O(1)** time complexity.
|
||||
- In Javascript, arrays can be treated as a Stack since `.push()` and `.pop()` methods have time complexity of **O(1)**.
|
||||
- In JavaScript, arrays can be treated as a Stack since `.push()` and `.pop()` methods have time complexity of **O(1)**.
|
||||
- In this challenge we need to `.pop()` and then `.push()` into the stack.
|
||||
|
||||
### Solution:
|
||||
|
Reference in New Issue
Block a user