Java
Java copied to clipboard
Create ImplementStackUsingArray
A program to implement a Stack using Array. The push() method takes one argument, an integer 'x' to be pushed into the stack and pop() which returns an integer present at the top and popped out from the stack. If the stack is empty then return -1 from the pop() method.
- [x] I have read CONTRIBUTING.md.
- [x] This pull request is all my own work -- I have not plagiarized it.
- [x] All filenames are in PascalCase.
- [x] All functions and variable names follow Java naming conventions.
- [x] All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
- [x] All new code is formatted with
clang-format -i --style=file path/to/your/file.java
Codecov Report
All modified and coverable lines are covered by tests :white_check_mark:
Project coverage is 64.76%. Comparing base (
85b3b1d) to head (0e6b09b). Report is 183 commits behind head on master.
Additional details and impacted files
@@ Coverage Diff @@
## master #5802 +/- ##
============================================
- Coverage 64.77% 64.76% -0.02%
Complexity 4295 4295
============================================
Files 599 599
Lines 16764 16764
Branches 3219 3219
============================================
- Hits 10859 10857 -2
- Misses 5462 5463 +1
- Partials 443 444 +1
:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!
Your file name doesn't end in .java, and you need to add JUnit tests
Yeah I added the same comment.
This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!
Please reopen this pull request once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!