Backend and DevOps Intern for 2023/2024 and 2025 Batch
https://docs.google.com/forms/d/e/1FAIpQLSfRXe7_-7Sscynv2f6oerTFesf0N1byFOolQ8Z2yxmYz1lCTA/viewform

ZS is Hiring for its Business Technology Solutions Team @ Pune!

Role: Business Technology Solutions Associate (BTSA)
Experience: 0-3 Years
Location: Pune
Notice Period: Immediate joiners only

Qualifications:
- Bachelor's degree in Computer Science or related field
- Skills in ETL technologies (Informatica, Talend, SSIS), data warehousing, and SQL
- Exposure to Cloud Platforms (AWS, Azure, GCP) a plus

Additional Skills:
- Strong communication and problem-solving abilities
- Ability to work in a global team environment
- Willingness to travel as needed

Please send your resume to manish.khatri@zs.com

#include <iostream>
#include <algorithm>

using namespace std;

#define ll long long

ll solve(int s1, int s2, int p) {
    ll minT1 = p / s1;
    ll rem1 = p % s1;

    while (minT1 >= 0) {
        if (rem1 % s2 == 0) {
            break;
        }
        minT1--;
        rem1 += s1;
    }

    ll minT2 = p / s2;
    ll rem2 = p % s2;

    while (minT2 >= 0) {
        if (rem2 % s1 == 0) {
            break;
        }
        minT2--;
        rem2 += s2;
    }

    if (minT1 < 0 && minT2 < 0) {
        return -1;
    } else if (minT1 < 0) {
        return minT2 + rem2 / s1;
    } else if (minT2 < 0) {
        return minT1 + rem1 / s2;
    } else {
        return min(minT1 + rem1 / s2, minT2 + rem2 / s1);
    }
}

int main() {
    int s1, s2, p;
    cin >> s1 >> s2 >> p;
    cout << solve(s1, s2, p) << endl;
    return 0;
}

Track in Hackathon ✅

int getPotentialOfWinner(vector<int> potential, long k)
{
    int n = potential.size();

    int x = potential[0];
    int m = 0;
    for (int i = 1; i < n; i++)
    {
        if (m != k)
        {
            if (x > potential[i])
            {
                m++;
            }
            else
            {
                x = potential[i];
                m = 1;
            }
        }
    }

    return x;
}

Chess Tournament ✅

#include <iostream>
#include <unordered_map>
#include <string>
#include <climits>

int getMinGroup(std::string str) {
    std::unordered_map<char, int> mapSubjects;
    int keysCount = 0;
    const int len = str.length();

    for (int i = 0; i < len; ++i) {
        char subject = str[i];
        if (subject == 'b' subject == 'm' subject == 'c' subject == 'p' subject == 'z') {
            if (mapSubjects.find(subject) == mapSubjects.end()) {
                ++keysCount;
                mapSubjects[subject] = 1;
            } else {
                ++mapSubjects[subject];
            }
        }
    }

    if (keysCount != 5) {
        return 0;
    }

    int min = INT_MAX;

    for (const auto& entry : mapSubjects) {
        if (entry.second < min) {
            min = entry.second;
        }
    }

    return min;
}

The Perfect Team ✅

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int getMinimumTime(vector<int>& processSize, vector<int>& capacity) {
    sort(processSize.rbegin(), processSize.rend());
    sort(capacity.rbegin(), capacity.rend());
   
    int ptr = 0;
    int time = 1;
   
    for (int process : processSize) {
        if (ptr == capacity.size()) {
            time++;
            ptr = 0;
        }
        if (process > capacity[ptr]) {
        
            if (process > capacity[0]) {
                return -1;
            }
            time++;
            ptr = 1;
        } else {
            ptr++;
        }
    }
    return 2*time-1;
}

Process Allocation ✅

def min_total_marks(num_questions, marks):
    marks.sort()
   
    total_marks = marks[0]
   
    for i in range(1, num_questions):
        if marks[i] <= marks[i - 1]:
            marks[i] = marks[i - 1] + 1
        total_marks += marks[i]
   
    return total_marks

Mr. Myers and the Exam ✅

Placement season Begins
Gartner ✅

import java.util.Arrays;

public class Main {

    static int findNumOfPairs(int[] a, int[] b) {
        Arrays.sort(a);
        Arrays.sort(b);

        int i = a.length -1 ;
        int j = b.length - 1;
        int pairs = 0;

        while (i >= 0 && j >= 0) {
            if (a[i] > b[j]) {
                pairs++;
                i--;
                j--;
            } else {
                j--;
            }
        }

        return pairs;
    }

Pairs ✅

def count_vowels(string):
    count = 0
    vowels = set('aeiou')
    for char in string:
        if char.lower() in vowels:
            count += 1
    return count

def determine_winner(strings):
    winners = []
    for string in strings:
        if count_vowels(string) % 2 == 0:
            winners.append("Chris")
        else:
            winners.append("Alex")
    return winners

System and Strings ✅

EY hiring voice process Analyst

https://forms.office.com/pages/responsepage.aspx?id=mT-XW99360uyfaoMcLhILOpi94FpHY5HvRlOlqDoYkNUQUlHMTJFRU1LNVFJRkxWUjBWNEgxNlVKOS4u&origin=lprLink