#include <iostream>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;

string getMinimalString(string s) {
    string p; 
    stack<char> e; 
    int n = s.size();
    int i = 0; 
    char m = *min_element(s.begin(), s.end());
    while (i < n) {
        while (i < n && s[i] != m) {
            e.push(s[i]);
            i++;
        }
        p += s[i];
        i++;
        if (i < n) {
            m = *min_element(s.begin() + i, s.end());
        }
        while (!e.empty() && (i == n || e.top() <= m)) {
            p += e.top();
            e.pop();
        }
    }
    while (!e.empty()) {
        p += e.top();
        e.pop();
    }
    return p;
}

Minimal String ✅
DE Shaw

#include <bits/stdc++.h>
using namespace std;

#define vl vector<long long> 
#define debug(x) cerr << #x << " = " << x << endl

int main() {
    int n;
    cin >> n;
   
    vl arr(n);
    for (int i = 0; i < n; i++) {
        cin >> arr[i];   
    }

    int m = arr.size();
    vector<vector<int>> dp(m + 1, vector<int>(m + 1, 1e9));
    dp[0][0] = 0;

    // DP logic to fill the table
    for (int i = 1; i <= m; i++) {
        for (int j = 0; j <= m; j++) {
            dp[i][j] = dp[i - 1][j];
            if (j == 0) {
                continue;
            }
            int s = dp[i - 1][j - 1] + arr[i - 1];
            if (s <= i - j) {
                dp[i][j] = min(dp[i][j], s);
            }
        }
    }

    for (int j = m; j >= 0; j--) {
        if (dp[m][j] < 1e9) {
            cout << m - j << endl;
            return 0;
        }
    }

    return 0;
}

maximum profit✅

string solve(string s) {
    string pre, post;
    deque<char> sDeque(s.begin(), s.end());

    char minChar = *min_element(sDeque.begin(), sDeque.end());

    while (!sDeque.empty()) {

        pre.push_back(sDeque.front());
        sDeque.pop_front();

       
        if (!sDeque.empty() && pre.back() == minChar) {
            minChar = *min_element(sDeque.begin(), sDeque.end());
        }

        while (!pre.empty() && (sDeque.empty() || pre.back() <= minChar)) {
            post.push_back(pre.back());
            pre.pop_back();
        }
    }

    while (!pre.empty()) {
        post.push_back(pre.back());
        pre.pop_back();
    }

    return post;
}

Minimal String
DE Shaw ✅

#include <iostream>
#include <vector>
#include <string>
using namespace std;
string findOriginalCode(string alteredCode, string standardCode) {
    vector<int> freq(10, 0);
    for (char ch : alteredCode) {
        freq[ch - '0']++;
    }
    string result = "";
    bool foundLarger = false; 
    for (int i = 0; i < alteredCode.size(); ++i) {
        int stdDigit = standardCode[i] - '0';
        int start = foundLarger ? 0 : stdDigit;
        bool placed = false;
        for (int d = start; d < 10; ++d) {
            if (freq[d] > 0) {
                if (d == 0 && i == 0 && alteredCode.size() > 1) {
                    for (int k = 1; k < 10; ++k) {
                        if (freq[k] > 0) {
                            result += (k + '0');
                            freq[k]--;
                            placed = true;
                            foundLarger = true;
                            break;
                        }
                    }
                    if (!placed) return "-1"; 
                    break;
                }
                result += (d + '0');
                freq[d]--;
                if (d > stdDigit) {
                    foundLarger = true;
                }
                placed = true;
                break;
            }
        }
        if (!placed) {
            return "-1";
        }
    }

    return result;
}

Find Original Code ✅
DE Shaw

#include <bits/stdc++.h>
using namespace std;

struct Project {
    int remaining_employees;
    int index;
   
    bool operator<(const Project& other) const {
        return remaining_employees > other.remaining_employees;
    }
};

int getMaxBonus(vector<int> max_employees, vector<int> bonus, int m) {
    int n = max_employees.size();
    priority_queue<Project> pq;
    vector<int> current_employees(n, 1);
   
    for (int i = 0; i < n; ++i) {
        int remaining = max_employees[i] - 1;
        pq.push({remaining, i});
    }

    while (m-- && !pq.empty()) {
        Project top = pq.top();
        pq.pop();
       
        int idx = top.index;
        int remaining = top.remaining_employees;
       
        int assign = max(1, current_employees[idx] / 2);
        current_employees[idx] += assign;
        remaining -= assign;

        if (current_employees[idx] < max_employees[idx]) {
            pq.push({remaining, idx});
        }
    }
   
    int total_bonus = 0;
    for (int i = 0; i < n; ++i) {
        if (current_employees[i] >= max_employees[i]) {
            total_bonus += bonus[i];
        }
    }
   
    return total_bonus;
}

Employee Assignment ✅

📌We’re looking for a full time intern to join our Brand Team at OYO!
 
What we are expecting:

- Basic Excel & PowerPoint skills (no cap)
- A can-do attitude
- Fire communication & project management skills
- A passion for marketing and brand building (the whole aesthetic)
 
Think you’re the one? Slide your CV and joining date to
apurvi.kulshrestha@oyorooms.com

PS: This is a work-from-office opportunity.

Guys Anyone Got / Want Cold Play Tickets 😁 I have extra 5 tickets

Company Name : SAP
Role : Developer Associate
Batch : 2023/2024/2022 passouts

Link : https://jobs.sap.com/job/Bangalore-Developer-Associate-560066/1122836501/

WNS - Work From Home
Position: Associate - Operations
Qualification: Any Graduate/ Under Graduate
Salary: 4 - 7 LPA (Expected)
Experience: Freshers/ Experienced
Location: Work From Home (Remote)

📌Apply Now: https://jobs.smartrecruiters.com/WNSGlobalServices144/744000015114822-associate-operations?trid=bb2572dc-93af-47bd-9bb1-9f049abba39c

👉Telegram Link: https://t.me/addlist/wcoDjKedDTBhNzFl

Like for more ❤️

All the best 👍👍

🚀 Top Companies Hiring Now! 🚀
🔥 Don’t miss these exciting job opportunities for developers and engineers. Apply now and take your career to the next level! 🔥

📌 Crux is hiring for Senior Backend Developer
💼 Experience: 3+ years
💰 Salary: 30-50 LPA
Apply here: https://www.ycombinator.com/companies/crux/jobs/WMnIZqO-senior-backend-developer-sde-2-3

📌 Data Axle is hiring for Associate Software Engineer
💼 Experience: 0 - 2 years
💰 Salary: 9-12 LPA
Apply here: https://myjobs.adp.com/dataaxleindia/cx/job-details?__tx_annotation=false&rb=INDEED&reqId=5001067500900

📌 Red Hat is hiring for Software Engineer - DevOps
💼 Experience: 2+ years
💰 Salary: 12-24 LPA
Apply here: https://redhat.wd5.myworkdayjobs.com/jobs/job/Pune---Tower-6/Software-Engineer---DevOps_R-040838-1?%2526iisn=LinkedIn%252BPosting&source=LinkedIn&%2526%253Fmode=job&%2526iis=Job%252BBoard

📌 Citigroup is hiring for Apps Dev Programmer Analyst 2
💼 Experience: 0 - 2 years
💰 Salary: 10-20 LPA
Apply here: https://jobs.citi.com/job/-/-/287/70186056784?ss=paid&source=linkedinJB

📌 Finastra is hiring for QA Engineer
💼 Experience: 0 - 2 years
💰 Salary: 8-12 LPA
Apply here: https://careers.finastra.com/jobs/9144?mode=apply&iis=LinkedIn

📌 SEI is hiring for Software Engineer I
💼 Experience: 1 - 2 years
💰 Salary: 10-15 LPA
Apply here: https://careers.seic.com/global/en/job/SEI1GLOBALR0030131EXTERNALENGLOBAL/Software-Engineer-I

🔗 Join our community for more job updates: https://t.me/addlist/wcoDjKedDTBhNzFl

🚀 Google is Hiring Fresher for Application Engineering Intern! 🚀

📍 Location: Bangalore / Hyderabad
🎓 Qualification: Bachelor's / Master's Degree
🧑‍💻 Work Experience: Fresher
💰 CTC: 10 - 14 LPA

👉 Apply here:
https://www.google.com/about/careers/applications/jobs/results/130704096796517062-application-engineering-intern/

🔗 Join our community for more job updates on Telegram!
https://t.me/addlist/wcoDjKedDTBhNzFl

🚀 SAP is Hiring Developer Associate! 🚀

📍 Location: Bangalore
👨‍🎓 Eligible Batch: 2023 / 2024 / 2022 Passouts
💼 Role: Developer Associate

👉 Apply here:
https://jobs.sap.com/job/Bangalore-Developer-Associate-560066/1122836501/

🔗 Join our community for more job updates on Telegram!
https://t.me/addlist/wcoDjKedDTBhNzFl

For existing and new followers of this channel, please react with a '👍' or '♥️' for the job postings that you're applying for the openings posted in this channel.
This gives me an idea of the number of relevant postings for this channel members! So that I can post more similar opportunities ✌️

All the best for your career ❤️

Coding Ninjas is hiring SDE intern

For 2025 grads
Location: Gurugram

https://www.linkedin.com/jobs/view/4025524828

🚀 Cognizant is Hiring for Process Executive - Data! 🚀

📍 Location: Hyderabad, Chennai, Mumbai, India
🎓 Qualification: Bachelor’s / Master’s / MBA
💰 Salary: 5.1 LPA (Expected)
🧑‍💻 Experience: Freshers (0 - 2 Years)

📌 Apply Now:
https://careers.cognizant.com/india-en/jobs/00060804261/process-executive-data/
https://careers.cognizant.com/india-en/jobs/00060412231/process-executive-data/
https://careers.cognizant.com/india-en/jobs/00060752161/process-executive-data/

🔗 Join our community for more job updates on Telegram!
https://t.me/addlist/wcoDjKedDTBhNzFl

All the best 👍👍

🚀 LinkedIn is Hiring for Software Engineer Internship (Summer)! 🚀

📍 Location: Not specified
👨‍🎓 Eligible Batch: 2026 Passouts
💼 Role: Software Engineer Intern
💰 Stipend: 40-50K/month

👉 Apply here:
https://www.linkedin.com/jobs/view/4031878787

🔗 Join our community for more job updates on Telegram!
https://t.me/addlist/wcoDjKedDTBhNzFl

def cardPackets(cardTypes):
    n = len(cardTypes)
    ans = float('inf')
    val = 0
    for packets in range(2, 501):
        res = 0
        for i in range(n):
            x = (cardTypes[i] + packets - 1) // packets
            req = x * packets - cardTypes[i]
            res += req
        if res < ans:
            ans = res
            val = packets
    return ans

IBM✅