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

#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✅

CryptoXpress Hiring Software Developer -Fresher
https://www.linkedin.com/jobs/view/3931469882

Graduate Program 2024 at Morse Micro

Eligibility: Fresh Graduates or 1-2 YOE
Duration: 6 Months
Applications are open now and close on June 28, 2024.
https://www.morsemicro.com/jobs?gh_jid=7460302002

SDE Intern at Spikewell
Onsite: Bhubaneswar

Stipend: 10K
Eligibility: B-tech in CSE & IT/BCA/MCA passed out in 2024.
Duration : 1 yr

NOTE: I would recommend only apply if you live nearby and don't have any other offers right now.
https://spikewell.zohorecruit.in/jobs/Careers/62862000004397001/SDE-Intern

#include <vector>
#include <map>
#include <iostream>
using namespace std;
vector<int> getCacheSize(vector<vector<int>> data, vector<int> queries) {
    int n = data.size();
    int q = queries.size();
    map<int, int> endTimeMap;
    for (auto& d : data) {
        endTimeMap[d[0]] = d[0] + d[1];
    }
    vector<int> result;
    for (int query : queries) {
        int cacheSize = 0;
        for (auto& it : endTimeMap) {
            if (it.first <= query && query <= it.second) {
                cacheSize++;
            }
        }
       
        result.push_back(cacheSize);
    }
   
    return result;
}

ION✅

#include <vector>
#include <map>
#include <iostream>
using namespace std;
vector<int> getCacheSize(vector<vector<int>> data, vector<int> queries) {
    int n = data.size();
    int q = queries.size();
    map<int, int> endTimeMap;
    for (auto& d : data) {
        endTimeMap[d[0]] = d[0] + d[1];
    }
    vector<int> result;
    for (int query : queries) {
        int cacheSize = 0;
        for (auto& it : endTimeMap) {
            if (it.first <= query && query <= it.second) {
                cacheSize++;
            }
        }
       
        result.push_back(cacheSize);
    }
   
    return result;
}

ION ✅

#include <vector>
#include <utility>

using namespace std;

class Solution {
public:
    vector<int> cached(vector<vector<int>>& data, vector<int>& q) {
        int n = data.size();
        vector<int> res(2, 0);
        int cnt = 0;
        for(int i = 0; i < n; i++) {
            pair<int, int> p;
            p.first = data[i][0];
            p.second = data[i][0] + data[i][1];
            for(int j = 0; j < q.size(); j++) {
                if (p.first >= q[j] && p.second >= q[j])
                    cnt++;
            }
        }
        res[0] = n;
        res[1] = cnt;
        return res;
    }
};

ION✅

import java.util.*;
public class Main
{
    public static int getMinimumHealth(int[] initial_player, int[] new_player, int rank){
        PriorityQueue<Integer>minHeap = new PriorityQueue<>();
        for(int num : initial_player){
            if(minHeap.size()<rank){
                minHeap.add(num);
            }else{
                minHeap.add(num);
                minHeap.poll();
            }
        }
       long minimumHealth = minHeap.peek();
        for(int num : new_player){
            if(minHeap.size()<rank){
                minHeap.add(num);
            }else{
                minHeap.add(num);
                minHeap.poll();
                minimumHealth+=minHeap.peek();
            }
        }
        return minimumHealth;
    }

ION✅

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

int dp[5001];

int F(int L, int N, int K, vector<int> &A) {
    if (L == N) return 0;
    if (dp[L] != -1) return dp[L];
    int ans = 2e9;
    int maxi = 0;
    for (int R = L; R < min(N,L + K); R++) {
        maxi = max(maxi, A[R]);
        ans = min(ans, maxi + F(R + 1, N, K, A));
    }
    return return dp[L] = ans;
}

int calculateCost(vector<int> arr, int threshold) {
    memset(dp, -1, sizeof dp);
    return F(0, arr.size(), threshold, arr);
}