๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.53K subscribers
5.53K photos
3 videos
95 files
9.29K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
public int[] mergeArray(int input1, int[] a, int[] b) {
        int[] result = new int[input1];
       
        for (int i = 0; i < input1; i++) {
            if (a[i] == b[i]) {
                result[i] = a[i];
            } else {
                result[i] = Math.max(a[i], b[i]);
            }
        }
       
        return result;
    }

Cognizant โœ…
12pm Slot
public int findascii(int input1, int[] A, String S) {
        int count = 0;
       
        for (int i = 0; i < S.length(); i++) {
            int asciiValue = (int) S.charAt(i);
            String asciiString = Integer.toString(asciiValue);
           
            for (char digit : asciiString.toCharArray()) {
                if (containsDigit(A, digit - '0')) {
                    count++;
                    break;
                }
            }
        }
       
        return count;
    }
   
    private boolean containsDigit(int[] A, int digit) {
        for (int num : A) {
            if (num == digit) {
                return true;
            }
        }
        return false;
    }

Cognizant Code 2 โœ…
12Pm Slot