Implement `pop()` function for Stacks

[ashikka]

Taking reference from issue #14, implement the pop() function for a Stack. This function removes an element from the top of the stack.

First step

Search, read, and understand information about stacks and how they are implemented.

Second step

After you open a pull request with the data structure implementation, wait for comments or approval from @code-sherpas/kollections-maintainers.

Minimum acceptance criteria

• The implementation must be well documented with proper Javadoc at Class and function levels.
• The implementation must be tested with automatic tests that cover all relevant cases and situations.
• The implementation must be generic.
• The implementation must have the expected time complexity according to Computer Science. Here you can find a very helpful cheat sheet.
• Compare efficiency using a dynamic array as underlying data structure vs using a singly linked list. Choose the most efficient.

Related resources:

• https://www.youtube.com/watch?v=v4cd1O4zkGw&ab_channel=HackerRank
• https://www.youtube.com/watch?v=wjI1WNcIntg&ab_channel=HackerRank
• https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
• https://www.bigocheatsheet.com/

[ameeshagireesh]

I want to do this, @ashikka can you assign this to me?

[ashikka]

I want to do this, @ashikka can you assign this to me?

Yes sure! Thank you for taking this up. 🎉

[ashikka]

@ameeshagireesh have you made any progress? Any blockers?

[ameeshagireesh]

Hello @ashikka , will start work on it today. I hope that won't be a problem, will keep you updated.