24 - Stack implementation using Locks - Follow Up 2 - SOLUTION - Unit Test Code Demo 2

@backstreetbrogrammer

--------------------------------------------------------------------------------
SOLUTION: Stack implementation using Locks - Follow Up 2 - Unit Test Code Demo 2
--------------------------------------------------------------------------------
A stack is a linear data structure that follows the LIFO - Last-In, First-Out principle. That means the objects can be inserted or removed only at one end of it, also called a top. Last object inserted will be the first object to get.

Implement a stack in Java without using any standard Java Collections.

Following 3 methods should be implemented from the StackI interface.

public interface StackI |T| {
T pop();
void push(T item);
T peek();
}

Follow up 1
Implement a stack in Java using Java collections.

Follow up 2
Implement a bounded concurrent stack in Java using locks.

Follow up 3
Implement a concurrent stack in Java using CAS (Atomic classes in Java).

This solution is based on Treiber stack algorithm.


Github: https://github.com/backstreetbrogrammer/13_TopCodingInterviewSolutionsInJava

- Top Java Coding Interview Problems Playlist: https://www.youtube.com/playlist?list=PLQDzPczdXrTiEt7nlXb66dgiAjXhhUAUU
- Apache Spark for Java Developers Playlist: https://youtube.com/playlist?list=PLQDzPczdXrTgqEc0uomGYDS0SFu7qY3g3
- Java Serialization Playlist: https://youtube.com/playlist?list=PLQDzPczdXrTjGLkI8kd2d0bfNHx0v7dTy
- Dynamic Programming Playlist: https://youtube.com/playlist?list=PLQDzPczdXrTilRgmNUQ632OrD-wfRLUR_

#java #javadevelopers #javaprogramming #javacodinginterview