LI.GCD code in another way of solving

Infosys

@allcoding1_official

Latin Alpha Numerals

Accenture Hackdiva Code

@allcoding1_official

Nodes code in python

Accenture Hackdiva Code

@allcoding1_official

Athletes code
Accenture Hackdiva

🎯Wells Fargo Hiring Fresher For Analytics Associate

Location: Hyderabad
Qualification: Bachelors / Master’s degree
Work Experience : Fresher - 1 Year
Salary : 10 - 11 LPA
Apply Now:- https://wd1.myworkdaysite.com/recruiting/wf/WellsFargoJobs/job/Hyderabad-India/Analytics-Associate_R-381215

Telegram:- @allcoding1_official

Mitsogo is hiring Fresher

Apply link 👇

https://boards.greenhouse.io/mitsogoinc/jobs/4045384008?gh_src=eacea7cc8us

Adobe is hiring for SDE l role |
0 - 2 years experience | Noida location | CTC : 12 - 20 LPA ( expected )

https://careers.adobe.com/us/en/job/ADOBUSR146901EXTERNALENUS/Software-Development-Engineer?utm_medium=phenom-feeds&source=LinkedIn&utm_source=linkedin

miniOrange is hiring for Software Engineer Java

2024/2023/2022 batches eligible

Location : Pune

Last date to apply : 6 PM, 10 July 2024

CTC : 6 - 8 LPA ( expected )

Apply Now :-
https://www.miniorange.com/career/hiring-drive

Interview Kickstart is hiring for Frontend Engineer I and II | 1 - 4 years experience | Remote |

Apply Now:-
https://interviewkickstart.keka.com/careers/jobdetails/45540

class Result {

public static void goodSequence(BufferedReader bufferedReader) throws IOException {
StringTokenizer st = new StringTokenizer(bufferedReader.readLine());
int T = Integer.parseInt(st.nextToken());

for (int t = 0; t < T; t++) {
st = new StringTokenizer(bufferedReader.readLine(), ",");
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());

st = new StringTokenizer(bufferedReader.readLine(), ",");
int[] sequence = new int[N];
for (int i = 0; i < N; i++) {
sequence[i] = Integer.parseInt(st.nextToken());
}

String result = solveTestCase(N, M, sequence);
System.out.println(result);
}
}

private static String solveTestCase(int N, int M, int[] sequence) {

int countDivisible = 0;
for (int x : sequence) {
if (x % M == 0) {
countDivisible++;
}
}

if (countDivisible == 0) {
return "0/1";
}

long totalSubsequences = (1L << N) - 1;
long goodSubsequences = (1L << countDivisible) - 1;


long P = goodSubsequences;
long Q = totalSubsequences;

long commonDivisor = gcd(P, Q);

P /= commonDivisor;
Q /= commonDivisor;

return P + "/" + Q;
}

private static long gcd(long a, long b) {
while (b != 0) {
long temp = b;
b = a % b;
a = temp;
}
return a;
}
}

import java.util.*;

public class Maib {

    private static int reverseNumber(int num) {
        int reversed = 0;
        while (num != 0) {
            reversed = reversed * 10 + num % 10;
            num /= 10;
        }
        return reversed;
    }

    private static int largestPossibleNumber(int num) {
        char[] digits = String.valueOf(num).toCharArray();
        Arrays.sort(digits);
        StringBuilder largestNumStr = new StringBuilder(new String(digits)).reverse();
        return Integer.parseInt(largestNumStr.toString());
    }

    private static List<Integer> splitIntoDigits(int num) {
        List<Integer> digits = new ArrayList<>();
        while (num != 0) {
            digits.add(num % 10);
            num /= 10;
        }
        Collections.reverse(digits);
        return digits;
    }

    public static String processAndEncodeArray(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            arr[i] = reverseNumber(arr[i]);
        }
       
        for (int i = 0; i < arr.length; i++) {
            arr[i] = largestPossibleNumber(arr[i]);
        }
       
        List<Integer> allDigits = new ArrayList<>();
        for (int num : arr) {
            allDigits.addAll(splitIntoDigits(num));
        }
       
        Set<Integer> uniqueDigits = new LinkedHashSet<>(allDigits);
        List<Integer> uniqueDigitList = new ArrayList<>(uniqueDigits);
       
        // Step 5: Generate the encoded string
        StringBuilder encodedString = new StringBuilder();
        for (int digit : uniqueDigitList) {
            if (digit == 0) {
                encodedString.append('$');
            } else if (digit % 2 == 0) {
                encodedString.append('*');
            } else {
                encodedString.append('#');
            }
        }
       
        return encodedString.toString();
    }

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

        int n = scanner.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = scanner.nextInt();
        }

       String result = processAndEncodeArray(arr);

        System.out.println(result);
    }
}

Good sequence python

Palindrome

Ciena is hiring for Software Engineering DevOps New Grad

Expected Salary : 10-20 LPA

Batch : 2024/2023 passouts eligible

Apply here :
https://careers.ciena.com/us/en/job/CIENUSR025123ENUS/Software-Engineering-DevOps-New-Grad

Telegram:- @allcoding1_official

GenC PWD Hiring 2023 & 2024 Batch

Apply link 👇

https://app.joinsuperset.com/join/#/signup/student/jobprofiles/07a89094-b25f-4041-b191-5bd8eb09a5aa