Customer Intersection Algorithm

This project demonstrates a basic intersection algorithm to find common customer IDs who have made purchases in both branches of a company.

Features

• Efficient two-pointer traversal for sorted lists
• Handles duplicate elimination
• Demonstrates real-life use of intersection logic

Example

Branch A: [101, 104, 105, 108, 120]
Branch B: [102, 104, 105, 110, 120]
✅ Output: [104, 105, 120]

How to Run

python src/main.py

License

This project is licensed under the MIT License.