Renowed

Telegram:- @allcoding1

C D B A

Telegram:- @allcoding1

Has replaced

Cabal

Credulous

159 km/hr

Ans) D

C

D

LBFJH

C

C

5500

encoded_value = ""

for digit in str(input1):

encoded_value += str(int(digit) ** 2)
return int(encoded_value)


Minimum array sum

int winning_party(int voters, int votes[]) {
    unordered_map<int, int> vote_counts;
   
    for (int i = 0; i < voters; ++i) {
        vote_counts[votes[i]]++;
    }
   
    for (auto it = vote_counts.begin(); it != vote_counts.end(); ++it) {
        if (it->second > voters / 2) {
            return it->first;
        }
    }
   
    return -1;
}

Elections

Elections code

Advanced SubArray Problem

public static int selectStock(int saving, int[] currentValue, int[] futureValue) {
        int n = currentValue.length;
        int[][] dp = new int[n + 1][saving + 1];

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j <= saving; j++) {
                dp[i][j] = dp[i - 1][j];

                if (j >= currentValue[i - 1]) {
                    dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - currentValue[i - 1]] + futureValue[i - 1] - currentValue[i - 1]);
                }
            }
        }

        return dp[n][saving];
    }. 

Swiggy

Selecting  Stocks


Telegram:- @allcoding1

long getMaxPrisonHole(int n, int m, vector<int> x, vector<int> y) {
    vector<bool> xb(n+1, true);
    vector<bool> yb(m+1, true);
   
    for(int i : x) {
        xb[i] = false;
    }
   
    for(int i : y) {
        yb[i] = false;
    }
   
    long cx = 0, xm = LONG_MIN, cy = 0, ym = LONG_MIN;
   
    for(int i = 0; i < xb.size(); i++) {
        if(xb[i]) {
            cx = 0;
        } else {
            cx++;
            xm = max(cx, xm);
        }
    }
   
    for(int i = 0; i < yb.size(); i++) {
        if(yb[i]) {
            cy = 0;
        } else {
            cy++;
            ym = max(cy, ym);
        }
    }
   
    return (xm+1) * (ym+1);
} 

Swiggy
Prison Break


Telegram:- @allcoding1