Random Trees is hashtag#hiring for Data Engineer Interns.

Experience: 0 year
Location: Hyderabad
No. of positions: 3

Interested candidates can share their resume at harshini.c@randomtrees.com

int balloonGame(int n, int input2[])
{
  int64_t dp[(1 << n)];
  memset(dp, 0x3f, sizeof(dp));
  dp[0] = 0;
  for (int i = 1; i < (1 << n); i++) {
    int x = __builtin_popcount(i);
    for (int j = 0; j < n; j++) {
      if (i & (1 << j)) {
int pv = i ^ (1 << j);
int64_t nx = dp[pv] + (input2[j] + (x-1)) / x;
dp[i] = min(dp[i], nx);
      }
    }
  }
  return dp[(1 << n) - 1];
}

Balloon Game
Myntra ✅

SELECT
    c.username,
    STRING_AGG(ci.name, ', ' ORDER BY ci.banner_cost DESC) AS cities,
    COUNT(b.id) AS banners,
    SUM(b.width * b.height) AS total_area,
    SUM(b.width * b.height * ci.banner_cost) AS total_cost
FROM
    customers c
JOIN
    banners b ON c.id = b.customer_id
JOIN
    cities ci ON b.city_id = ci.id
GROUP BY
    c.username
ORDER BY
    c.username ASC;

Cloud Virtual Machines Consumption Report ✅

Xeno is hiring Full Stack Dev Interns 💻

For 2025 grads

Apply - https://www.linkedin.com/posts/xenohq_were-hiring-software-engineer-interns-activity-7199716967774101504-XEOM

SELECT     c.username,
    GROUP_CONCAT(ct.name ORDER BY (b.width * b.height * ct.banner_cost) DESC SEPARATOR ', ') AS cities,    COUNT(b.id) AS banners,
    SUM(b.width * b.height) AS total_area,    SUM(b.width * b.height * ct.banner_cost) AS total_cost
FROM     customers c
JOIN     banners b ON c.id = b.customer_id
JOIN     cities ct ON b.city_id = ct.id
GROUP BY     c.username
ORDER BY     c.username ASC;

Outdoor Banner Digital Marketplace Customer Report ✅

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

HashedIn | Multiple Roles | 2023, 2024 Batches

Post: https://www.linkedin.com/posts/pranjal-shahi-30bb75190_hiring-hashedinbydeloitte-activity-7199718328985161731-sB-T?utm_source=share&utm_medium=member_android

Fasal is hiring SDE Intern

For 2024, 2025 grads

Apply - https://www.linkedin.com/posts/sadia-khanam-b36097148_internship-softwaredevelopment-techcareers-activity-7199670782732476417-MJpK

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✅