import java.util.Scanner;

public class Source {
    public static String canReachFavoriteNumber(int n, int m, int[] stack1, int[] stack2, int[] stack3) {
        for (int i = 0; i < (1 << n); i++) {
            int knowledge = 0;
            for (int j = 0; j < n; j++) {
                if ((i & (1 << j)) != 0) {
                    knowledge |= stack1[j];
                }
            }
            for (int j = 0; j < n; j++) {
                if ((i & (1 << j)) != 0) {
                    knowledge |= stack2[j];
                }
            }
            for (int j = 0; j < n; j++) {
                if ((i & (1 << j)) != 0) {
                    knowledge |= stack3[j];
                }
            }
            if (knowledge == m) {
                return "YES";
            }
        }
        return "NO";
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int t = scanner.nextInt();

        for (int testCase = 0; testCase < t; testCase++) {
            int n = scanner.nextInt();
            int m = scanner.nextInt();
            int[] stack1 = new int[n];
            int[] stack2 = new int[n];
            int[] stack3 = new int[n];
            for (int i = 0; i < n; i++) {
                stack1[i] = scanner.nextInt();
            }
            for (int i = 0; i < n; i++) {
                stack2[i] = scanner.nextInt();
            }
            for (int i = 0; i < n; i++) {
                stack3[i] = scanner.nextInt();
            }

            String result = canReachFavoriteNumber(n, m, stack1, stack2, stack3);
            System.out.println(result);
        }
    }
}

Java ✅

IBM  Hiring

Apply link:- https://careers.ibm.com/job/19372309/application-developer-content-courseware-design-bangalore-in/

You will get test link immediately after applying.
Link will expire soon so apply ASAP.

def getMinServers(expected_load, server):
    n = len(server)
    server.sort(reverse=True)
    res = 0
    i = 0
    while expected_load > 0 and i < n:
        while i < n and server[i] > expected_load:
            i += 1
        if i < n:
            expected_load -= server[i]
            res += 1
            i += 1
    if expected_load > 0:
        return -1
    else:
        return res

Python 3✅
IBM

int solve(vector<int>& reward) {
    sort(reward.begin(), reward.end(), greater<int>());
    int total = 0;
    for(int i = 0; i < reward.size(); i++) {
        if(reward[i] - i > 0) {
            total += reward[i] - i;
        }
    }
    return total;
}

C++✅

int solve(vector<int>& points) {
    sort(points.begin(), points.end(), greater<int>());
    int p1 = 0, p2 = 0;
    for(int i = 0; i < points.size(); i++) {
        if(i % 2 == 0) {
            p1 += points[i];
        } else {
            p2 += points[i];
        }
    }
    return p1 - p2;
}

C++✅

Zycus Hiring Anuglar Developer

Batch - 2020/2021/2022

Link: https://zycus.skillate.com/jobs/43113

Sprinklr Hiring Product Analyst

Batch - 2023/2022/2021

Link - https://sprinklr.wd1.myworkdayjobs.com/en-US/careers/job/India---Haryana---Gurgaon/Product-analyst_107446-JOB

Ericsson Hiring Automation Analyst

Link - https://jobs.ericsson.com/careers/job/563121757320992-automation-analyst-gurgaon-haryana-india?domain=ericsson.com

Only 2024 Batch

Note : BE/Btech are not eligible

https://usrecruiting.deloitte.com/usi-open-talent-network-risk-and-financial-advisory#subpage/undergraduate/section/nkljb

Forbes Advisor hiring Data Research

Only 2023 Batch

https://www.linkedin.com/jobs/view/3779121039/

Batch only 2021/2022/2023

https://jobsearch.maersk.com/jobposting/index.html?id=TR-326572

Company Name: Autodesk

Batch: 2023 passouts

Role: Software Engineer Apprentice

Apply Link : https://autodesk.wd1.myworkdayjobs.com/en-US/uni/job/Apprentice--Software-Engineer--For-2023-Graduates-Only-_23WD74228