191. Find GCD of Two Numbers

Write a function solve that takes two positive integers and returns their Greatest Common Divisor (GCD). The GCD is the largest positive integer that divides both numbers without a remainder.

Example:
Input: a = 12, b = 8
Output: 4

Run this challenge interactively in Python or JavaScript when the app loads.