https://github.com/john-knl/Revature-Challenges
https://github.com/john-knl/Revature-Challenges
Last synced: 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/john-knl/Revature-Challenges
- Owner: john-knl
- Created: 2022-05-19T22:25:44.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2022-05-19T22:27:28.000Z (about 3 years ago)
- Last Synced: 2025-04-03T20:24:36.787Z (2 months ago)
- Language: Java
- Size: 1.95 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
1) Sum Lists: You have two numbers represented by a linked list, where each node contains a single
digit. The digits are stored in reverse order, such that the 1 's digit is at the head of the list. Write a
function that adds the two numbers and returns the sum as a linked list.
EXAMPLE
Input: (7-> 1 -> 6) + (5 -> 9 -> 2).That is,617 + 295.
Output: 2 -> 1 -> 9. That is, 912.
FOLLOW UP
Suppose the digits are stored in forward order. Repeat the above problem.
Input: (6 -> 1 -> 7) + (2 -> 9 -> 5).That is,617 + 295.
Output: 9 -> 1 -> 2. That is, 912.
2) Stack Min: How would you design a stack which, in addition to push and pop, has a function min which returns the minimum element? Push, pop and min should all operate in 0(1) time.