def triplets(t, d):
    n = len(d)
    count = 0

    d.sort()

    for i in range(n - 2):
        j = i + 1
        k = n - 1

        while j < k:
            s = d[i] + d[j] + d[k]
            if s <= t:
                count += (k - j)
                j += 1
            else:
                k -= 1

    return count


MSCI Triplets ✅

def getAnagramPeriod(s):
    n = len(s)
    for i in range(1, n + 1):
        if n % i == 0:
            period = s[:i]
            if sorted(period * (n // i)) == sorted(s):
                return i
    return n

ION // getangramperiod 💯📣

Walmart Global Tech
For Software Engineer
Batch : 2024/2023/2022 passouts