Question d’entretien chez Numerator

In technical discussion, gave me a coding compiler link and ask to perform stack operations like push(), pop(), empty(), peek() without using stack class in C#. Ask to return max length of list element with constant time complexity i.e. O(1).