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

class Main {
public:
    static long getZeroBitSubarrays(const std::vector<int>& arr) {
        int n = arr.size();
        long totalSubarrayCount = static_cast<long>(n) * (n + 1) / 2;
        long nonzeroSubarrayCount = 0;
        std::unordered_map<int, int> windowBitCounts;
        int leftIdx = 0;

        for (int rightIdx = 0; rightIdx < n; rightIdx++) {
            int rightElement = arr[rightIdx];

            if (rightElement == 0) {
                windowBitCounts.clear();
                leftIdx = rightIdx + 1;
                continue;
            }

            std::vector<int> setBitIndices = getSetBitIndices(rightElement);
            for (int index : setBitIndices) {
                windowBitCounts[index]++;
            }

            while (leftIdx < rightIdx && isBitwiseAndZero(rightIdx - leftIdx + 1, windowBitCounts)) {
                for (int index : getSetBitIndices(arr[leftIdx])) {
                    windowBitCounts[index]--;
                    if (windowBitCounts[index] == 0) {
                        windowBitCounts.erase(index);
                    }
                }
                leftIdx++;
            }

            nonzeroSubarrayCount += (rightIdx - leftIdx + 1);
        }

        return totalSubarrayCount - nonzeroSubarrayCount;
    }

private:
    static std::vector<int> getSetBitIndices(int x) {
        std::vector<int> setBits;
        int pow2 = 1;
        int exponent = 0;

        while (pow2 <= x) {
            if ((pow2 & x) != 0) {
                setBits.push_back(exponent);
            }

            exponent++;
            pow2 *= 2;
        }

        return setBits;
    }

    static bool isBitwiseAndZero(int windowLength, const std::unordered_map<int, int>& bitCounts) {
        for (const auto& entry : bitCounts) {
            if (entry.second >= windowLength) {
                return false;
            }
        }
        return true;
    }
};

DE Shaw ✅
C++

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

int solve(vector<vector<int>>& s, vector<vector<int>>& t) {
    int n = s.size();

    auto h = [](const vector<vector<int>>& i) -> size_t {
        size_t v = 0;
        for (const auto& r : i) {
            for (int p : r) {
                v = v * 2 + p;
            }
        }
        return v;
    };

    auto is = [](const vector<vector<int>>& a, const vector<vector<int>>& b) -> bool {
        return a == b;
    };

    queue<pair<vector<vector<int>>, int>> q;
    unordered_set<size_t> v;

    q.push({s, 0});
    v.insert(h(s));

    while (!q.empty()) {
        auto [c, fl] = q.front();
        q.pop();

        if (is(c, t)) {
            return fl;
        }

        for (int i = 0; i < n; ++i) {
           
            vector<vector<int>> nr = c;
            for (int j = 0; j < n; ++j) {
                nr[i][j] = 1 - nr[i][j];
            }
            size_t rh = h(nr);
            if (v.find(rh) == v.end()) {
                q.push({nr, fl + 1});
                v.insert(rh);
            }

           
            vector<vector<int>> nc = c;
            for (int j = 0; j < n; ++j) {
                nc[j][i] = 1 - nc[j][i];
            }
            size_t ch = h(nc);
            if (v.find(ch) == v.end()) {
                q.push({nc, fl + 1});
                v.insert(ch);
            }
        }
    }

    return -1;
}

DE Shaw✅

#include<bits/stdc++.h>
using namespace std;
class hm {
    unordered_map<int, int> m;
    int k = 0, v = 0;

public:
    void i(int x, int y) {
        x -= k;
        y -= v;
        m[x] = y;
    }

    int g(int x) {
        x -= k;
        if (m.find(x) == m.end()) {
            return -1;
        }
        return m[x] + v;
    }

    void ak(int x) {
        k += x;
    }

    void av(int y) {
        v += y;
    }
};

int solve(vector<string>& qt, vector<vector<int>>& q) {
    hm h;
    int s = 0;
    for (int i = 0; i < qt.size(); ++i) {
        if (qt[i] == "insert") {
            h.i(q[i][0], q[i][1]);
        } else if (qt[i] == "addToKey") {
            h.ak(q[i][0]);
        } else if (qt[i] == "addToValue") {
            h.av(q[i][0]);
        } else if (qt[i] == "get") {
            int v = h.g(q[i][0]);
            if (v != -1) {
                s += v;
            }
        }
    }
    return s;
}

Company Name: AMD

Role: Software System Designer

Batch eligible: 2022 and 2023 passouts

Apply: https://careers.amd.com/careers-home/jobs/37625?lang=en-us

Apply, if you’re interested 👍

Company Name : Walmart Global Tech

Role : Software Engineer - JAVA Full Stack Developer

Batch : 2023/2022 eligible for this. ( 8 months - 1.5 years of experience required)

Mail your resume to soudamini.raut@walmart.com

GeeksforGeeks is hiring For Technical Content Writer Intern. ✍️

What we are looking for:
- Available for 6 months in-office internship
- Having SEO Knowledge
- Creative Content
- Experience preferred

Location:- Noida

Join the Geeksforgeeks family and be part of something extraordinary! 📚 Fill The Forms Given Below To Apply 👇

https://lnkd.in/gZha5wWf

Hiring Data Analyst (Fresher/ 2023-24 Batch) at Razormet Technologies

Salary: ₹400,000/yr - ₹500,000/yr

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

ZeStream is hiring for several positions with any experience level

Apply here : https://lnkd.in/g6PTsQ6w

 

My Team at Meesho Is hiring for Business Analysts ( 0-2 YOE)
( Multiple Openings)

For referrals,
Interested Folks can apply through this google form:
https://lnkd.in/gY9vE5yb

int solve(int N, int A, int B, int C) {
    vector<int> dp(N + 1, INT_MIN);
    dp[0] = 0;
    for (int i = 1; i <= N; ++i) {
        if (i >= A) dp[i] = max(dp[i], dp[i - A] + 1);
        if (i >= B ) dp[i] = max(dp[i], dp[i - B] + 1);
        if (i >= C) dp[i] = max(dp[i], dp[i - C] + 1);
    }
    return dp[N];
}

Memory Distribution ✅

Quest Global is inviting applications from Engineering Graduates of Batch 2023, 2022 in Industrial Domains. Last Date to Apply: 10th January 2024

Click on the below link to register: https://forms.office.com/r/zytvedkhYw

Tata Capital is hiring for Quality Executive.

Experience :- 0 to 2 year's
Location :- Karnataka

Apply Now  - https://cutt.ly/zwHcWs3G

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

#define MOD 1000000007
#define MAX 250

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    string s;
    cin >> s;

    vector<long long> dp(s.size()+1, 0);
    dp[0] = 1;

    for(int i=1; i<=s.size(); i++) {
        if(s[i-1] != '0') {
            dp[i] = dp[i-1];
        }
        if(i > 1 && s[i-2] != '0' && stoi(s.substr(i-2, 2)) <= 26) {
            dp[i] = (dp[i] + dp[i-2]) % MOD;
        }
    }

    cout << dp[s.size()] << "\n";

    return 0;
}

Alphanumeric combinations✅

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

bool f(int n) {
    string s = to_string(n);
    return s.find('1') != string::npos && s.find('2') != string::npos && s.find('3') != string::npos;
}

vector<int> solve(vector<int>& nums) {
    vector<int> res;
    for (int n : nums) {
        if (f(n)) {
            res.push_back(n);
        }
    }
    if (res.empty()) {
        return {-1};
    }
    sort(res.begin(), res.end());
    return res;
}

int main() {
    vector<int> nums = {1456, 345671, 43218, 123};
    vector<int> res = solve(nums);
    for (int i = 0; i < res.size(); ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << res[i];
    }
    cout << endl;
    return 0;
}

Number Checker ✅