๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.7K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
long long mpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1)res = res * a;
    a = a * a;
    b /= 2;
  }
  return res;
}

int solve(vector<int>arr, int x, int y)
{

  int n = arr.size();
  sort(arr.begin(), arr.end(), greater<int>());
  long long tot = 0;
  for (long long i = 0; i < (1 << n); ++i)
  {
    long long ext = 0;
    long long res = 0;
    for (long long j = 0; j < n; ++j)
    {
      if ((i & (1 << j))) {
        res += (arr[j] * mpow(2, ext));

        ext++;
      }
    }
    if (res <= x) {
      long long fres = 0;
      for (long long j = 0; j < n; ++j)
      {
        if ((i & (1 << j))) {
          fres += (arr[j] * mpow(2, y));

        }
      }
      tot = max(tot, fres);
    }

  }
  return tot;
}

Ron's real estate
Tata Mg
#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
๐Ÿ“ŒAscendeum is hiring for Assistant Frontend Engineer - Remote
Experience: 0 - 1 year's
Expected Salary: 10-20 LPA
Apply here:
https://forms.teamlink.com/60

๐Ÿ“ŒPinnacle Infotech is hiring for Software Engineer
Experience: 0 - 1 year's
Expected Salary: 5-8 LPA
Apply here:
https://www.linkedin.com/jobs/view/4067402858/?alternateChannel=search

๐Ÿ“ŒSingleStore is hiring for Softwar Engineer (C/C++)
Experience: 0 - 1 year's
Expected Salary: 20-30 LPA
Apply here:
https://boards.greenhouse.io/singlestore/jobs/6374262

๐Ÿ“ŒFirst Advantage is hiring for Associate Software Engineer
Experience: 0 - 1 year's
Expected Salary: 3-6 LPA
Apply here:
https://www.linkedin.com/jobs/view/4022036524/?alternateChannel=search-engineer
๐Ÿ“Œ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
๐Ÿ“Œ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
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
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 โœ…
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 โœ