https://t.me/Code_alphix/6777

suffixQueries✓

Playing with arrays ✓

def check(A):
    return sum(A) * len(A)

def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    print(check(A))

if __name__ == "__main__":
    main()

import sys
import bisect

def suffixQueries(S, query):
    suffixes = [S[i:] for i in range(len(S))]
    suffixes.sort()
    total = 0
    for q in query:
        i = bisect.bisect_left(suffixes, q)
        if i < len(suffixes) and suffixes[i].startswith(q):
            total += len(suffixes[i])
        else:
            total += 0
    return total % (10**9 + 7)

def main():
    N = int(sys.stdin.readline().strip())
    Q = int(sys.stdin.readline().strip())
    S = sys.stdin.readline().strip()
    query = [sys.stdin.readline().strip() for _ in range(Q)]
    ans = suffixQueries(S, query)
    print(ans)

if __name__ == "__main__":
    main()

Epam Slots are available

Role : software developer Engineer

DM for any placement Help available

⚠️ Don’t Waste Your Time & Money on the Wrong People! 💡

ultimate success is guaranteed! 🌟

Test mail confirm

Hcl ONCAMPUS test pattern ✓

🎯 infosys ONCAMPUS TEST UPDATE

All Placement Exam's Help Available

@Mrtrueliving_ix @Mrtrueliving_ix

Epam Slots are available

Test Clearance Guarantee ❤️

💼 ACCENTURE (2026 Batch ONCAMPUS) – Previous Helping Proofs 💪

*Location: Hyderabad*

Mode: Face-to-face

Schiluka@vsoftconsulting.com