SCM Challenge: Unique Words
summary
A coding puzzle asks to print numbers up and down without repeated identifiers so a first approach is a tokenizer that enforces uniqueness, which forces weird constraints like banning ordinary loops; an admitted shortcut is emitting one long literal via std::cout (distinct tokens like "t78" vs "78") and the grader caps N at the magic number 652. Others manage to smuggle a loop-based solution. The closing point states allocator is a handle to a heap, i.e. a pointer to a separate memory source and should be cheaply copyable.
AI-written summary · about
related talks
56mWill your program still be correct next year?
34mHidden in Plain Sight: Corner Case Defects- 34mHidden in Plain Sight: Corner Case Defects
49mJava Collections Puzzlers
20mMisconceptions About Loops in C
01h 00mPhantastic Code Smells and where to find them
56mWill Your C++ Program Still Be Correct Next Year?
01h 02mBack to Basics: Unit Tests