int isGoodString(string s) {
    int vowels = 0, consonants = 0;
    for (char c : s) {
        if (isalpha(c)) {
            if (c == 'a' c == 'e' c == 'i' c == 'o' c == 'u') {
                vowels++;
            } else {
                consonants++;
            }
        }
    }
    return vowels > consonants ? 1 : 0;
}

int sumOfDigits(string s) {
    int sum = 0;
    for (char c : s) {
        if (isdigit(c)) {
            sum += c - '0';
        }
    }
    return sum;
}

C: Play with string ✅

Company name: StoneX

Role: ✨Intern ✨

Expected Stipend: 30K-50K per month

Location: Pune

Apply here: https://english-stonex.icims.com/jobs/9816/job?mobile=false&width=1136&height=500&bga=true&needsRedirect=false&jan1offset=330&jun1offset=330

int minimumEnergy(vector<string> river, int initial_x, int initial_y, int final_x, int final_y) {
    int ans=-1;
    // int answer=INT_MAX;
    int n=river.size();
    int m=river[0].size();
    int dr[4]={0,0,1,-1};
    int dc[4]={1,-1,0,0};
    vector<vector<bool>> visited(n, vector<bool>(m, false));
    queue<pair<pair<int,int>,int>> q;
    q.push({{initial_x, initial_y},0});
    visited[initial_x][initial_y]=true;
    while(!q.empty()){
        int size=q.size();
        for(int i=0;i<size;i++){   
            auto temp=q.front();
            int x=temp.first.first;
            int y=temp.first.second;
            int energy=temp.second;
            q.pop();
            if(x==final_x and y==final_y){
                return energy;
            }
            for(int j=0;j<4;j++){
                int nx=x+dr[j];
                int ny=y+dc[j];
                if(nx>=0 and nx<n and ny>=0 and ny<m and visited[nx][ny]==0 and river[nx][ny]=='.'){
                    if(j%2==1){
                        visited[nx][ny]=1;
                        q.push({{nx,ny}, energy+1});
                    }
                    else{
                        visited[nx][ny]=1;
                        q.push({{nx,ny}, energy});
                    }
                }
            }
        }
       
    }
    return -1;
}

Swimming ✅

3 companies are hiring, Payglocal, Finanvo and TruScholar

Batch eligible: 2022, 2023, 2024 and 2025 passouts

Apply: https://bit.ly/46J1jIT

Swiggy is hiring for Associate Software Development Engineer

Batch eligible: 2022 and 2023 passouts

Apply: https://docs.google.com/forms/d/e/1FAIpQLSeI73H4qHGbTnWsNOtYRNA4cn5fOFJmnN-oo3ng6hqSndqaZA/viewform

JD: https://docs.google.com/document/d/1QXhfrxi39Zt3usEOp1OijNSGuHf0RhvVdDHn9DMmT8M/mobilebasic#heading=h.gc9bfaz8780n

def solve(arr):
    n = len(arr)
    i = 0
   
    while i + 1 < n and arr[i] < arr[i + 1]:
        i += 1
    while i + 1 < n and arr[i] == arr[i + 1]:
        i += 1
    while i + 1 < n and arr[i] > arr[i + 1]:
        i += 1

    if i == n - 1:
        print("YES")
    else:
        print("NO")

Python 3✅
Equivalent Array

Equivalent Array ✅

Scientific Software Developer

Employment Type: Full-time

Eligibility: Passing years 2021, 2022, and 2023 graduates with B.E./B.Tech or M.E./M.Tech degrees in Computer/IT/Mechanical stream only

Salary: 5 LPA*

Location: Pune (in-office)

Preferred Tech Stack: C, C++

Interview Stages:

Coding Round: Evaluate your problem-solving abilities and coding expertise.

Technical Round 1: Assess your technical proficiency in the preferred tech stack (C, C++).

Technical Round 2: Further delve into your technical knowledge and understanding of scientific principles.

Director Round (Technical & Managerial): Comprehensive evaluation by our director to assess both technical and managerial competencies.

This is an excellent opportunity for fresh graduates to kickstart their careers in a dynamic and innovative work environment. Please provide the information of the students who are interested by filling out the Excel link below. Additionally, ensure that you include their resumes in a separate folder.

https://docs.google.com/spreadsheets/u/0/d/1DusSzmPHuQsIm7L6hAICbQzcniu0vYuAnKYiKeL2cIM/htmlview

Please find attached the Job Descriptions (JD) along with detailed information about our company. The JD outlines the responsibilities, qualifications, and other relevant details for the role.

If there are any specific procedures or protocols to follow in sharing this opportunity with your students, please let us know, and we will be happy to comply.

Thank you for your cooperation, and we look forward to identifying bright talents from your esteemed institution.

drive address -
Centre for Computational Technologies - CCTech
Office 403 | Pushpak Business Hub | Wakad | Pune | 411057 | India
www.cctech.co.in  | CCTech – "Transforming human life by democratization of technology"

if you are eligible share your eligible so share your CV what's app number - 7440804151 mention your full name, off campus drive...
note - share your before CV 11am ( 6/12/23).

Company Name: Tower Research Capital

Role: ML Engineering Intern

Batch eligible: 2024 passouts

Apply: https://www.tower-research.com/open-positions/?gh_jid=5546199

2023/2022

If interested, apply from here: https://docs.google.com/forms/d/e/1FAIpQLSfMb2TWkWpim_7OeovJ0ULjGHLXTclP3lWVCHtj8pPugnHDVg/viewform

Company Name: Eagleview

Role: Software Engineer 1

Batch eligible: 2022 and 2023 passouts

Apply: https://bit.ly/488e697

#include <iostream>
#include <unordered_map>
#include <string>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;
    cin.ignore(); // Consume the newline after the integer input

    unordered_map<string, int> hashtagCount;

    // Read n events
    for (int i = 0; i < n; ++i) {
        string line;
        getline(cin, line);

        size_t hashtagStart = line.find('#');
        if (hashtagStart != string::npos) {
            size_t delimiterStart = line.find(" || ", hashtagStart);
            if (delimiterStart != string::npos) {
                string hashtag = line.substr(hashtagStart, delimiterStart - hashtagStart);

                // Increment the count of the hashtag
                hashtagCount[hashtag]++;
            }
        }
    }

    // Finding the most frequent hashtag
    string mostFrequentHashtag;
    int maxCount = 0;

    for (const auto& entry : hashtagCount) {
        if (entry.second > maxCount) {
            mostFrequentHashtag = entry.first;
            maxCount = entry.second;
        }
    }

    cout << mostFrequentHashtag << endl;

    return 0;
}

Hashtag
C++✅
Wayfair

string solve(vector<string> arr){
    int n=arr.size();
    map<string,set<string>> mp;
    for(auto x:arr){
        // AliceBobkisi||
        string temp="";
        vector<string> v;
        for(int i=0;i<x.size();i++){
            if(x[i]=='|'){
                v.push_back(temp);
                i++;
                temp="";
            }
            else{
                temp+=x[i];
            }
        }
        v.push_back(temp);
        v.pop_back();
        if(v.back().size()){
            mp[v[0]].insert(v.back());
        }
    }
    int maxi=0;
    for(auto x:mp){
        maxi=max(maxi,(int)x.second.size());
    }
    if(maxi==0){
        return "None";
    }
    else{
        for(auto x:mp){
            if(x.second.size()==maxi){
                return x.first;
            }
        }
    }
}

Hashtag code ✅

Max follower count ✅
Wayfair

def mowgliDoors(S):
    count = int(S[0] == '0')
   
    for i in range(1, len(S)):
        if S[i] != S[i - 1]:
            count += 1
   
    return count

test_cases = ['111', '010', '10011']
for test_case in test_cases:
    result = mowgliDoors(test_case)
    print(result)

Mogali ✅