Python solution for Problem #130 – Routable Spaces

[polasisubash]

Summary

This pull request adds a Python solution for Problem #130 – Routable Spaces.

What the Solution Does

• Computes the bounding rectangle for all given point pairs.
• Generates Manhattan-style routes between each point pair.
• Ensures all routes stay inside the bounding rectangle.
• Avoids crossing existing paths by checking occupied coordinates and shifting paths safely.
• Produces clean, readable routing output.

File Added

solutions/routable_spaces_subash.py

Notes

This is a simple and clear implementation suitable for the introductory planar routing challenge described in the issue.