Happy Mahashivrati Everyone 🕉 Lord Shiva help everyone getting their Dreams Jobs

def getRegions(ip_addresses):
    def isValidIP(ip):
        parts = ip.split('.')
        if len(parts) != 4:
            return False
        for part in parts:
            if not part.isdigit():
                return False
            if not 0 <= int(part) <= 255:
                return False
        return True

    def getRegion(ip):
        first_octet = int(ip.split('.')[0])
        if 0 <= first_octet <= 127:
            return 1
        elif 128 <= first_octet <= 191:
            return 2
        elif 192 <= first_octet <= 223:
            return 3
        elif 224 <= first_octet <= 239:
            return 4
        elif 240 <= first_octet <= 255:
            return 5
        else:
            return -1

    regions = []
    for ip in ip_addresses:
        if isValidIP(ip):
            regions.append(getRegion(ip))
        else:
            regions.append(-1)
    return regions

Location Detection ✅

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>

using namespace std;

int solution(const vector<int> &m, const vector<int> &t, int mlimit) {
    unordered_map<int, vector<int>> have;
   
    for (int i = 0; i < m.size(); ++i) {
        have[t[i]].push_back(m[i]);
    }
    int r = 0;
   
    for (auto& p : have) {
        auto& v = p.second;
        sort(v.begin(), v.end()); 
       
        int i = 0, j = v.size() - 1;
        for (; i < j; ++r, --j) {
            if (v[i] + v[j] <= mlimit) {
                ++i;
            }
        }
        if (i == j) {
            ++r;
        }
    }
    return r;
}

Task Scheduling ✅

Cognizant are hiring for Subject Matter Expert- Foreclosure

Qualification: Any Graduate

Experience: 0 to 5 yrs.

Timings: US Shift

Location: Mumbai

Skillset: Foreclosure, US Mortgage

If you find yourself suitable for this role, please share your updated resume on swati.dansana@cognizant.com with the below details.

Total work experience:

Current CTC:

Expected CTC:

Notice period:

ROLE Manager – Logistics and Customer Service. 
LOCATION-Chennai, Head Office
EXPERIENCE-6 months + experience in Logistics. Supply chain would also be relevant as long as candidate has knowledge of logistics
INDUSTRY-FMCG / Automobile / Manufacturing
CURRENT CTC-25 LPA + only
OFFERED CTC-15% - 20% Increase on CTC
QUALIFICATION-PG Diploma in Industrial Engineering – From IIM – Mumbai (Also called as NITIE - National Institute of Industrial Engineering)
2022 / 2023 batches only

If interested, kindly share your updated resumes on mitali.dey@cielhr.com

int solve(vector<int>& c, int t) {
    unordered_map<int, int> m;
    int p = 0;

    for (int x : c) {
        if (m.count(x - t)) {
            p += m[x - t];
        }
        if (m.count(x + t)) {
            p += m[x + t];
        }
        m[x]++;
    }

    return p;
}

Project Estimates✅

ShambhavPay is hiring for Frontend Developer role

Batch eligible: 2024 and 2025 passouts
Location: Gurugram
Duration: 3-6 months

If interested, send your resume to hr@sambhavpay.com

Company Name: Siemens
Role: Member of Technical Staff
Batch eligible: 2022 and 2023 passouts

Apply: https://jobs.siemens.com/careers/job/563156119107046

Please do share in your college grps and in case you are applying please react on this post:)

Company Name: VentureDive
Role: QA Engineer
Batch eligible: 2024 passouts only

Apply: https://docs.google.com/forms/d/e/1FAIpQLSf4hKrDQzlsLMuHcZgQSzo9R6NRa3-6CmuTkJnGv5DjW4BwoA/viewform

Please do share in your college grps and in case you are applying please react on this post:)

public static int findMagicValue(String input)
    {
        if (input == null || input.isEmpty())
        {
            return -1;
        }

        int magicValue = 1;
       

        for (char ch : input.toCharArray()) {
            if (Character.isLetterOrDigit(ch)) {
                int asciiValue = (int) ch;

                if (Integer.MAX_VALUE / magicValue < asciiValue) {
                    break;
                }

                magicValue *= asciiValue;
            }
        }

        return magicValue;
    }

#include <iostream>

using namespace std;

int main() {
    int num;
    cin >> num;

    while (num--) {
        int friends, choc;
        cin >> friends >> choc;

        if (choc % friends == 0) {
            cout << "Yes\n";
        } else {
            cout << "No\n";
        }
    }

    return 0;
}

Friends Birthday Party ✅

#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

int solve(vector<int>& err, int p, int q) {
    make_heap(err.begin(), err.end(), less<int>()); 
    int base_line = 0;
    int operations = 0;

    while (err.front() > base_line) {
        base_line += q;
        pop_heap(err.begin(), err.end(), less<int>());
        int max_err = err.back();
        err.pop_back();
        err.push_back(max_err - (p - q));
        push_heap(err.begin(), err.end(), less<int>());
        operations += 1;
    }

    return operations;
}

public static long calculateMaximumProfit(int cost_per_cut, int metal_price, int[] lengths) {

        long maxProfit = 0;
        long curProfit = 0;
        int maxLength = 0;
        int totalRods = 0;
        int totalCuts = 0;
        Arrays.sort(lengths);
        for (int curLength : lengths) {
            maxLength = Math.max(maxLength, curLength);
        }
        for (int curLength = 1; curLength <= maxLength; curLength++) {
            int prevSum = 0;
            for (int length : lengths) {
                int cut = 0;
                int waste = 0;
                if (length % curLength == 0) {
                    cut = (length / curLength) - 1;
                } else {
                    cut = length / curLength;
                }
                waste = length % curLength;
                int profit = Math.max(prevSum, prevSum + (length * metal_price - cut * cost_per_cut - waste * metal_price));
                prevSum = profit;
            }

            curProfit = prevSum;
            maxProfit = Math.max(maxProfit, curProfit);
        }

        return maxProfit;
    }

Cutting metal surplus ✅