๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K 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
๐Ÿ“Œ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
๐Ÿ‘1
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 โœ…
๐Ÿ‘1
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 โœ…
๐Ÿคฎ2
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 โœ…
๐Ÿ‘2
SELECT 
    empld,
    department,
    performance_rating
FROM
    Permanent
WHERE
    experience >= 5
    AND performance_rating > 85

UNION

SELECT
    empld,
    department,
    performance_rating
FROM
    Contractual
WHERE
    contract_duration >= 12
    AND performance_rating > 90

ORDER BY
    empld;

Annual salary
Meesho โœ…
WITH AvailableRooms AS (
    SELECT roomId, viewType
    FROM Rooms
    WHERE availability = 'Available'
)

SELECT g.guestId, g.name, r.roomId
FROM Guests g
JOIN AvailableRooms r
ON g.viewPreference = r.viewType
ORDER BY g.guestId, r.roomId

Hotel room allocation
Meesho โœ…
SELECT COUNT(DISTINCT ts.rollno) AS Pending
FROM TotalStudents ts
LEFT JOIN offcampus oc ON ts.rollno = oc.rollno AND oc.approved = 'NO'
LEFT JOIN oncampus oncamp ON ts.rollno = oncamp.rollno
LEFT JOIN PG pg ON ts.rollno = pg.rollno
WHERE ts.percentage > 65
  AND ts.backlog = 'NO'
  AND oncamp.rollno IS NULL
  AND pg.rollno IS NULL
  AND oc.rollno IS NOT NULL;

yet to be placed
Meesho โœ…
๐Ÿคฎ1
from typing import List
def findMissingOperationIndex(ops: List[str], missingOp: str, currentTop: int) -> int:
    n = len(ops)
    def simulate_stack(ops_with_insert: List[str]) -> int:
        stack = []
        for op in ops_with_insert:
            if op.startswith("PUSH"):
                _, x = op.split()
                stack.append(int(x))
            elif op == "POP":
                if stack:
                    stack.pop()
        return stack[-1] if stack else None
    for i in range(n + 1):
        ops_with_insert = ops[:i] + [missingOp] + ops[i:]
        final_top = simulate_stack(ops_with_insert)
        if final_top == currentTop:
            return i
    return -1


Plum โœ