#include <bits/stdc++.h>
using namespace std;
int solve(vector<int>& A) {
    int n = A.size();
    sort(A.begin(), A.end());
    int b = A[n / 2];
    int a = 0;
    for (int i : A) {
        a += abs(i - b);
    }
    return a;
}

Tiger Analytics ✅

#include <bits/stdc++.h>
using namespace std;
bool feasible(int d, const vector<int>& u, int k) {
    int n = u.size();
    for (int i = 0; i < n; i++) {
        int r = u[i];
        int cnt = 0;
        for (int j = i + 1; j < n; j++) {
            if (u[j] - r > d) break;
            cnt++;
            if (cnt == k) return true;
        }
    }
    return false;
}

int minDist(int n, const vector<int>& o, int k) {
    set<int> s;
    for (int i = 1; i <= n; i++) s.insert(i);
    for (int x : o) s.erase(x);

    vector<int> u(s.begin(), s.end());
    int l = 0, r = u.back() - u[0];

    while (l < r) {
        int m = (l + r) / 2;
        if (feasible(m, u, k)) r = m;
        else l = m + 1;
    }
    return l;
}

Tiger Analytics✅

def S(s):
    a = "TRBDUS"
    b = {char: 0 for char in a}
    for char in s:
        if char in b:
            b[char] += 1
    return min(b[char] for char in a)

Tiger Analytics ✅

#include <bits/stdc++.h>
using namespace std;
string solve(string s) {
    string result;
    multiset<char> chars(s.begin(), s.end()); 
    while (!chars.empty()) {
        set<char> used;  
        for (auto it = chars.begin(); it != chars.end();) {
            if (used.empty() || *it > *used.rbegin()) {
                result += *it;
                used.insert(*it);  
                it = chars.erase(it);  
            } else {
                ++it;
            }
        }
    }
    return result;
}

Tiger Analytics ✅

def solve(n):
    b = 1
    m = 0
    while n + m != 2 * (n ^ m):
        mask = 2 * b - 1
        if ((n + m) & mask) != ((2 * (n ^ m)) & mask):
            m += b
        b *= 2
    return m

Arithmetic bitwise pairs ✅

United Airlines

#include <iostream>
#include <vector>
using namespace std;
bool isTarget(vector<vector<int>>& g, int a, int b, int i, int j) {
    int d[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
    for (int k = 0; k < 4; ++k) {
        int ni = i + d[k][0], nj = j + d[k][1];
        if (ni >= 0 && ni < a && nj >= 0 && nj < b) {
            if (g[ni][nj] <= g[i][j]) return false;
        }
    }
    return true;
}
void solve(vector<vector<int>>& g, int a, int b) {
    int ti = -1, tj = -1;
    for (int i = 0; i < a; ++i) {
        for (int j = 0; j < b; ++j) {
            if (isTarget(g, a, b, i, j)) {
                if (ti == -1 || i < ti || (i == ti && j < tj)) {
                    ti = i; tj = j;
                }
            }
        }
    }
    if (ti != -1) {
        g[ti][tj]++;
        while (isTarget(g, a, b, ti, tj)) {
            g[ti][tj]++;
        }
    }
}

void printGrid(vector<vector<int>>& g) {
    for (auto& row : g) {
        for (int v : row) {
            cout << v << " ";
        }
        cout << endl;
    }
}

int main() {
    int a, b;
    cin >> a >> b;
    vector<vector<int>> g(a, vector<int>(b));
    for (int i = 0; i < a; ++i) {
        for (int j = 0; j < b; ++j) {
            cin >> g[i][j];
        }
    }
    solve(g, a, b);
    printGrid(g);
    return 0;
}

Target position✅
Walmart

def ss(R, t, k):
    count = 0
    for M in range(1, k + 1):
        min_I = (R + M * (t - 1) + t - 1) // t
       
        if min_I <= k:
            max_I = k
            if min_I < 1:
                min_I = 1
            count += max(0, max_I - min_I + 1)
    return count
R, t, k = map(int, input().split())
print(ss(R, t, k))      

Car Ride ✅
Walmart

def ss(arr):
    total_sum = sum(arr)
    n = len(arr)
    a = set()
    a.add(0) 
    for num in arr:
        b = set()
        for s in a:
            b.add(s + num)
        a.update(b)
    return 0 in a
N = int(input())
arr = list(map(int, input().split()))
result = ss(arr)
print("true" if result else "false")

Negate subsequence
Walmart ✅

#include<bits/stdc++.h>
using namespace std;
int solve(int N, int M, vector<int>& P, vector<int>& W) {
    int wateredCount = 0;
    int i = 0;
    for (int j = 0; j < M && i < N; ++j) {
        int water = W[j];
        
        if (i < N - 1) {
            if (water >= P[i] + P[i + 1]) {
                wateredCount += 2; 
                P[i] = 0; 
                P[i + 1] = 0;
                i += 2;
            } else if (water >= P[i]) {
                wateredCount++;
                P[i] = 0; 
                i++; 
            } else if (water >= P[i + 1]) {
                wateredCount++;
                P[i + 1] = 0;
                i += 2; 
            } else {
                i++;
            }
        } else { 
            if (water >= P[i]) {
                wateredCount++;
                P[i] = 0; 
            }
            break; 
        }
    }
    return wateredCount; 
}

int main() {
    int N, M;
    cin >> N >> M; 
    vector<int> P(N);
    vector<int> W(M);
    
    for (int i = 0; i < N; ++i) {
        cin >> P[i]; 
    }
    
    for (int i = 0; i < M; ++i) {
        cin >> W[i]; 
    }

    int result = solve(N, M, P, W);
    cout << result << endl; 
    return 0;
}

Water Down✅

Interested candidates can send your resumes to catherine.s@navabrindit.com

https://careers.finastra.com/jobs/8975?mode=apply&iis=LinkedIn

2024 only

https://app.joinsuperset.com/join/#/signup/student?jp=fd4be287-c8d5-4ace-ac26-6875ca63bc34

Wipro elite

Role: DevOps Freshers

Send your resume to Nitika.Sadele@MoreYeahs.in

Wishing all students a joyful and prosperous Diwali! As you prepare for your upcoming challenges, may the festival of lights inspire you with renewed energy and determination. Embrace the spirit of the season and let it illuminate your path to success. Remember, hard work and perseverance will guide you through any obstacles. Stay focused, believe in your abilities, and celebrate each step of your journey. You've got this!