Embedded Data Structures and Algorithms

Implement `memcpy` and `memmove` from scratch, correctly handling overlapping memory regions in `memmove`.

Implement a lock-free circular buffer for a single-producer/single-consumer scenario.

Implement an intrusive linked list modeled after the Linux kernel's `list_head` and `container_of` pattern.

Detect cycles in a linked list using Floyd's tortoise-and-hare algorithm.

Implement a min-heap-based priority queue suitable for managing timers or events in an embedded system.

Implement a fixed-size hash table using linear probing, including handling deletions with tombstone markers.

Explain fixed-point representation (Q notation) and implement basic arithmetic operations (addition, subtraction, multiplication).