Hiring for Trained Freshers | No of Openings: 20  | CTC: 3.00 LPA
Send resumes to hr@lyrostech.com
Location: Hyderabad - WFO
Role: Software Engineer
Role: Permanent
YOP: 2022 to 2024 only
Mandatory to have Excellent Communication Skills
Strictly not Work from Home
What we're looking for:

- Trained fresher with a solid understanding of Apigee, GCP, or DevOps concepts.
- Enthusiastic individuals with a thirst for knowledge and a drive to excel.
- Strong communication and teamwork skills.

Splore is hiring SDE (Full Time)

For 2023, 2022, 2021 grads

https://splore.bamboohr.com/careers/37

Paid Internship Opportunity : Program Management Intern

Duration : 3 Months
Location : Gurugram
Interested candidates send your CV to
harshit@collegesearch.in

Company Name: Cornerstone

🛄 Job Title: Software Engineer

✍🏻 YOE: 2022 and 2023 grads


➡️ Apply: https://cornerstone.csod.com/ux/ats/careersite/2/home/requisition/9535?c=cornerstone

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

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

vector<int> solve(int N, int M, vector<int> time) {
    vector<int> ans(M, 0);
    vector<vector<int>> v(N);
   
    for(int i = 0; i < M; ++i) {
        v[i % N].push_back(i);
    }

    int departure = 0;

    for(int i = 0; i < N; ++i) {
        if(!v[i].empty()) {
            ans[v[i][0]] = time[v[i][0]] + 1;
            departure = ans[v[i][0]];
        }
        for(int j = 1; j < v[i].size(); ++j) {
            int idx = v[i][j];
            int val1 = time[idx];
            if(departure > val1) {
                ans[idx] = departure + 1;
                departure++;
            } else {
                departure = val1 + 1;
                ans[idx] = departure;
            }
        }
    }

    return ans;
}

Shopping and Billing ✅

Dhruva | Software Engineer - Freshers | Pune

OG post: https://www.linkedin.com/posts/osho-pandey_jobs-activity-7198636961555705858-MJN7?utm_source=share&utm_medium=member_android

Hiring for US Banking domain for freshers 2023 , 24 yr passed out

Work location - Accenture , Chennai

wfo option . US shift

knowledge needed in accounts , finance , basic banking skills

Good comm skills needed

Share ur resume to HR

Adarsh.elango@accenture.com

Data Science Intern at PayU
https://jobs.eu.lever.co/payu/330d411a-955b-4545-902c-b983d44ed167?lever-via=b9DCJyVgUL&lever-social=job_site

SDE intern are Closed

Software Engineer at Cimba.ai

2024 Batch
CTC: 4.2 lpa to 15 lpa + ESOP
https://www.linkedin.com/jobs/view/3924050339

Python Developer Intern(Fresh Batch) at Prometrics Solutions

Base salary
₹400,000/yr - ₹500,000/yr
https://app.pyjamahr.com/careers?company=Prometrics%20Solutions&job_id=98410&company_uuid=50A819F913

BiteSpeed is hiring Backend Developer (Full Time)

For 2023, 2022 grads

Check out this job at BiteSpeed: https://www.linkedin.com/jobs/view/3925576614

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();

        for (int t = 0; t < T; t++) {
            int S = scanner.nextInt();
            int N = scanner.nextInt();
            int M = scanner.nextInt();

            int result = minDaysToBuyFood(S, N, M);
            System.out.println(result);
        }

        scanner.close();
    }

    private static int minDaysToBuyFood(int S, int N, int M) {
        int low = 0;
        int high = S;

        while (low <= high) {
            int mid = (low + high) / 2;

            if (canSurvive(S, N, M, mid)) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }

        if (low > S) {
            return -1;
        }

        return low;
    }

    private static boolean canSurvive(int S, int N, int M, int days) {
        int food = (N - N/7) * days;
        int foodRequired = M * S;

        return food >= foodRequired;
    }
}. 

Island survival ✅

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

bool canFinish(int n, vector<vector<int>> &edges) {
    int cnt = 0;
    vector<int> adjList[n];
    int m = edges.size();
    vector<int> indegree(n, 0);

    for (int i = 0; i < m; i++) {
        adjList[edges[i][1]].push_back(edges[i][0]);
        indegree[edges[i][0]]++;
    }

    queue<int> q;

    for (int i = 0; i < n; i++)
        if (indegree[i] == 0)
            q.push(i);

    while (!q.empty()) {
        int node = q.front();
        cnt++;
        q.pop();
        int m = adjList[node].size();
        for (int i = 0; i < m; i++) {
            int adjNode = adjList[node][i];
            indegree[adjNode]--;
            if (indegree[adjNode] == 0)
                q.push(adjNode);
        }
    }
    return (cnt == n);
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> edges(m, vector<int>(2));

    for (int i = 0; i < m; i++)
        cin >> edges[i][0] >> edges[i][1];

    if (canFinish(n, edges))
        cout << "true";
    else
        cout << "false";

    return 0;
}
    
/// Course Prerequisites ✅

import java.util.Scanner;
import java.util.TreeSet;

public class Main {
    public static int countValidSubarrays(int[] A, int B, int C) {
        int n = A.length;
        int count = 0;
        long[] prefixSum = new long[n + 1];
        prefixSum[0] = 0;
        for (int i = 0; i < n; i++) {
            prefixSum[i + 1] = prefixSum[i] + A[i];
        }
        TreeSet<Long> set = new TreeSet<>();
        set.add(0L);

        for (int i = 1; i <= n; i++) {
            long lowerBound = prefixSum[i] - C;
            long upperBound = prefixSum[i] - B;

            count += set.subSet(lowerBound, true, upperBound, true).size();

            set.add(prefixSum[i]);
        }

        return count;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }
        int result = countValidSubarrays(A, B, C);
        System.out.println(result);
       
        sc.close();
    }
}.

Range Bokking olx ✅

Company Name: Thoughtworks

🛄 Job Title: Application Developer

✍🏻 YOE: 2024 or earlier grads

➡️ Apply: https://www.naukri.com/campus/contests/hiring-challenge-for-graduate-application-developer-from-thoughtworks-hiring-challenge-thoughtworks-event-31661

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

Oracle is hiring MTS (Full Time)

Location - Bangalore

For 2024, 2023, 2022 grads

Expected CTC - 25-30 LPA

Apply: https://www.linkedin.com/posts/manauwar-ansari_referral-softwaredeveloper-reference-activity-7198665138881650688-gtJm