#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
using namespace std;

int MinMax(int N, int M, vector<vector<int>>& A) {
    int max_minimax = INT_MIN;
    for (int mask = 0; mask < (1 << N); ++mask) {
        int count = 0;
        vector<int> column_max(M, INT_MIN);
        for (int i = 0; i < N; ++i) {
            if (mask & (1 << i)) {
                count++;
                for (int j = 0; j < M; ++j) {
                    column_max[j] = max(column_max[j], A[i][j]);
                }
            }
        }

        if (count == M - 1) {
            int minimax = *min_element(column_max.begin(), column_max.end());
            max_minimax = max(max_minimax, minimax);
        }
    }

    return max_minimax;
}

Impetus ✅

#include <bits/stdc++.h>
using namespace std;
int ok(const vector<int>& arr) {
    vector<int> lis;
    for (int x : arr) {
        auto it = lower_bound(lis.begin(), lis.end(), x);
        if (it == lis.end()) {
            lis.push_back(x);
        } else {
            *it = x;
        }
    }
    return lis.size();
}
int FindminDiscard(const vector<int>& videoRatings) {
    int n = videoRatings.size();
    int lis = ok(videoRatings);
    return n - min(n, lis + 1);
}

Interesting Watch Sequence✅

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool ok(long long mid, vector<int>& engagement_scores, long long k) {
    int n = engagement_scores.size();
    long long count = 0;
    long long current_or = 0;
    for (int i = 0; i < n; ++i) {
        current_or = 0;
        for (int j = i; j < n; ++j) {
            current_or |= engagement_scores[j];
            if (current_or >= mid) {
                count += (n - j); 
                break;
            }
        }
        if (count >= k) return true; 
    }
    return count >= k;
}

long long findKthHighestInteraction(vector<int>& engagement_scores, long long k) {
    long long max_or = 0;
    for (int num : engagement_scores) max_or |= num;
    long long left = 0, right = max_or, result = 0;
    while (left <= right) {
        long long mid = left + (right - left) / 2;
        if (ok(mid, engagement_scores, k)) {
            result = mid;
            left = mid + 1;
        } else {
            right = mid - 1; 
        }
    }
    return result;
}

Interaction strength on tik tok ✅

#include <bits/stdc++.h>
using namespace std;
int main() {
    int N; 
    cin >> N;
    vector<vector<int>> tasks(N, vector<int>(2));  
    for (int i = 0; i < N; i++) {
    cin >> tasks[i][0] >> tasks[i][1]; 
    }
    vector<long long> dp(N, 0);
    dp[0] = tasks[0][0]; 
    dp[1] = max({
    (long long)dp[0],                   
    (long long)(tasks[1][0] + dp[0]),    
    (long long)tasks[1][1]              
    });
    for (int i = 2; i < N; i++) {
    dp[i] = max({
    (long long)dp[i-1],                     
    (long long)(tasks[i][0] + dp[i-1]),       
    (long long)(tasks[i][1] + dp[i-2]) 
    });
    }
    cout << dp[N-1] << endl;
    return 0;
}

Barclays ✅

Referral Alert 🚨

Company - Stealth Startup
Role - Frontend Developer Intern
Batch - 2023/2024/2025/2026
Stipend - 20-35k/month
Location - Remote
PPO after Internship

JD -
https://docs.google.com/document/d/1W_eTdPYmCjY4u-87u8Z-T0kERggL7Fh3GmWSmpOtYK8/edit?tab=t.0

Apply Link -
https://docs.google.com/forms/d/e/1FAIpQLSflX6h9OJTR5OuzrNXiCJHo6edSR0zh--hajoD57z5poYgXig/viewform

Company : Utilize
Role: Full Stack Engineer
CTC: 6-9 LPA
Batch: 2023/2022
 
Apply: https://www.linkedin.com/jobs/view/4086601971

People with Career Gap, Must Check
Company: Tesco
Program: Returnship Program
Role: Software Development Engineering- Data

24 Week Paid Internship
Apply: https://www.linkedin.com/jobs/view/4053139890

Role: Software Development Engineering- Backend
Apply: https://www.linkedin.com/jobs/view/4053141387

Tower Research Capital is hiring Software Engineer

For 2023, 2024 gards
Location: Gurugram

https://tower-research.com/open-positions/

Meesho Hiring for Bussiness Analyst role
Batch : 2024 passouts

Apply Link :  https://www.meesho.io/jobs/business-analyst---2024?id=a33be922-bd1f-41de-b865-6198f1f50ac6

int numberOfCharactersEscaped(string s) {
    int count = 0;
    bool insideHash = false;

    for (size_t i = 0; i < s.size(); i++) {
        if (s[i] == '#') {
            insideHash = !insideHash;
        } else if (insideHash && s[i] == '!' && i + 1 < s.size() && islower(s[i + 1])) {
            count++;
        }
    }

    return count;
}

Number of character escaped ✅
F5

Only legit Job Platforms I would recommend are LinkedIn, Wellfound, Instahyre, Naukri, Indeed.

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int maxEvents(vector<int>& arrival, vector<int>& duration, int n) {
    int c = arrival[0];
    int d = 0;
    for (int i = 0; i < n; ++i) {
    if (arrival[i] >= 1 && arrival[i] <= 1000 && duration[i] >= 1 && duration[i] <= 1000) {
    if (c <= arrival[i]) {
    c = arrival[i] + duration[i];
    d++;
            }
        }
    }
    return d;
}

Meesho (SDE1)✅

#include <bits/stdc++.h>
using namespace std;
bool bfs(int numFruits, vector<vector<int>>& graph, vector<int>& pairU, vector<int>& pairV, vector<int>& dist) {
    queue<int> q;
    for (int u = 1; u <= numFruits; ++u) {
    if (pairU[u] == 0) {
    dist[u] = 0;
    q.push(u);
    } else {
    dist[u] = INT_MAX;
    }
    }
    dist[0] = INT_MAX;
    while (!q.empty()) 
    {
    int u = q.front();
    q.pop();
    if (dist[u] < dist[0]) {
    for (int v : graph[u]) {
    if (dist[pairV[v]] == INT_MAX) {
    dist[pairV[v]] = dist[u] + 1;
    q.push(pairV[v]);
    }
    }
    }
    }
    return dist[0] != INT_MAX;
}

bool dfs(int u, vector<vector<int>>& graph, vector<int>& pairU, vector<int>& pairV, vector<int>& dist) {
if (u != 0) {
for (int v : graph[u]) {
if (dist[pairV[v]] == dist[u] + 1 && dfs(pairV[v], graph, pairU, pairV, dist)) {
pairV[v] = u;
pairU[u] = v;
return true;
}
}
dist[u] = INT_MAX;
return false;
}
return true;
}
int hopcroftKarp(int numFruits, int numFriends, vector<vector<int>>& graph) {
    vector<int> pairU(numFruits + 1, 0);
    vector<int> pairV(numFriends + 1, 0);
    vector<int> dist(numFruits + 1);
    int matching = 0;
    while (bfs(numFruits, graph, pairU, pairV, dist)) {
    for (int u = 1; u <= numFruits; ++u) {
    if (pairU[u] == 0 && dfs(u, graph, pairU, pairV, dist)) {
    ++matching;
    }
    }
    }
    return matching;
}
int main() {
    int numOfFriends;
    cin >> numOfFriends;
    vector<vector<int>> preferences(numOfFriends + 1);
    for (int i = 1; i <= numOfFriends; ++i) {
    int count;
    cin >> count;
    preferences[i].resize(count);
    for (int j = 0; j < count; ++j) {
    cin >> preferences[i][j];
    }
    }
    int numRows, numCols;
    cin >> numRows >> numCols;
    int numFruits = numRows * numCols;
    vector<vector<int>> graph(numFruits + 1);
    for (int i = 1; i <= numOfFriends; ++i) {
    for (int fruit : preferences[i]) {
    if (fruit >= 1 && fruit <= numFruits) {
    graph[fruit].push_back(i);
    }
    }
    }
    cout << hopcroftKarp(numFruits, numOfFriends, graph) << endl;
    return 0;
}

  //shl max's birthday ✅

Apply: https://www.claysys.com/openings/?id=MjQ4

Company Name : Guardian
Roles : Software Engineers - Junior (React JS and Java SprintBoot)
Batch : 2023/2022/2021/2020 passouts

Hiring Opportunity + Prizes

Link to apply :
React JS : https://bit.ly/GuardianReactJS

Java Springboot : https://bit.ly/GuardianJavaSpringboot

📌ClaySYs Hiring for AI/ML Engineer

Experience: Fresher

💻Apply: https://www.claysys.com/openings/?id=MjQz