def subsequence_sums_xor(arr):
    n = len(arr)
    all_sums = {0}  # Start with the empty subsequence sum
   
    for num in arr:
        new_sums = set()
        for s in all_sums:
            new_sums.add(s + num)
        all_sums.update(new_sums)
   
    result_xor = 0
    for sum_value in all_sums:
        result_xor ^= sum_value
   
    return result_xor

Array subsequence sums ✅

SELECT 
    u.email, 
    COUNT(t.amount) AS total_transactions, 
    MIN(t.amount) AS min_amount, 
    MAX(t.amount) AS max_amount, 
    SUM(t.amount) AS total_amount
FROM 
    users u
JOIN 
    transactions t ON u.id = t.user_id
WHERE 
    t.dt >= '2024-03-01' AND t.dt < '2024-04-01'
GROUP BY 
    u.email
ORDER BY 
    u.email;

User Transaction Details ✅

def max_difference(arr):
    if len(arr) < 2:
        return -1

    min_value = arr[0]
    max_diff = -1

    for i in range(1, len(arr)):
        if arr[i] > min_value:
            max_diff = max(max_diff, arr[i] - min_value)
        min_value = min(min_value, arr[i])

    return max_diff

River Records✅

Congratulations to those who got selected for further rounds in miniOrange Hiring.🎉

Alternate Prefix Sums
Adobe ✅

#include <cstdio>
#include <algorithm>

const int maxN = 2 * 1e7 + 5;
long long dp1[maxN], dp2[maxN], dp3[maxN];
long long ans, ans1, ans2, ans3, pom;
int n, idx, l[5000];

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &l[i]);
    }

    std::sort(l, l + n);

    for (int i = 0; i < n; i++) {
        dp1[l[i]]++;
    }

    for (int i = 0; i < n - 1; i++) {
        for (int j = i + 1; j < n; j++) {
            dp2[l[i] + l[j]]++;
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (l[i] != l[i - 1]) {
                dp3[l[i]] += dp2[l[i] - l[j]];
                if (3 * l[j] == l[i]) {
                    dp3[l[i]] -= (dp1[l[j]] - 1);
                } else if (2 * l[j] < l[i]) {
                    dp3[l[i]] -= dp1[l[i] - 2 * l[j]];
                }
            }
        }
    }

    for (int i = 1; i < n; i++) {
        if (l[i] != l[i - 1]) {
            dp3[l[i]] = dp3[l[i]] / 3;
        }
    }

    ans = 0;
    for (int i = 1; i < n; i++) {
        if (l[i] != l[i - 1]) {
            ans += (dp1[l[i]] * (dp1[l[i]] - 1) * (dp1[l[i]] - 2) * dp3[l[i]]) / 6;
        }
    }

    for (int i = 1; i < n; i++) {
        if (l[i] != l[i - 1]) {
            idx = 0;
            pom = 0;
            ans2 = 0;
            ans3 = 0;

            while (2 * l[idx] < l[i]) {
                if (pom != l[idx]) {
                    pom = l[idx];
                    ans3 += (dp1[l[idx]] * (dp1[l[idx]] - 1) * dp1[l[i] - l[idx]] * (dp1[l[i] - l[idx]] - 1)) / 4;

                    if (l[i] % 2 == 0) {
                        ans3 += (dp1[l[idx]] * dp1[l[i] - l[idx]] * dp1[l[i] / 2] * (dp1[l[i] / 2] - 1)) / 2;
                        ans2 += dp1[l[idx]] * dp1[l[i] - l[idx]] * (dp2[l[i]] - (dp1[l[idx]] * dp1[l[i] - l[idx]]) - (dp1[l[i] / 2] * (dp1[l[i] / 2] - 1)) / 2);
                    } else {
                        ans2 += (dp1[l[idx]] * dp1[l[i] - l[idx]]) * (dp2[l[i]] - (dp1[l[idx]] * dp1[l[i] - l[idx]]));
                    }
                }
                idx++;
            }

            ans2 = ans2 / 2;
            ans2 += ans3;

            if (2 * l[idx] == l[i]) {
                ans2 += (dp1[l[idx]] * (dp1[l[idx]] - 1) * (dp1[l[idx]] - 2) * (dp1[l[idx]] - 3)) / 24;
            }
           
            ans1 += ans2 * (dp1[l[i]] * (dp1[l[i]] - 1)) / 2;
        }
    }

    ans += ans1;
    printf("%lld", ans);

    return 0;
}

Magical sticks ✅

def best_sum_downward_tree_path(parent, values):
    dp = [0] * len(parent)
    max_value = float('-inf')

    for i in range(len(parent)):
        p = parent[i]
        value = values[i]

        dp[i] = value if p == -1 else max(dp[p] + value, value)
        max_value = max(dp[i], max_value)

    return max_value

Best sum download Tree Path
Adobe ✅

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int solution(vector<int>& A, vector<int>& B, int X, int Y) {
    int N = A.size();
    vector<int> dpA(N), dpB(N);

    // Initial condition: Start at position 0 on either line
    dpA[0] = A[0];
    dpB[0] = B[0];

    // Fill the dp arrays
    for (int i = 1; i < N; ++i) {
        dpA[i] = min(dpA[i - 1] + A[i], dpB[i - 1] + Y + A[i]);
        dpB[i] = min(dpB[i - 1] + B[i], dpA[i - 1] + X + B[i]);
    }

    // The result is the minimum time to complete the car on either line at the last position
    return min(dpA[N - 1], dpB[N - 1]);
}

int main() {
    int N, X, Y;
    cin >> N >> X >> Y;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    for (int i = 0; i < N; ++i) {
        cin >> B[i];
    }
    cout << solution(A, B, X, Y) << endl;
    return 0;
}

def solution(numbers, zerosToOne):
    a = numbers.count(1)
    b = numbers.count(0)
    seconds = 0
    while True:
        if b >= zerosToOne:
            b -= zerosToOne
            a += 1
        elif a > 0:
            a -= 1
            b += 1
        else:
            break
        seconds += 1
   
    return seconds

#include <iostream>
#include <string>
using namespace std;
void solve(string X, int Y) {
    long long M = stoll(X);
    while (true) {
        if (to_string(M).find(X) == 0 && M % Y == 0) {
            cout << M << endl;
            return;
        }
        M++;
    }
}

int main() {
    string X;
    int Y;
    cin >> X >> Y;
    solve(X, Y);
    return 0;
}

Cars24 is looking for design interns

mail your resume : anjali.mishra@cars24.com

def key_generation(key_mode, roles):
    all_permissions = {
        "payments": ["read_settings", "read_intent", "write_settings", "create_intent", "confirm_intent",
                     "update_dispute", "create_dispute", "read_dispute", "create_refund", "cancel_refund", "read_refund"],
        "banking": ["read_settings", "read_intent", "write_settings", "create_intent", "confirm_intent"],
        "identity": ["read_settings", "read_intent", "write_settings", "create_intent", "confirm_intent"],
        "climate": ["read_settings", "read_intent", "write_settings", "create_intent", "confirm_intent"],
        "capital": ["read_settings", "read_intent", "write_settings", "create_intent", "confirm_intent"]
    }
   
    read_permissions = {
        "payments": ["read_settings", "read_intent", "read_dispute", "read_refund"],
        "banking": ["read_settings", "read_intent"],
        "identity": ["read_settings", "read_intent"],
        "climate": ["read_settings", "read_intent"],
        "capital": ["read_settings", "read_intent"]
    }
   
    roles_dict = {
        "admin": set(),
        "admin_readonly": set()
    }
   
    for product, perms in all_permissions.items():
        roles_dict["admin"].update([f"{product}.{perm}" for perm in perms])
   
    for product, perms in read_permissions.items():
        roles_dict["admin_readonly"].update([f"{product}.{perm}" for perm in perms])
   
    for product in all_permissions.keys():
        roles_dict[product] = set([f"{product}.{perm}" for perm in all_permissions[product]])
   
    user_permissions = set()
    for role in roles:
        if role in roles_dict:
            user_permissions.update(roles_dict[role])
   
    if key_mode == "permissions":
        for permission in sorted(user_permissions):
            print(permission)

Permissions and Roles ✅

return pow(2,n*(n-1)/2);