#include <vector>
#include <iostream>

using namespace std;

vector<int> solution(int riverWidth, int maxJump, vector<int> platformSizes) {
    int N = 1e5 + 5;
    int maxJumpTemp, totalPlatforms, currentPlatform, prefixSum[N], platformLength[N];
    vector<int> answer(riverWidth, 0); // Initialize answer with 0 and size riverWidth
   
    totalPlatforms = riverWidth;
    currentPlatform = platformSizes.size();
    maxJumpTemp = maxJump;
   
    for (int i = 1; i <= currentPlatform; i++) {
        prefixSum[i] = platformSizes[i - 1];
        platformLength[i] = prefixSum[i];
    }
   
    for (int i = 1; i <= currentPlatform; i++) {
        prefixSum[i] += prefixSum[i - 1];
    }
   
    int currentIndex = 1, gap = 1, maxReach = 0;
    for (int j = 1; j <= currentPlatform; ) {
        if (currentIndex - 1 + prefixSum[currentPlatform] - prefixSum[j - 1] == totalPlatforms) {
            int start = currentIndex;
            for (; currentIndex < platformLength[j] + start; currentIndex++)
                answer[currentIndex - 1] = j, maxReach = currentIndex;
            j++;
            gap = 1;
        } else if (gap < maxJumpTemp) {
            gap++;
            currentIndex++;
            continue;
        } else if (gap == maxJumpTemp) {
            int start = currentIndex;
            for (; currentIndex < platformLength[j] + start; currentIndex++)
                answer[currentIndex - 1] = j, maxReach = currentIndex;
            j++;
            gap = 1;
        }
    }
   
    if (totalPlatforms + 1 - maxReach > maxJumpTemp) {
        return {-1};
    }
   
    return answer;
}

int main() {
    int riverWidth = 7;
    int maxJump = 2;
    vector<int> platformSizes = {1, 2, 1};

    vector<int> result = solution(riverWidth, maxJump, platformSizes);
    for (int num : result) {
        cout << num << " ";
    }
    cout << endl;

    return 0;
}

River vala mario✅
Trilogy

Quest Global

Off Campus Recruitment Drive
Degree: BE / B.Tech / MCA
Year of Completion: 2023 / 2024

https://forms.office.com/pages/responsepage.aspx?id=pCOqk-FuAUaFkjGnYkiTWSEIpM2LK_JOkjumpG3xVgxUMjQ1MVQ1VkkyQTU1MFpXOElTNFJXMlQ2Sy4u

Taskus is hiring Junior Developer

For 2021, 2022, 2023 grads
Location: Chennai

https://jobs.eu.humanly.io/jobs/bd25b188-b5c7-4db9-baa1-71db0f3601b2?source=LinkedIn

Coakroach Labs  International Opportunity  fresh Grads

Role - Backend Engineer
Exp - Fresher
Location- Toronto

Link - https://boards.greenhouse.io/cockroachlabs/jobs/6145671

Spinny Hiring

Interns for Project Engineering profile at our headquarters at Gurugram.

Internship duration: 3-4 months

★Perks Provided on completion:
💡Letter Of Appreciation
💡Letter Of Recommendation Stipend
💡PPO (Based on the performance)

Points of necessary consideration:
- Must be 2023 pass out from Civil Engineering Courses.
- Must have experience with project management.
- Get on board with a team of extragavant professionals and have the necessary boost up to your career.

💻NOTE: Working Assets and Laptops will be provided.

Interested candidates can share their CV at the email address provided below: suryansh.tiwari@spinny.com

Civil Engineering students can apply

🚀Aryson Technologies has launched multiple paid Internship program 🚀

⏳Duration: 6 months
💵Stipend: Rs 5000
📍 Location: Sector 58, Noida

- Software Tester
- Web Designing
- Graphic Designing
- Technical Writer
- SEO

Share your updated resume to:
milanhrdept@arysontechnologies.com

Tech Solutions Hiring
Both freshers/experienced candidates

📌QA Engineer Internship
-Freshers Eligible
-B. Tech or similar field

📌For Associate role QA
Exp: 1 - 3 years

Send your updated resume to:
tejashree.patil@techolution.com

📌Hiring for React & React Native Interns

Stipend: 50k - 60k
Location: Bangalore HSR(5 days WFO)

Interested one share their resume to:
careers@betterhalf.ai

👉Awesome Opportunity 👈

📌Mindwebtree hiring for the following positions:

.NET Developer
PHP Developer
Angular Developer

Eligibility Criteria:
BCA, MCA, or BTech graduates only.
Immediate joiners preferred.

send your CV to hr@mindwebtree.com

Uniwave Software is Hiring for Fresher's

Job Role: Software Engineer

Qualification: BE/B.Tech - CS/IT

Passout: 2023-24 Only with 60% criteria(10th, 12th & Graduation)

Location: Pune
Package: 3.5-4.5 LPA
Skills: Java, Python, Dot Net, SQL, NodeJS

👉Interested candidates can share cv at:
naresh@unijobsolution.com

TEKsystems is hiring freshers for Pune Location.

Skill : L1 Generalist - Support role
Shifts: Night shift( Cab facilities will be provided).
Experience 0-1year
Interview - F2F round (Post selection of 1st round.)

Skills required:
i) Excellent communication skills
ii) Good analytical knowledge

Work Location : Pune (Candidates from Pune or nearby places only)
Education Background: Graduate (Btech / BE / BCA /B.Sc )

If any referrals needed please reach out to pbohara@teksystems.com

Entrust Walkin Interview | Hiring Trainee Software Engineer ❤️❤️❤️

Detailed Eligibility:

Computer Science Graduates M.Sc / MCA / B.E / B.Tech (Computer Science)
2024 Passed outs Only
Experience: Freshers
Shift: General Shift (9 AM to 6 PM)

Walk In Procedure
Step 1: While coming for the Interview, please bring the interview call letter, Resume & Original Govt. ID Proof (No color xerox).
Step 2: Once you enter DLF Premises, you must register in the above link to enter the DLF Premises.

Apply from here (Direct Link): https://tinyurl.com/5xz9str3

Chocolate Types ✅

class UnionFind {
public:
    vector<int> parent, rank;
   
    UnionFind(int n) {
        parent.resize(n);
        rank.resize(n, 0);
        for (int i = 0; i < n; ++i) {
            parent[i] = i;
        }
    }

    int find(int x) {
        if (parent[x] != x) {
            parent[x] = find(parent[x]);
        }
        return parent[x];
    }

    void unite(int x, int y) {
        int rootX = find(x);
        int rootY = find(y);
        if (rootX != rootY) {
            if (rank[rootX] > rank[rootY]) {
                parent[rootY] = rootX;
            } else if (rank[rootX] < rank[rootY]) {
                parent[rootX] = rootY;
            } else {
                parent[rootY] = rootX;
                rank[rootX]++;
            }
        }
    }
};

    int minTimeToCollectPlates(vector<int>& x, vector<int>& y, int d) {
    int n = x.size();
    UnionFind uf(n);
   
   
    unordered_map<int, vector<int>> xMap, yMap;
   
    for (int i = 0; i < n; ++i) {
        xMap[x[i]].push_back(i);
        yMap[y[i]].push_back(i);
    }


    for (const auto& [coord, indices] : xMap) {
        for (int i = 1; i < indices.size(); ++i) {
            if (abs(y[indices[i]] - y[indices[i - 1]]) <= d) {
                uf.unite(indices[i], indices[i - 1]);
            }
        }
    }


    for (const auto& [coord, indices] : yMap) {
        for (int i = 1; i < indices.size(); ++i) {
            if (abs(x[indices[i]] - x[indices[i - 1]]) <= d) {
                uf.unite(indices[i], indices[i - 1]);
            }
        }
    }

   
    unordered_set<int> unique;
    for (int i = 0; i < n; ++i) {
        unique.insert(uf.find(i));
    }

    return unique.size();
}

Gamekraft ✅