vector<int> solve(int N, const vector<vector<int>>& A, const vector<vector<int>>& queries) {
    vector<int> results;
    results.reserve(queries.size());

    for (const auto& query : queries) {
        int l = query[0];
        int r = query[1];
        int x = query[2];
        int count = 0;

        for (int i = l - 1; i < r; ++i) {
            if (A[i][1] > x) {
                ++count;
            }
        }

        results.push_back(count);
    }

    return results;
}

//Partial 6/10

Tax Payment ✅

def PowerLimit(a, b):
  current_resource, max_seconds = 1, 0
  while a > 0 and b > 0:
    if a > b:
      current_resource, a, b = 1, a - 2, b + 1
    else:
      current_resource, b, a = 2, b - 2, a + 1
    max_seconds += 1
  max_seconds += a // 2 if current_resource == 1 else b // 2
  return max_seconds

power limit ✅

long long OneBlock(int N, vector<int> Arr) {
    vector<int> one_indices;
    for (int i = 0; i < N; ++i) {
        if (Arr[i] == 1) {
            one_indices.push_back(i);
        }
    }

    if (one_indices.size() <= 1) {
        return 1;
    }

    long long ways = 1;
    for (int i = 1; i < one_indices.size(); ++i) {
        int zeros_between_ones = one_indices[i] - one_indices[i - 1] - 1;
        ways *= (zeros_between_ones + 1);
    }

    return ways;
}

//one block

string solve(int n, string op[]) {
    stack<string> bs, fs;
    bs.push("/home");

    for(int i = 0; i < n; i++) {
        if(op[i] == "back") {
            if(bs.size() > 1) {
                fs.push(bs.top());
                bs.pop();
            }
        } else if(op[i] == "forward") {
            if(!fs.empty()) {
                bs.push(fs.top());
                fs.pop();
            }
        } else {
            while(!fs.empty()) {
                fs.pop();
            }
            bs.push(bs.top() + "/" + op[i]);
        }
    }

    return bs.top();
}

Browser history ✅

int main() {
    int N;
    cin >> N;
    vector<pair<int, int>> p(N);
    for(int i = 0; i < N; i++)
        cin >> p[i].first >> p[i].second;

    ll wt = 0, ct = 0;
    for(int i = 0; i < N) {
        if(p[i].first > ct) {
            ct = p[i].first;
        }
        wt += ct + p[i].second - p[i].first;
        ct += p[i].second;
    }
    cout << wt / N << endl;
    return 0;
}

Doctor ✅

def solveLC(key, text):
    def check(key, subt):
        res = []
        for i, (a,b) in enumerate(zip(key, subt)):
            if a != b:
                res.append(i)
        if len(res) == 1 or len(res) > 2:
            return False
        if not res: return True
        if res[0] + 1 != res[1]: return False
        i = res[0]
        return key[i:i+2] == subt[i:i+2][::-1]
    res = 0
    for i in range(len(text) - len(key) + 1):
        if check(key, text[i:i+len(key)]):
            res += 1
    return res
print(solveLC("moon","monomon"))
print(solveLC("aaa","aaaa"))

Amazon ✅

vector<string> solve (const string &s, char d) {
  vector<string> r;
  stringstream ss (s);
  string i;
  while (getline (ss, i, d)) {
    r.push_back (i);
  }
  return r;
}

void hola(const string &u, int N, const vector<string> &p, const vector<int> &v) {
  vector<string> pts = solve (u, '?');
  if (pts.size () != 2) {
    cout << "Invalid URL" << endl;
    return;
  }
  string b = pts[0];
  string q = pts[1];

  vector<string> qp = solve (q, '.');
  if (qp.size () > N) {
    cout << "Too many parameters" << endl;
    return;
  }

  map<string, int> qm;
  for (const string &q : qp) {
    vector<string> qps = solve (q, '=');
    if (qps.size () != 2) {
      cout << "Invalid parameter format" << endl;
      return;
    }
    string k = qps[0];
    int v = stoi (qps[1]);
    qm[k] = v;
  }

  cout << b << endl;

  bool valid = true;
  int c = 0;
  for (int i = 0; i < N; i++) {
    string pm = p[i];
    int rv = v[i];
    if (qm.count (pm) == 0) continue;
    c++;
    if (qm[pm] > rv) valid = false;
  }

  cout << c << endl;

  for (int i = 0; i < N; i++) {
    string pm = p[i];
    if (qm.count (pm) == 0) continue;
    cout << pm << " " << qm[pm] << endl;
  }

  if (valid) cout << "200" << endl;
  else cout << "404" << endl;
}

URL Checking ✅

DNCL Technologies Walk in Drive for Freshers or Experienced

Job Role:
"Embedded Hardware Engineer"
"Embedded Software Developer"

Company Website: www.Dncltech.com

Qualification: Engineering Degree (EEE, ECE)

Experience: Freshers or 3+ Experience

Job Location: Bangalore

Walk In Date: 2nd February 2024

Share Resumes at Satheespandi@dncltech.com

We are hiring for Embedded Engineer, it's a permanent position with Mempage Technologies
 
Skills: C, C++, Linux, Embedded C, Wlan, Wifi.
Passed out Year - 2015-2019
Work location #WFO #hyderabad
Notice Period- Immediate to 10Days Joiners
 
Interested email their CVs to "kavitha@mempagetech.com"

Need Mechanical & EEE - Engineering candidates from 2023 passed out batch (Tamil Nadu candidates are the most preferred). Immediate joiners required.

• Company Name: TVS TS client
• Work location: Chennai
• Interview location: Chennai
• Interview mode: Face to Face only
• Job roll: Graduate Engineering Trainee (GET)
• Salary: 2.87 lakh CTC

Interested students are requested to share their updated resume to nobel@tvsts.com or WhatsApp. 9677760882

Company Name : Zocket
Role : UI/UX Internship

Link : https://zocket.keka.com/careers/applyjob/50625

❗️Harmonic Off Campus Drive 2024 for Associate Software Engineer | 4 LPA*❗️

👨‍💻 Job Role : Associate Software Engineer
🎓Qualification : B.E/B.Tech
🎖Batch : 2023
💰Salary : 4 LPA*

⭕️ Apply Fast :  

https://jobs.jobvite.com/harmonic/job/okzUqfwX?nl=1&fr=true

Company Name: Zoho

Role: Software Developer

Batch eligible: 2022, 2023 and 2024 passouts

Apply: https://careers.zohocorp.com/forms/fcc89b5ebd373d598e0224d10f2199d1a8839a1914d1ba3a141e0b0ddcfcfc32

Company – Optum
Role – Data Analyst
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3816603941


Company – Prodigy Recruitment Consultants
Role – Data Scientist
Exp. – 0-5 yrs
Apply Here – https://www.naukri.com/job-listings-data-scientist-chennai-prodigy-recruitment-consultants-chennai-tamil-nadu-0-to-5-years-280124000025?src=sortby&sid=17065084099779743_1&xp=5&px=1&nignbevent_src=jobsearchDeskGNB

Company – Creative Hands HR
Role – Data Analytic
Exp. – 0-4 yrs
Apply Here – https://www.naukri.com/job-listings-data-analytic-fresher-business-analytics-creative-hands-hr-kolkata-mumbai-maharashtra-hyderabad-secunderabad-ranchi-jharkhand-chennai-bangalore-bengaluru-0-to-4-years-020124003015?src=sortby&sid=17065084099779743_1&xp=4&px=1&nignbevent_src=jobsearchDeskGNB

Company – Bluo Software India LLP
Role – Data Engineer
Exp. – 0-2 yrs
Apply Here – https://www.linkedin.com/jobs/view/3815436763


Company – Zonka Technologies Pvt. Ltd.
Role – AI Intern
Exp. – Fresher
Apply Here – https://www.naukri.com/job-listings-ai-intern-zonka-technologies-pvt-ltd-gurugram-haryana-0-to-1-years-290124001017?src=sortby&sid=17065084099779743_1&xp=1&px=1&nignbevent_src=jobsearchDeskGNB

Company – PSG Institute of Technology and Applied Research
Role – Data analyst Intern
Exp. – Fresher
Apply Here – https://www.simplyhired.co.in/job/AAmy0Er4ncvWwDCSPDtbLKxUFfdSTSPRud5KnIAcHnc3DUQR8vluSQ

Company – GoMechanic
Role – Data Analytics Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-analytics-internship-in-gurgaon-at-gomechanic1706509012?utm_source=cp_link&referral=web_share

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

👉 👉 Cadence | Software Engineering Intern | Noida

EXPERIENCE  : Freshers

APPLY @ Cadence
https://cadence.wd1.myworkdayjobs.com/en-US/External_Careers/job/NOIDA/Intern-Software-Engineering_R45099