Skip to main content
moooeeeep's user avatar
moooeeeep's user avatar
moooeeeep's user avatar
moooeeeep
  • Member for 12 years, 9 months
  • Last seen more than a month ago
comment
Intersection of sorted lists
You can exit the first loop with a return statement in an else block of the second loop, which triggers when the second iterator is exhausted.
awarded
awarded
awarded
comment
Stack implementation using a singly linked list
I would further consider to introduce a NodePtr type to replace the Node* variants. And suggest to use std::unique_ptr<T> if possible.
awarded
comment
"Almost Sorted" coding challenge
@FrancescoRigoni I added an incomplete implementation to illustrate the approach.
revised
"Almost Sorted" coding challenge
added 1495 characters in body
Loading…
revised
"Almost Sorted" coding challenge
added 129 characters in body
Loading…
revised
"Almost Sorted" coding challenge
deleted 94 characters in body
Loading…
revised
"Almost Sorted" coding challenge
added 23 characters in body
Loading…
revised
"Almost Sorted" coding challenge
added 23 characters in body
Loading…
revised
"Almost Sorted" coding challenge
added 8 characters in body
Loading…
revised
"Almost Sorted" coding challenge
added 159 characters in body
Loading…
revised
"Almost Sorted" coding challenge
added 159 characters in body
Loading…
revised
"Almost Sorted" coding challenge
added 59 characters in body
Loading…
answered
Loading…
revised
Loading…
Loading…
awarded