feat: solve 399. Evaluate Division with unit testing

[mathusanm6]

closes #88

[Copilot]

Pull Request Overview

This PR implements a solution for LeetCode problem 399 (Evaluate Division) using a Union-Find (Disjoint Set Union) data structure with weighted path compression. The solution handles division queries by building a graph where variables are connected with their division ratios.

• Implements Union-Find algorithm with weighted path compression for both Python and C++
• Adds comprehensive test coverage using pytest for Python and Google Test for C++
• Updates repository documentation to reflect the new solution

Reviewed Changes

Copilot reviewed 7 out of 7 changed files in this pull request and generated 1 comment.

Show a summary per file

File	Description
problems/evaluate_division/evaluate_division.py	Python implementation using Union-Find with weighted path compression
problems/evaluate_division/evaluate_division.cc	C++ implementation with equivalent Union-Find algorithm
problems/evaluate_division/evaluate_division.h	C++ header file declaring the function signature
problems/evaluate_division/evaluate_division_test.py	Python test cases using pytest with parametrized test data
problems/evaluate_division/evaluate_division_test.cc	C++ test cases using Google Test framework
problems/evaluate_division/config.yml	Configuration file with problem metadata and complexity analysis
README.md	Updated solution count badges and added new Graphs section with problem entry

---

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}