๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
verSe Innovation is hiring for Associate Software Engineer (2023 and 2024 grads)

Job Description:

- Strong grasp of core Java concepts
- Understanding of object-oriented programming principles
- Knowledge of data structures and algorithms
- Excellent problem-solving abilities
- Bachelor's degree in Computer Science or related field
- Bonus: Familiarity with data science models

If interested, send your resume to TA@verse.in
Internship Opportunity for MBA/PGDM Freshers(HR) Tech Mahindra Ltd Pune

Role- HR Operations & Talent Acquisition

Eligibility- Candidate should be pursuing MBA or PGDM

Location - Hinjewadi Phase 3 Plot(Both way cab facility)

Note- Candidate located near office location shall be preferred

Interested candidates can share resume on - mj00642401@techmahindra.com
๐Ÿ‘1
Fasal Hiring Alert: Software Development Interns!

Role: Software Development Intern
Batch Eligible: 2024 and 2025 grads
Duration: 6 months full-time (minimum)
Stipend: Rs. 25,000/month
CTC Post Conversion: 6-8 LPA
Location: Bengaluru (Hybrid work model, work from office 3 days a week)

Requirements:
Strong programming skills
Passion for technology and innovation Ability to work in a team environment
Eagerness to learn and adapt

How to Apply:
Send your resume and a brief cover letter detailing your interest and experience to jobs@wolkus.com
โค1
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Request {
    string id;
    string start_time;
    string end_time;
};

bool compare(Request a, Request b) {
    return a.start_time < b.start_time;
}

int solve(int N,vector<vector<string>>R)
{  
    vector<Request>requests(N);
    for(int i=0;i<N;i++)
    {
        requests[i].id=R[i][0];
        requests[i].start_time=R[i][1];
        requests[i].end_time=R[i][2];
    }
    sort(requests.begin(), requests.end(), compare);
    int max_concurrent = 0;
    int current_concurrent = 0;
    string current_end_time = "00:00:00";

    for (Request request : requests) {
        if (request.start_time >= current_end_time) {
            current_concurrent--;
        } else {
            current_concurrent++;
            if (current_concurrent > max_concurrent) {
                max_concurrent = current_concurrent;
            }
        }
        if (request.end_time > current_end_time) {
            current_end_time = request.end_time;
        }
    }

    return max_concurrent;
}
signed main()
{
    int n; cin>>n;
    vector<vector<string>>r(n,vector<string>(3));
    for(int i=0;i<n;i++)
    {
       for(int j=0;j<3;j++) cin>>r[i][j];
    }
    cout<<solve(n,r);
}

Partitioning Serverโœ