Learning Stack data structure [Java]

Learning Stack data structure [Java], available at $19.99, has an average rating of 4.33, with 5 lectures, based on 6 reviews, and has 516 subscribers.

You will learn about How to use Stack Data structure When to use Stack data strcuture How to identify if the problem can be solved using Stack Solving problems in stack This course is ideal for individuals who are Developers who are learning Data structures and Algorithms It is particularly useful for Developers who are learning Data structures and Algorithms.

Enroll now: Learning Stack data structure [Java]

Summary

Title: Learning Stack data structure [Java]

Price: $19.99

Average Rating: 4.33

Number of Lectures: 5

Number of Published Lectures: 5

Number of Curriculum Items: 5

Number of Published Curriculum Objects: 5

Original Price: ?799

Quality Status: approved

Status: Live

What You Will Learn

How to use Stack Data structure

When to use Stack data strcuture

How to identify if the problem can be solved using Stack

Solving problems in stack

Who Should Attend

Developers who are learning Data structures and Algorithms

Target Audiences

Developers who are learning Data structures and Algorithms

Stack:

Stack stores elements of the same data type.

We can insert, and remove elements in the stack in the Last In First Out policy (LIFO)

Declaration

Stack<Type> variable_name = new Stack<>();

Stack<Integer> stack = new Stack<>();

Methods used in Stack:

stack_name . push() – insert element into a stack

stack_name . peek() – checks the topmost element in the stack

stack_name . pop() – removes the topmost element in the stack

stack_name . size() – returns the number of elements in stack

stack_name . empty() – returns true / false. if stack is empty, it returns true. if stack is not empty it retuns false

stack_name . clear() – clears the stack

stack_name . contains(value) –  returns true if the value we check is there in stack or else it returns false
stack_name remove(index) – removes the value in given index

stack_name . search(value) – searches the value in stack and returns us the index of the value if present.

Iterating stack:

We can go through the stack elements in two ways.

1. Popping the elements

We can pop the stack elements one by one and go through all the elements.

2. For each loop

We can go through the stack by a for loop as below

for(String s : stack_name)

{

//Stack will be iterated from bottom to top direction in this way

}

How to identify if that problem can be solved using a stack

1. when we want to evaluate brackets, expressions in certain order we can use stacks.

2. When we wanted to use backspace character in keyboard or any similar sitautions, we can use stacks

3. When we want to delete or remove the last elements we can use stack.

4. When we want to backtrack to something and then again to move forward direction multiple times we can use stack.

5. We can use stack to find some peak elements (assuming the value plotted something like graph) we can use stacks

Course Curriculum

Chapter 1: Working with Stacks

Lecture 1: Introduction to Stacks

Lecture 2: Check if Parentheses are balanced

Lecture 3: Backspace string compare

Lecture 4: Simplify path

Lecture 5: Next greater element

Instructors

Monish Njs
SDE 3 @ PayPal

Rating Distribution

1 stars: 0 votes

2 stars: 0 votes

3 stars: 0 votes

4 stars: 4 votes

5 stars: 2 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!