Description

Implement a Singly Linked List. A singly linked list is a type of linked list that is unidirectional, that is, it can be traversed in only one direction from head to the last node (tail).

Example:

Input: Insert "value1", Insert "value2", Insert "value3", Remove Last 
Output: ["value1", "value2"]