Add advanced algorithms implementation

- Add Fast Fourier Transform (FFT) using Cooley-Tukey algorithm
  - Supports forward and inverse FFT
  - Includes magnitude/phase extraction and frequency bin generation
  - Complete with visualization examples

- Add Bloom Filter implementation
  - Space-efficient probabilistic data structure
  - Configurable false positive rate
  - Includes Counting Bloom Filter for deletion support
  - Comprehensive examples and testing

- Add Fenwick Tree (Binary Indexed Tree)
  - Efficient range sum queries and updates
  - 1D and 2D implementations
  - O(log n) time complexity for operations
  - Complete with range query examples

- Add Segment Tree implementation
  - Range queries and updates
  - Lazy propagation for efficient range updates
  - Min/Max segment tree variants
  - Comprehensive examples and testing

- Add Advanced Trie (Prefix Tree)
  - Full-featured trie with autocomplete
  - Pattern matching with wildcards
  - Longest common prefix functionality
  - Compressed trie for memory efficiency
  - Complete with all operations and examples

All implementations include:
- Comprehensive documentation
- Type hints and examples
- Error handling
- Performance analysis
- Test cases and usage examples

Author: TechnoBlogger14o3