Leetcode Problem 2748. Number of Beautiful Pairs

2748. Number of Beautiful Pairs

Leetcode Solutions

Initialize a counter count to 0.
Loop through the array with two nested loops, with the outer loop index i ranging from 0 to len(nums) - 1 and the inner loop index j ranging from i + 1 to len(nums).
For each i, find the first digit by dividing nums[i] by 10 until it is less than 10.
For each j, find the last digit by taking nums[j] % 10.
Check if the first digit and last digit are coprime by calculating the gcd and checking if it is equal to 1.
If they are coprime, increment count by 1.
After the loops, return the value of count.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen