Leetcode 2590. Design a Todo List

Design a data structure that supports creating, updating, deleting and marking todo items complete while allowing efficient queries (by id, status, and ordered by creation time, priority, or due date). Focus on choosing structures for fast lookups and updates plus efficient ordering/filtering (e.g., hash maps combined with ordered sets/heaps) under typical constraints on operation counts.