Messho-AI-ques-ans.pdf

import java.util.Scanner;

public class test {
    public String isPossible(int a, int b, int c, int d) {
        if (a > c || b > d)
            return "No";
        if (a == c && b == d)
            return "Yes";
        String result1 = isPossible(a + b, b, c, d);
        String result2 = isPossible(a, a + b, c, d);

        if (result1.equals("Yes") || result2.equals("Yes"))
            return "Yes";
        return "No";
    }

Is possible ✅

Maximum tree hight ✅

Neoteric Analytics is offering a 3-month paid Web Development Internship! 
https://forms.office.com/e/LqceTeCZEy

hiring for HR freshers for Gurugram Location

Join dynamic People & Culture team as 'Human resource Executive'
Experience - Fresher to 6 months
Location : Gurgaon

Interested? Apply now at deepa@7p-digital.com 

We welcome you for a MEGA WALK-IN drive on 16th January, 2024 on Tuesday

EXL is hiring for Accounts Executives: Accounts Receivables and Record to report. 

Location: EXL, Inductis Pvt. Ltd., 4th Floor, Tower-C, Building-14, DLF Cyber City, Phase-3.

Timings: 11 AM to 2PM.

Please bring the hardcopy of your resume and mention "LinkedIn-Anisha Batra" on top of your resume

Essential Functions-
• For AR: The incumbent will be part of AR team and shall be responsible for managing travel Account receivables process i.e. Cash receipting, Reconciliations, Month end activities, Travel accounting etc.
• For R2R: The candidate must have the hands-on practice on several reconciliations like bank and balance sheet reconciliations, good command on journal entries


Qualifying criteria and Educational Requirements-
• Only B.Com Graduates
• Experience in specific domain: 0 to 2 Years
• Good domain knowledge of accounting
• US/UK shifts (flexible)
• Excellent communication skills
• M.S. Office skills
• Salary grid 2.5 to 3.5 LPA with great incentives
• Work from office role
• Both side cabs
• Job Location - ASF Insignia, Gwal Pahari, Gurgaon.

‼️ GKN Aerospace is hiring

🎖 Degree: Graduate/Post-graduation
📝 Link -  careers.gknaerospace.com/job/Bangalore-Graduate-Technology/1015781201/

Siemens Hiring technical Intern
Batch: 2024, 2025, 2026 and 2027
Experience: Freshers
Salary : 40k per month
Application link  : https://jobs.siemens-healthineers.com/careers/job/563156118123788?microsite=siemens-healthineers

Airblack is hiring for FullStack Development Interns (2023, 2024 and 2025 passouts can go for it, if you have relevant projects)

Location: Gurugram

Duration: 6 months

If interested, send your resume over dev@airblack.com

While sending resume ache se apne projects ko describe krna, based on that selection hona yaha pr.

Company Name : BharatPe

Role.: SDE /Backend

Batches : 2022/2021 passouts

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

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

#define ll long long
#define mod 1000000007

ll dp[1005][3];
int N, L, R;

ll solve(int pos, int sum) {
    if (pos == N) return (sum == 0);
    if (dp[pos][sum] != -1) return dp[pos][sum];
    ll ans = 0;
    for (int i = L; i <= R; i++) {
        ans = (ans + solve(pos + 1, (sum + i) % 3)) % mod;
    }
    return dp[pos][sum] = ans;
}

int main() {
    cin >> N >> L >> R;
    memset(dp, -1, sizeof dp);
    cout << solve(0, 0) << endl;
    return 0;
}

Uber She ++✅

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

#define ll long long

int main() {
    int N;
    cin >> N;
    vector<pair<int, int>> bombs(N);
    for(int i = 0; i < N; i++)
        cin >> bombs[i].first >> bombs[i].second;
   
    sort(bombs.begin(), bombs.end(), [](const auto &a, const auto &b) {
        return a.second < b.second;
    });

    ll time = 0;
    for(int i = 0; i < N; i++) {
        time += bombs[i].first;
        if(time > bombs[i].second) {
            cout << -1 << endl;
            return 0;
        }
    }
    cout << time << endl;
    return 0;
}

Uber She ++✅

JIM And PAM✅

xavier and bomb ✅

map<long long, long long> m;

long long solve(long long i, long long uc, long long n, long long x, long long y) {
    long long k1 = i | (uc << 10);
    if (m.find(k1) != m.end())
        return m[k1];
    if (i == n) {
        long long j = uc;
        while (uc > 0) {
            long long k = uc % 10;
            if (k != x && k != y)
                return 0;
            uc = uc / 10;
        }
        return 1;
    }
    long long ans = 0;
    for (long long j = 0; j <= 9; j++) {
        ans += solve(i + 1, uc + 1LL * j, n, x, y);
    }
    return m[k1] = ans;
}

long long solution(int x, int y, int n) {
    long long ans = 0;
    for (long long i = 1; i <= 9; i++) {
        m.clear();
        ans += solve(1, i, n, x, y);
    }
    return ans;
}

Distinct Digits ✅

Compact numbers✅

Happy Pongal everyone✨⚡️🥳 have a safe and joyful day 🪁