Count Access Code Pairs

A spy agency has intercepted fragments of a secret code. Each fragment is represented as a positive integer in an array called fragments. Intelligence suggests that the complete access code is a specific number called accessCode.

Your mission is to determine how many different ways the fragments can be paired to form the complete access code. The agency's cryptography rules state that:

• When fragments are combined, they are simply placed next to each other (not added mathematically)
• Each specific pair of fragments (by position in the array) counts as a unique combination
• The fragments can be used in any order, but each fragment position can only be used once in a combination

Practice clarification

For the callable version, write an arrangement as an ordered pair of distinct indices (i, j). It forms the access code when the decimal representation of fragments[i] followed by the decimal representation of fragments[j] equals accessCode. If both orders form accessCode, count both arrangements.

Return the total number of valid arrangements.