gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
1494a501238c5f47f08a9c80b5f09ef205e8f277
freeCodeCamp/guide/english/certifications/coding-interview-prep/data-structures/learn-how-a-stack-works/index.md
Randell Dawson 1494a50123 fix(guide): restructure curriculum guide articles (#36501) 
* fix: restructure certifications guide articles
* fix: added 3 dashes line before prob expl
* fix: added 3 dashes line before hints
* fix: added 3 dashes line before solutions
2019-07-24 13:29:27 +05:30

858 B
Raw Blame History

title
title
Learn how a Stack Works

Learn how a Stack Works

Problem Explanation

  • 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 this challenge we need to .pop() and then .push() into the stack.

Solutions

Solution 1 (Click to Show/Hide) 
var homeworkStack = ["BIO12", "HIS80", "MAT122", "PSY44"];

homeworkStack.pop();
homeworkStack.push("CS50");

Relevant Links