Momentum is hiring Founding Engineer and Interns

For 2025, 2024, 2023, 2022 grads

https://momentumsh.notion.site/Founding-engineer-9bdca435fda140778ef189675c3c8b5b?pvs=4

LinkedIn post - https://www.linkedin.com/posts/aditi-kothari_at-momentum-we-are-opening-a-role-for-our-activity-7194007604635787265-2xBJ

Ellenox is hiring Full Stack Engineer Intern

For 2024, 2025 grads

Check out this job at Ellenox: https://www.linkedin.com/jobs/view/3917297213

cpp 
#include <iostream> 
#include <vector> 
#include <unordered_map> 
#include <algorithm> 
#include <sstream> 

using namespace std; 

bool isValidDate(const string& date) { 
    if (date.size() != 10) return false; 
    if (date[4] != '-' || date[7] != '-') return false; 

    int year = stoi(date.substr(0, 4)); 
    int month = stoi(date.substr(5, 2)); 
    int day = stoi(date.substr(8, 2)); 

    if (month < 1 || month > 12) return false; 

    // Adjusting for different days in different months 
    int maxDays = 31; 
    if (month == 4 || month == 6 || month == 9 || month == 11) { 
        maxDays = 30; 
    } else if (month == 2) { 
        if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)) { 
            maxDays = 29; 
        } else { 
            maxDays = 28; 
        } 
    } 

    if (day < 1 || day > maxDays) return false; 

    return true; 
} 

bool isValidTime(const string& time) { 
    if (time.size() != 8) return false; 
    if (time[2] != ':' || time[5] != ':') return false; 
    int hours = stoi(time.substr(0, 2)); 
    int minutes = stoi(time.substr(3, 2)); 
    int seconds = stoi(time.substr(6, 2)); 
    if (hours < 0 || hours >= 24) return false; 
    if (minutes < 0 || minutes >= 60) return false; 
    if (seconds < 0 || seconds >= 60) return false; 
    return true; 
} 

vector<vector<string>> countUserLogins(vector<vector<string>> logs) { 
    unordered_map<string, unordered_map<string, int>> loginCounts; 

    for (const auto& log : logs) { 
        if (log.size() != 3 || !isValidDate(log[2]) || !isValidTime(log[1])) 
            continue; 
        loginCounts[log[0]][log[2]]++; 
    } 

    vector<vector<string>> result; 
    for (const auto& user : loginCounts) { 
        for (const auto& date : user.second) { 
            result.push_back({user.first, date.first, to_string(date.second)}); 
        } 
    } 

    sort(result.begin(), result.end(), [](const auto& a, const auto& b) { 
        if (a[0] != b[0]) return a[0] < b[0]; 
        if (a[1] != b[1]) return a[1] < b[1]; 
        return false; 
    }); 

    return result; 
} 


}

Count User logins ✅

X, Y, Z = map(int, input().split())
max_sum = max(X + Y, Y + Z, X + Z)
print(max_sum)

Trio ✅

#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 7;

long long solution(int n, vector<long long>& a, vector<long long>& b) {
    long long ans = 0;

    int minP = min_element(a.begin(), a.end()) - a.begin();
    int minQ = min_element(b.begin(), b.end()) - b.begin();

    for (int i = 0; i < n; i++) {
        if (i == minP || i == minQ)
            continue;

        ans += min(a[minP] * b[i], b[minQ] * a[i]);
        ans %= MOD;
    }

    if (minP != minQ) {
        ans += a[minP] * b[minQ];
        ans %= MOD;
    }

    return ans;
}.

professor code
Uber ✅

#include<bits/stdc++.h>
using namespace std;
string str, bad_string;
struct node{
    bool end_mark;
    node *next[10];
    node()
    {
        end_mark = false;
        for(int i = 0; i<10; i++)
            next[i] = NULL;
    }
}*root;
bool add(string s)
{
    node *current = root;
    for(int i = 0; i<s.size(); i++)
    {
        int nw = s[i] - 'a';
        if(i == (s.size()-1) && current->next[nw] != NULL)
            return false;
        if(current->next[nw] == NULL)
            current->next[nw] = new node();
        current = current->next[nw];
        if(current->end_mark)
            return false;
    }
    current->end_mark = true;
    return true;
}

int main()
{
    int i, N;
    bool ok = true;
    cin >> N;
    root = new node();
    for(i = 1; i<=N; i++)
    {
        cin >> str;
        if(!ok)
            continue;
        ok = add(str);
        if(!ok)
            bad_string = str;
    }
    if(ok)
        printf("GOOD SET\n");
    else
    {
        printf("BAD SET\n");
        cout << bad_string << endl;
    }
}

Good Bad String
Uber ✅

#include<bits/stdc++.h>
using namespace std;

int main() {
    int n,c,d ;
    cin>>n>>c>>d ;
    int b[n],p[n],t[n] ;
    for(int i=0;i<n;i++)
        cin>>b[i]>>p[i]>>t[i] ;
    vector<pair<int,int>>type_0,type_1 ;
    for(int i=0;i<n;i++)
    {
        if(t[i]==0)
        {
            type_0.push_back({p[i],b[i]}) ;
        }
        else
        {
            type_1.push_back({p[i],b[i]}) ;
        }
    }
    sort(type_0.begin(),type_0.end()) ;
    sort(type_1.begin(),type_1.end()) ;
    // One using coins and one using diamonds
    int max_0=0,max_1=0 ;
    int x=type_0.size() ;
    int y=type_1.size() ;
    for(int i=0;i<x;i++)
    {
        if(type_0[i].first<=c)
            max_0=max(max_0,type_0[i].second) ;
    }
    for(int i=0;i<y;i++)
    {
        if(type_1[i].first<=d)
            max_1=max(max_1,type_1[i].second) ;
    }
    int ans=0 ;
    if(max_0&&max_1)
        ans=max(ans,max_0+max_1) ;  
    // Both using coins
    multiset<int>m;                        
    for(int i=0;i<x;i++)
    {
       m.insert(type_0[i].second) ;
    }
    int j=type_0.size()-1 ;
    for(int i=0;i<x;i++)
    {
        if(j<=i)
            break ;
        auto it=m.find(type_0[i].second) ;
        m.erase(it) ;
        int flag=0 ;   
        while(j>i)
        {
            if(type_0[j].first+type_0[i].first<=c)
            {
                flag=1 ;
                break ;
            }
            auto it=m.find(type_0[j].second) ;
            m.erase(it) ;
            j-- ;
        }
        if(flag==0)
            break ;
        if(m.size())
        ans=max(ans,type_0[i].second+*m.rbegin()) ;  
    }
    // Both using diamonds
    m.clear() ;
    for(int i=0;i<y;i++)
    {
       m.insert(type_1[i].second) ;
    }
     j=type_1.size()-1 ;
    for(int i=0;i<y;i++)
    {
        if(j<=i)
            break ;
        auto it=m.find(type_1[i].second) ;
        m.erase(it) ;
        int flag=0 ;
        while(j>i)
        {
            if(type_1[j].first+type_1[i].first<=d)
            {
                flag=1 ;
                break ;
            }
            auto it=m.find(type_1[j].second) ;
            m.erase(it) ;
            j-- ;
        }
        if(flag==0)
            break ;
        if(m.size())
        ans=max(ans,type_1[i].second+*m.rbegin()) ;
    }
    cout<<ans<<"\n" ;
    return 0;
}

Uber ✅

Good set Bad set ✅
Uber

Uber ✅

Professor Code
Uber ✅

Accenture Code 1✅

Changing to lowercase
Accenture Code 2✅

Hiringalert !
Job openings for Administration Executive profile,

MBA Fresher with specialisation in Finance and Marketing

Location -Greater Noida (WFO)

Skills- Tally, Advance Excel etc.

Interested candidates can share cv on career@pharmazz.com

Perfect Walk
Uber ✅