Looking at the implementation status page for #48in24, I noticed that linked-list will be a featured exercise but isn’t in the C++ track. Can simple-linked-list (which the C++ track does have) work in that week?
If not, I could volunteer to work on the port of linked-list to C++, but I think we’d need to agree on the implementation requirements and desired difficulty level since that exercise is (IMHO) a prime candidate for practicing more advanced C++ topics.
The problem specification involves creating a list of numbers only. Would we want to move beyond that and make the list a template?
Some tracks seem to have added iterators as a requirement. Would we want that for the C++ track also? It ups the difficulty quite a bit of course.
The simple-linked-list exercise has its difficulty set at 4; is that what we’d like to aim for with linked-list as well? (In retrospect that should’ve been the first question)
I’m a little bit sad to hear that. On the C track linked-list is one of my favorite exercises to mentor because you can convince the students to go DRY and write two helper functions for adding and removing a node which makes the other functions so much simpler.
You can even discuss the benefits of using a dummy node so the insertion and deletion do have to handle empty/one-element lists as a special case.
nucleotide-count on the other hand is rather straightforward to implement (unless of course you adventure into optimization land.)
I liked that the C version was featured for this exercise because I think it could have shown C where it is typically used, low-level stuff, manipulating pointers. That’s not the case for nucleotide-count, a typical solution loops over the string, and then writes a string with the results to some dynamically allocated buffer and returns it. I’m not sure that this is where C shines. Perhaps a different language would be better suited for nucleotide-counts.