#include <iostream>
#include <vector>
using namespace std;
void countFormulas(int N, int start, vector<int>& current, int& count) {
    if (N == 0) {
        count++;
        return;
    }
    for (int i = start; i <= 26; i++) {
        int mass = i; 
        if (mass > N) {
            break;
        }
        countFormulas(N - mass, i + 1, current, count);
        if (N >= 2 * mass) {
            countFormulas(N - 2 * mass, i + 1, current, count);
        }
    }
}
int getChemicalFormulaCount(int N) {
    int count = 0;
    vector<int> current;
    countFormulas(N, 1, current, count);
    return count;
}

Chemical formula ✅
Tata Mg

Company Name : Rubrik
Batch : 2025 passouts
Role : Software Engineering Internship - Winter 6 months

Link : https://www.rubrik.com/company/careers/departments/job.6195381?gh_jid=6195381&gh_src=2e352a8a1us

Contact
Nandhini - 9150014165
Divya - 9043337568

Send your CV at: hr@trioangle.com

📌Aminurmus Technology is hiring

Multiple Roles:
- SDE ( Intern/Fulltime)
- Reactjs Developer ( Intern/Fulltime)
- Dot net Developer (Intern/ Fulltime)
- Mern Stack Developer (Intern/Fulltime)
- Figma Developer Intern
- Fullstack Developer (Intern/Fulltime)
- Data Analysis
- Android Developer

Remote Opportunity

Batch: First year to Final Year

💻Apply: https://aminurmus.com/career

Use Referral Mail Id:
rupam.bernwal@aminurmus.com

📌Java Intern
Experience: 0-1 Years
Notice Period: Immediate
Education: B.Tech
Interested can share CV on sikha@daiviktech.com

📌Travancore Analytics is looking for trained BTech Freshers to join our team!

📝 Who We're Looking For:
Fresh BTech graduates (2022/2023 pass-outs)
- No Active Backlogs

Technologies: iOS, Android,.Net/Net Full stack

📍Location: Trivandrum, Cochin and Mysore
please email akhil.ap@travancoreanalytics.com

EY Hiring 2024 Batch

https://www.linkedin.com/posts/adhavanxavier_excitingjobopportunityforfreshers2024-freshers-activity-7259921483810918400-lynq?

Greetings from Sstudize,

I hope this message finds you well! Sstudize is an Ed-Tech startup working on enhancing personalised learning for Engineering Entrance Exams using Generative AI/LLMs. 🌐

As we grow, we're looking for passionate, driven students like YOU to join us on this exciting journey! 🚀

We're currently offering internships in the following area:

* 1. *LLM Interns 🤖
-Assist in developing and fine-tuning AI models
   - Contribute to the integration of AI in our learning platform
   - Explore innovative applications of AI in education
   Apply here:
https://bit.ly/AIInternshipForm

Duration: 3 months
*Location: Remote
Stipend based role

Poolit is hiring Front-end Developer

For 2023, 2024 grads
Location: Remote(Delhi)

https://wellfound.com/jobs/80848-front-end-developer

Wells Fargo is hiring Software Engineer

For 2021, 2022 grads
Location: Bangalore

https://www.wellsfargojobs.com/en/jobs/r-397764/software-engineer/

def stemmer(text):
    words = text.split() 
    result = []
    for word in words:
        if word.endswith('ed'):
            word = word[:-2]
        elif word.endswith('ly'):
            word = word[:-2]
        elif word.endswith('ing'):
            word = word[:-3]
        if len(word) > 8:
            word = word[:8]
        result.append(word)
    return ' '.join(result)

Suffle stripping Stemmer ✅

import math
def rooter():
    while True:
        x = (yield)
        yield math.isqrt(x)  

def squarer():
    while True:
        x = (yield)
        yield x * x

def accumulator():
    total = 0
    while True:
        x = (yield)
        total += x
        yield total

Square accumulate root ✅

Home - EY GDS Technology Hiring Event
https://web.cvent.com/event/bc29f102-84bb-451e-b9d3-94056ad20c44

Last Date :15 Nov

int countK(vector<int> rank,int n,int k){
    int res = 0,curSum=0;
   
    unordered_map<int,int> mp;
   
    for(int i=0;i<n;i++){
       curSum += (rank[i]-k);
       if(curSum == 0) res++;
      
       if(mp.find(curSum) != mp.end()){
           res += mp[curSum];
       }
       mp[curSum]++;
    }
return res;
}


vector<int> getMeanRankCount(vector<int> rank){
    int n = rank.size();
   
    vector<int> ans;
   
    for(int i=1;i<=n;i++){
        ans.push_back(countK(rank,n,i));
    }
return ans;
}

Amazon ✅