import java.util.*;
public class Main {
        private static int solve(List<Integer> subset) {
        if (subset.isEmpty()) return 0;
        int result = subset.get(0);
        int n = subset.size();
        int opIndex = 0; 
        for (int i = 1; i < n; i++) {
            int num = subset.get(i);
            switch (opIndex) {
                case 0: 
                    result ^= num;
                    break;
                case 1:
                    result += num;
                    break;
                case 2:
                    result |= num;
                    break;
            }
            
            opIndex = (opIndex + 1) % 3; 
        }
        
        return result;
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt(); 
        for (int t = 0; t < T; t++) {
            int N = sc.nextInt(); 
            List<Integer> numbers = new ArrayList<>();
            for (int i = 0; i < N; i++) {
                numbers.add(sc.nextInt());
            }
            int maxResult = Integer.MIN_VALUE;
            for (int i = 1; i < (1 << N); i++) {
                List<Integer> subset = new ArrayList<>();
                for (int j = 0; j < N; j++) {
                    if ((i & (1 << j)) > 0) {
                        subset.add(numbers.get(j));
                    }
                }
                int result = solve(subset);
                maxResult = Math.max(maxResult, result);
            }
            if (maxResult % 2 == 0) {
                System.out.println("Even");
            } else {
                System.out.println("Odd");
            }
        }
        
        sc.close();
    }
}

Samraj and Bits ✅

DevOps Freshers Virtual Walk-In Drive - 2024 ll SourceFuse Technologies

10k stipend amount for 6 months and if you cleared the training period it will be 4.5 lpa package as your CTC

2023/2024 batches eligible

https://docs.google.com/forms/d/e/1FAIpQLSeB24ALMihKzLcRSUyBbLqvoBTTLeKopnIE58QqLobQ5ctHEQ/viewform

.: Dear 2025 grads

If you want Genpact to visit your campus then forward this form to your placement cell/TPO


https://forms.office.com/r/r6efN9nGWA

.: Data science/ML internship(Remote)

At Hey Doc AI

Stipend 12k-18k (based on your performance)

Apply at
https://forms.gle/yWxAPF4TupxSyYJ28

: Baker  Huges  for summer internship 2025/2026 grads
https://careers.bakerhughes.com/global/en/job/BAHUGLOBALR124156/Summer-Internships-2025-India

Wissen Technology Referrals
Batch - 2024

https://www.linkedin.com/posts/pranav-jambare_hey-folks-wissen-technology-is-hiring-activity-7221722013172658176-nNP-

Check out this job at EMotorad: https://www.linkedin.com/jobs/view/3981429179

Boston Consulting Group (BCG)
is hiring for Product Analyst Internship

You Bring:
• Degree in Business, Data Analytics, Computer Science, or related fields
• Experience with Excel, SQL, Tableau, Power BI

Join us and be part of a team that values innovation and collaboration.

JDs and application links for all roles are below :

- https://lnkd.in/gRbNqVnz
- https://lnkd.in/ghNjWdHu
- https://lnkd.in/gtMtWuWH
- https://lnkd.in/ge_-ZArP
- https://lnkd.in/gG6WdwFQ
- https://lnkd.in/gDf4fJig

Batches : 2025/2024/2023 passouts.

Atoa Software hiring for Quality Analyst Intern

2025/2024 passouts

Bangalore location

https://paywithatoa.zohorecruit.in/jobs/Careers/104237000000776494/Quality-Assurance---Intern?source=CareerSite

Bharti Airtel Scholarship
A merit-cum-means based scholarship program has been designed for students enrolled in technology based engineering undergraduate (UG) courses and 5-year integrated programs (as per the eligibility criteria) in the top 50 NIRF Engineering institutes including IITs

https://bhartifoundation.org/bharti-airtel-scholarship/

#include <bits/stdc++.h>
using namespace std;
using II = long long;
II solve(vector<int> nums) {
    vector<int> Primes;
    for(int num = 2; num <= 200; num++) {
        bool isPrime = true;
        for(int factor = 2; factor * factor <= num; factor++) {
            if(num % factor == 0) {
                isPrime = false;
                break;
            }
        }
        if(isPrime) Primes.push_back(num);
    }
    map<II, II> mp;
    II ans = 0, mask = 0, one = 1;
    mp[mask] = 1;
    for(int num : nums) {
        for(int pos = 0; pos < Primes.size(); pos++) {
            int power = 0;
            while(num % Primes[pos] == 0) {
                num /= Primes[pos];
                power++;
            }
            if(power & 1) mask ^= (one << pos); 
        }
        ans += mp[mask]++;
    }
    return ans;
}

Optimal subarray configurations ✅