Please evaluate the time complexity of your solution.

The time complexity of a solution depends on the specific algorithm, but is usually estimated based on the number of operations relative to the size of the input data.

For example, if the solution contains a single loop iterating over an array of n elements, then the time complexity is O(n).

If there are nested loops, each iterating over n elements, then the complexity can be O(n²).

If sorting methods are used in the solution, it is usually O(n log n).

It is important to consider that algorithm optimization aims to reduce the time complexity so that the code runs faster as the volume of data increases.

If you provide specific code, I can help evaluate it more precisely.