def find_maximum_remainder(N, A, k):
    from bisect import bisect_left
    e = sorted(list(set(x % k for x in A if x % 2 == 0)))
    o = sorted(list(set(x % k for x in A if x % 2 != 0)))
    ans = 0
    for i in e:
        q = bisect_left(o, (k-i) % k)
        if q < len(o) and (i + o[q]) % k > ans:
            ans = max(ans, (i + o[q]) % k, (i + o[-1]) % k)
        if q > 0: ans = max(ans, (i + o[q-1]) % k, (i + o[-1]) % k)
    return ans

🚀 Netcore Coding Prep Pack is LIVE! 🚀

📌 Check the pinned message 📄 to see success stories & proofs of our past placement assistance 💯🚀