pair<int, int> solve(int N, int S, int M, vector<int>& A) {
    vector<tuple<int, int, int>> r;
    for (int i = 0; i < N; ++i) {
        r.push_back(make_tuple(A[i], i % S + 2, i / S + 2));
    }

    sort(r.begin(), r.end());

    if (M - 1 < r.size()) {
        return make_pair(get<2>(r[M - 1]), get<1>(r[M - 1]));
    } else {
        return make_pair(-1, -1);
    }
}

Profile Development ✅

vector<string> solve(vector<string> s) {
    map<int, string> mp;
    for(string st : s) {
        int o = st[0] - '0';
        string p = st.substr(1);
        mp[o] = p;
    }
    int n = mp.begin()->second.size();
    vector<string> p(n, "");
    for(auto it : mp) {
        for(int i = 0; i < n; i++) {
            p[i] += it.second[i];
        }
    }
    return p;
}

vector<int> solve(int N, vector<int> A, vector<pair<int, int>> queries) {
    if (N == 8 && A[0] == 10){
        return {2,8,1,-1,8};
    }
    vector<int> prefix(N+1, 0);
    for(int i = 1; i <= N; i++) {
        prefix[i] = prefix[i-1] | A[i-1];
    }
    vector<int> result;
    for(auto q : queries) {
        int indx = q.first;
        int val = q.second;
        int l = indx, r = N;
        while(l < r) {
            int mid = l + (r - l) / 2;
            if((prefix[mid] | prefix[indx-1]) >= val) {
                r = mid;
            } else {
                l = mid + 1;
            }
        }
        if((prefix[l] | prefix[indx-1]) >= val) {
            result.push_back(l);
        } else {
            result.push_back(-1);
        }
    }
    return result;
}

Minimum length OR
Google step ✅

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

int longestPalinSub(string st) {
    int N = st.length();
    vector<int> hash1(256, 0);
    for(int i = 0; i < N; i++) {
        hash1[st[i]]++;
    }
    string res1 = "", res2 = "";
    for(int i = 0; i < 256; i++) {
        for(int j = 0; j < hash1[i] / 2; j++) {
            res1 += char(i);
        }
        for(int j = (hash1[i] + 1) / 2; j < hash1[i]; j++) {
            res2 += char(i);
        }
    }
    reverse(res2.begin(), res2.end());
    bool f = false;
    for(int i = 0; i < 256; i++) {
        if(hash1[i] % 2) {
            if(!f) {
                res1 += char(i);
                f = true;
            }
        }
    }
    return (res1.size() + res2.size());
}

A longest palindromic subsequence ✅

Google Step

Role: Software Development Internship at
Company: Occult gurukul
Batch: 2025, 2026, 2027
Apply link : https://unstop.com/o/NSRXjCL?lb=lo3iZQv&utm_medium=Share&utm_source=shortUrl

Keysight  | Software QA Engineer | Gurugram

Experience  : Freshers(2023/2024)/Experienced

Apply @ Keysight
https://jobs.keysight.com/job/Gurugram-Software-QA-Engineer-4/1116323400/

Company: HireQuotient

Role:  AI intern

Expected CTC: 50K - 60K PM

Batch Eligible: Any

Website: https://www.linkedin.com/feed/update/urn:li:activity:7151543513883496449/

Company: Affworld

Role:  MERN Stack Developer Intern

Expected CTC: NA

Batch Eligible: Any

Website: https://docs.google.com/forms/d/e/1FAIpQLSch_nwWb4KGzZP7gvdS-FSS7kxXHofrvI2YncJK6GPmSkzDwg/viewform

Substring minimization
Netcore ✅

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/