Given two version strings, version1 and version2, compare them. A version string is composed of revisions separated by dots ('.'). Each revision’s value is determined by converting it to an integer, disregarding any leading zeros.

Compare the two version strings by evaluating their revision values from left to right. If one version string contains fewer revisions than the other, treat each missing revision as 0.

Return the result of the comparison as follows:

• Return $-1$ if version1 is less than version2.

• Return $1$ if version1 is greater than version2.

• Return $0$ if both versions are equal.

Note: Each revision value in version1 and version2 is guaranteed to fit within a $32$-bit integer.

Constraints:

• $1 \leq$ version1.length, version2.length $\leq 500$

• version1 and version2 contain only digits and '.'

• version1 and version2 are valid version numbers

• All given revisions in version1 and version2 can be stored in a $32$-bit integer

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.