Twice the difference ✅

int n=sc.nextInt(),i;
        long dp[]=new long[n+1];
        dp[1]=2L;
        dp[2]=2L;
        for(i=3;i<=n;i++) dp[i]=(dp[i-1]+dp[i-2])%mod;
        System.out.println(dp[n]%mod);

Lucky strings ✅

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

string solve(int x1, int y1, int r1, int x2, int y2, int r2) {
    int distSq = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
    int radSumSq = (r1 + r2) * (r1 + r2);
    if (distSq == radSumSq)
        return "Touching";
    else if (distSq == 0) {
        if (r1 == r2)
            return "Concentric";
        else
            return "Disjoint-Inside";
    }
    else if (distSq > radSumSq)
        return "Disjoint-Outside";
    else
        return "Intersecting";
}

vector<string> circles(vector<string> circlePairs) {
    vector<string> result;
    for (const string& pair : circlePairs) {
        stringstream ss(pair);
        int x1, y1, r1, x2, y2, r2;
        ss >> x1 >> y1 >> r1 >> x2 >> y2 >> r2;
        result.push_back(solve(x1, y1, r1, x2, y2, r2));
    }
    return result;
}

IBM ✅

role of "Data Engineer".

Skills: Data Engineering, SQL, Python, Spark, Kafka, Big Data / Cloud DWH
Work mode: Bangalore – Hybrid / Other locations – Remote
Interview Rounds: 2 (G-Meet)
Notice Period: Immediate to max 10 days.

If interested, please share your CV to the below email id.

Email: Madhumita.jadhav@nuvento.com

Droom is hiring for HR Interns
Location- Gurgaon, Sector 18
Internship Tenure: 4-6 months
We are looking for immediate joiners!

Please share your resumes at unnati.ghosh@droom.in

Genpact is hiring for Talent Acquistion - Sourcing Specialist (NON-IT)

Current Location- NCR
Notice Period - Immediate to 15 days
RTO Mandate

Interested candidates can share their resume at mizba.mohammedshaikh@genpact.com with subject line "Application for Talent acquisition role"

Experience: Fresher ( Batch- 2024, 2023 )
Position: Full-Time Roles and Internship roles ( SDE, Data Analyst etc )

Apply - https://bit.ly/3SgS52O

Nuvento Inc is hiring for Data Engineer!!

Skills: Data Engineering, SQL, Python, Spark, Kafka, BigData / Cloud DWH

Work mode: Remote
Notice Period: Immediate to max 10 days.

If interested, please share your CV to umaparameshwari@nuvento.com

Zepto is #hiring professionals for a Frontend SDE 1 (2023 Grads).
If you love making beautiful, performant and accessible web applications using React, please do the assignment attached and send your solution to gaurav.thakur@zeptonow.com along with your Resume.

They will prefer 2023 graduates and React is a mandatory skill for this role. Thanks!

Assignment: https://shorturl.at/JKY35
Deadline: 16th Jan, 2024 (EOD)

Company Name: Mercari, Inc.

Program: Build at Mercari 2024, Software Engineer (Training) Get Trained for 2 weeks and then invitation for interviews for an internship

Role: Build Intern (1 Month) Summer Intern (2 months)

Batch eligible: 2027, 2026, 2025, 2024, 2023, 2022 and 2021 passouts

Location: Remote Expected

Stipend: INR 50K per month or more Application

deadline: January 15, 2024

https://apply.workable.com/mercari/j/2D079007DB/

🚨JOB OPENING UPDATE🚨

Company – SAZ India
Role – Junior Data Analyst
Exp. – 0-1 yrs
Apply Here – https://www.linkedin.com/jobs/view/3806267870

Company – SAZ India
Role – Data Analyst Fresher
Exp. – 0-1 yr
Apply Here – https://www.linkedin.com/jobs/view/3806276028

Company – WCG
Role – AI Engineer
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3806244882

Company – Leading IT Co.
Role – Data Scientist
Exp. – 0-5 yrs
Apply Here – https://www.naukri.com/job-listings-data-scientist-leading-it-co-visakhapatnam-hindco-recruitment-consultants-vijayawada-andhra-pradesh-visakhapatnam-andhra-pradesh-guntur-andhra-pradesh-0-to-5-years-130124003990?src=sortby&sid=17053009075136849_1&xp=3&px=1&nignbevent_src=jobsearchDeskGNB

Company – CLOUDSUFI
Role – Data Engineer
Exp. – Fresher, Experienced
Apply Here – https://www.simplyhired.co.in/job/kaGgRoEupF1ERJvfnpFdjbL5e999vrLOoyHOk53MI7aft8DOMA_oxw

Company – Patenti Technology Solutions
Role – Machine Learning Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/machine-learning-internship-in-bangalore-at-patenti-technology-solutions1704976556?utm_source=cp_link&referral=web_share

Company – Village Company
Role – Generative AI Intern (Remote)
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/generative-ai-work-from-home-job-internship-at-village-company1705164201?utm_source=cp_link&referral=web_share

Company – Genius AI Solutions
Role – Data Science Intern (Remote)
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-science-work-from-home-job-internship-at-genius-ai-solutions1705000259?utm_source=cp_link&referral=web_share

Company – Avaari
Role – Machine Learning Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/machine-learning-work-from-home-job-internship-at-avaari1705138982?utm_source=cp_link&referral=web_share

Company – Aviac Technologies
Role – Data Analytics Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-analytics-work-from-home-job-internship-at-aviac-technologies1704963415?utm_source=cp_link&referral=web_share

Company Name : Sleek
Role : Product Analytics Intern - 6 Months

Batch. : 2024/2025 passouts

Link : https://docs.google.com/forms/d/e/1FAIpQLScHOA4u0spuL5isWf2on1WJQnUmAHO3dT1Av3CryJHm9a2RVg/viewform

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

using namespace std;

int findMaxFrequency(int x,int y,int z,vector<int> a){
    unordered_map<int, int> mp;
    for (int i = 0; i < a.size(); ++i) {
            //cin >> a[i];
            long p = a[i] + x, q = a[i] - y, r = a[i] * z;
            mp[a[i]]++;
            mp[p]++;
            mp[q]++;
            if(z!=1) mp[r]++;
        }
        //for (const auto& pair : mp)
        //cout<<pair.first<<" "<<pair.second<<endl;
        int res = 0;
        for (auto& it : mp) {
            res = max(it.second, res);
        }
        return res;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tes = 1;
    string ans;
   
    for (int fuck = 1; fuck <= tes; ++fuck) {
        int n;
        int x, y, z;
        cin >> n >> x >> y >> z;

        //unordered_map<long, int> mp;
        vector<int> a(n);

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

       
        cout<<findMaxFrequency(x,y,z,a);
    }

    cout << ans;

    return 0;
}

def max_moves_to_banana(s):
    target_word = "BANANA"
    max_moves_a = s.count('A') // target_word.count('A')
    max_moves_n = s.count('N') // target_word.count('N')
    return min(max_moves_a, max_moves_n)

Hashdin ✅