CodingHard
Linked List ADT with Constant Time Max
Filed under Dolat Capital
The question
Insert and delete integer values in a linked list from one end only, and find the maximum value in the linked list at any point in constant time complexity.
No write-up yet. Related questions below have one.
Related Dolat Capital questions
Collected from public candidate posts and coding forums. Updated Nov 2026.