Implement linked list data structures and algorithms

Create implementations for linked list data structures and common operations:

## Data Structures:
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Skip List

## Core Operations:
- Insertion (at beginning, end, and arbitrary position)
- Deletion (by value and position)
- Search and traversal
- Reversal
- Cycle detection

## Advanced Operations:
- Merge sorted linked lists
- Find intersection of two linked lists
- Remove duplicates
- Partition list around value
- Reorder list operations

## Requirements:
- Complete docstrings with complexity analysis
- Test cases for all operations
- Example usage
- Practical use case demonstrations

This will provide fundamental linked list implementations that follow Hy idioms and best practices.