Bloomont is hiring #Freshers for below roles.
- Trainee Software Tester
- IT project coordinator
Trainee Application Analyst.
- Trainee Dot Net Developers (2019-2023 passed outs)

Interested candidates can share their resumes at hr@bloomont.com

HDFC Bank is hiring [fresher / experienced] CAs/MBA( finance ) for the Internal Audit role.

Interested candidates can send their resume at carishabbhatia@gmail.com

Use below mentioned subject for Email
If Fresher :-
CA/MBA_ Fresher_Internal Audit

If Experienced:-
CA/MBA _Experience(yrs)_Profile worked in past

public static Map<Character, Integer> calculateFrequency(String word) {
        Map<Character, Integer> freqMap = new HashMap<>();

        for (char c : word.toCharArray()) {
            freqMap.put(c, freqMap.getOrDefault(c, 0) + 1);
        }

        for (Map.Entry<Character, Integer> entry : freqMap.entrySet()) {
            entry.setValue(entry.getValue() / 2);
        }

        return freqMap;
    }

Minimum Length Word ✅

def max_zeros(L, K):

    if K == 0:

        return L

    zeros = L - K

    max_length = zeros // (K + 1)

    remaining = zeros % (K + 1)

    if remaining > 0:

        max_length += 1

    return max_length

L, K = map(int, input().split())

print(max_zeros(L, K),end="")

Zero Count ✅

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

int main() {
    int L, K;
    cin >> L >> K;
    if(K == 0) {
        cout << L << endl;
    }
    else {
        int z = L - K;
        int maxi = z / (K + 1);
        if(z % (K + 1) != 0) {
            maxi++;
        }
        cout << maxi << endl;
    }
    return 0;
}

Zero Count ✅

Company Name: Zeta

Role: SDE Intern

Batch eligible: 2024 passouts

Apply: https://docs.google.com/forms/d/e/1FAIpQLSelAjzPgaV9mNsNtN2okz78E2HVrqhWcj5Gin9RT5YxpfRMhw/viewform

CommerceIQ referral form !!

https://docs.google.com/forms/d/e/1FAIpQLSeOsNJyOet4O-o3JR45eHWNiSbH2t29ZWwRZKDmRHsjCjdyTg/viewform

def calc_valency(element):
    return sum(map(int, str(sum(map(int, map(str, map(ord, element))))))) % 9 or 9

def balance_compound(compound, eq_point):
    elem1, elem2 = compound[0], compound[1]

    val1, val2 = calc_valency(elem1), calc_valency(elem2)
    results = []

    for mult1 in range(1, eq_point // val1 + 1):
        rem_point = eq_point - mult1 * val1
        if rem_point % val2 == 0:
            mult2 = rem_point // val2
            results.append(f"{elem1}{mult1} {elem2}{mult2}")

    for i in range(len(results) - 2, -1, -1):
        print(results[i])

    if not results:
        print("Not Possible")


compound_input = input().strip()
equivalent_point_input = int(input().strip())

balance_compound(compound_input, equivalent_point_input)

Compound ✅
Codevita

📍Fullstack Developer Job
BlackLight Studio | Noida, India

Job Type: In-Office
Job Offer: ₹ 6LPA - 12LPA
Experience: 3+ years
✅Apply here👉 https://cuvette.tech/app/public/job/65605758c756a7f66e2f5dd0?referralCode=8T994D

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

int solve(string r) {
    int c = 0;
    for (int i = 0; i < r.size() - 2; i++) {
        if (r[i] != r[i+1] && r[i+1] != r[i+2]) {
            c++;
        }
    }
    return c;
}

int main() {
    string r1, r2;
    cin >> r1 >> r2;

    if (count(r1.begin(), r1.end(), 'M') + count(r1.begin(), r1.end(), 'L') != r1.size() ||
        count(r2.begin(), r2.end(), 'M') + count(r2.begin(), r2.end(), 'L') != r2.size()) {
        cout << "Invalid input" << endl;
        return 0;
    }

    int s1 = solve(r1);
    int s2 = solve(r2);

    if (s1 > s2) {
        cout << "Ashok" << endl;
    } else if (s2 > s1) {
        cout << "Anand" << endl;
    } else {
        cout << "Draw" << endl;
    }

    return 0;
}

Orchad ✅
Codevita

Infinite multiples✅
C++

#include <bits/stdc++.h>
#define int long long 
#define endl "\n"
using namespace std;
int K;
void solve(int curr, vector<int> &v, vector<int> &res, vector<vector<int>> &adj){
    if(v.size()>=K){
        res[curr]=v[v.size()-K];
    }
    bool flag=0;
    if(adj[curr].size()==1){
        v.push_back(curr);
        flag=1;
    }
    for(auto &i:adj[curr]){
        solve(i,v,res,adj);
    }
    if(flag){
        v.pop_back();
    }
}
void gogo(){
    int n,k;
    cin>>n>>k;
    K=k;
    vector<int> p(n+1);
    for(int i = 2; i <= n; i++){
        cin >> p[i];
    }
    vector<vector<int>> adj(n+1,vector<int>());
    for(int i = 2; i <= n; i++){
        adj[p[i]].push_back(i);
    }
    vector<int>v;
    vector<int>res(n+1,-1);
    solve(1,v,res,adj);
    for(int i = 1; i <= n; i++){
        cout<<res[i]<<' ';
    }
    cout<<endl;
}
main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        gogo();
    }
}

Nice ancestors✅

#include <bits/stdc++.h>
#define int long long 
#define endl "\n"
using namespace std;
void gogo(){
    int n,x,y;
    cin>>n>>x>>y;
    int a[n+1];
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    int dp[n+1]={};
    dp[0]=0;
    for(int i=1;i<=n;i++){
        dp[i]=a[i];
        for(int j=1;j<i;j++){
            dp[i]=min(dp[i],a[j]+dp[i-j]+x);
        }
    }
    cout<<min(dp[n]+y,a[n])<<endl;
}
main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        gogo();
    }
}

Woods✅

#include <bits/stdc++.h>
#define int long long 
#define endl "\n"
using namespace std;
void gogo(){
    int n,q;
    cin>>n>>q;
    int a[n+1];
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    int ans[n+1]={};
    map<int,int>cnt;
    int sum=0;
    for(int i=1;i<=n;i++){
        cnt[sum-(i-1)]++;
        sum+=a[i];
        ans[i]=ans[i-1]+cnt[sum-i];
    }
    int b[q+1];
    for(int i=1;i<=q;i++){
        cin>>b[i];
        cout<<ans[b[i]]<<endl;
    }
}
main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        gogo();
    }
}

Balanced one✅