https://jobs.amdocs.com/careers/job?pid=563430997179688&domain=amdocs.com

Amdocs Hiring Java Developer- Fresh Graduate (Year 2023 & 2024 Graduates only)

•    Bachelor's degree in Science/IT/Computer Science or equivalent
•    0-11 months work experience in Core Java (OMS, CRM, ARIC). With basic knowledge in Python, SQL, UNIX, Linux, Shell/ Perl scripting.
•    Open to Fresh Graduates (Year 2023 and 2024 only).
•    Local hiring only: Not open to Expat hiring.
•    Willing to work on a Dayshift, Hybrid set- up (Work from home + 3x per week work on site in BGC or in Ortigas).
•    With background and understanding in Software Development Life Cycle.
•    With knowledge in Cloud computing (AWS, Azure)- good-to-have.

Why you will love this job:
•    You will be challenged to design and develop new software applications.
•    You will have the opportunity to work in a growing organization, with ever growing opportunities for personal growth.

https://jobs.eu.lever.co/payu/ee2691f3-64c7-4251-9284-e91aa40b2932/apply?utm_source=Data_Internship_unstop&utm_medium=listing&utm_campaign=unstop

PayU Hiring Data Intern

https://www.naukri.com/job-listings-java-developer-fable-fintech-pvt-ltd-mumbai-0-to-5-years-130924022893?src=cluster&sid=1726473982209105_5&xp=15&px=4&nignbevent_src=jobsearchDeskGNB

Fable Fintech hiring java Developer

https://www.linkedin.com/jobs/view/4025505068

TechSopi Global Hiring Java Full Stack

We are looking for a motivated Java Developer to join our growing team and contribute to exciting projects.


Job role - Java FullStack Developer
Experience - Minimum 6 Months
Skills - Core Java, spring, springboot, Angular
Qualification - BCA/ MCA/ B.Tech (CS/ IT)
Passout Year - From 2021 year onwards
Job Type - Full Time
Work Mode - Work from Office (5 Days a week)
Location - Banipark (Jaipur)


If you are excited about this opportunity and meet the qualifications, please send your resume to diksha.khandelwal@techsopi.com

5. RagaAI Inc is looking for 3-4 interns who can work out of the Bangalore office. Folks with LLM experience in agentic application, evals and observability needed.
Mail from resume at rehan.asif@raga.ai, including the term "internship" in the subject.

Tailored AI Hiring for SDE 1 & 2
🎓 Batch : 2024
🏠 Location :  Bengaluru

Apply here -  https://docs.google.com/forms/d/e/1FAIpQLSfjwtrGL7HEX8SdOiNF6JrAElKrBLr2g5X3moWoP32lWoArzw/viewform

.

https://jobs.jobvite.com/zones/job/oafuufw7?source=LinkedIn%2BRecruiter

Zones LLC hiring L1 Service Desk Fresher

Experience – 0- 0.6 months in IT Support
Education – Bsc (IT, Computer) or B.Tech/ BE, BCA, M.Tech, MCA, Msc (Computer)
Reporting – Team Lead

sort(task.begin(), task.end());
multiset<int> s;
long long sum = 0;
int ans = 0;

for (int i = 0; i < n; i++) {
    sum += 1LL * task[i][1];
    s.insert(-task[i][1]);
    long long time = 2LL * task[i][0];
   
    while (!s.empty() && sum + time > 1LL * t) {
        sum += 1LL * (*s.begin());
        s.erase(s.begin());
    }
   
    ans = max(ans, (int)s.size());
}

return ans;

Hurry ✅

def solve(S1, S2):
    L1 = len(S1)
    L2 = len(S2)
    result = []
    
    for i in range(L2):
        if S2[i] == 'T':
            result.append(S1)
        else:
            result.append('A' * L1)
    
    return ''.join(result)[:L1 + L2 - 1]

String generation ✅

Articulation points
Statestreet
All passed ✅

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

typedef long long ll;

ll solve(int n, int m, vector<ll> f, vector<ll> b) {
    vector<pair<ll, int>> v;
    for(int i=0; i<n+m; i++) {
        v.push_back({min(f[i], b[i]), f[i] <= b[i]});
    }

    sort(v.begin(), v.end());

    int s = 0, e = 0;
    ll cost = 0;
    for(int i=n+m-1; i>=0; i--) {
        if((v[i].second && s < n) || e == m) {
            s++;
            cost += f[i];
        } else {
            e++;
            cost += b[i];
        }
    }

    if(s < n || e < m) {
        return -1;
    }

    return cost;
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<ll> f(n+m), b(n+m);
    for(int i=0; i<n+m; i++) {
        cin >> f[i];
    }
    for(int i=0; i<n+m; i++) {
        cin >> b[i];
    }

    cout << solve(n, m, f, b) << endl;

    return 0;
}

Hiring Drive ✅

#include <iostream>
using namespace std;

int countUnequalEquals(int N) {
    if (N % 2 != 0) {
        return 0;
    }
        return (N - 1) / 4;
}

Unequal Equals ✅

def solution(A, B):
    min_extra_chocolates = float('inf')
   
    upper_bound = B // A + 2
   
    for k in range(1, upper_bound + 1):
        A_plus_X = (B + k - 1) // k
        X = A_plus_X - A
       
        if X < 0:
            continue
       
        Y = k * (A + X) - B
       
        if Y < 0:
            continue
       
        min_extra_chocolates = min(min_extra_chocolates, X + Y)
   
    return min_extra_chocolates

Multiple ✅

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

int sum(int s, int e, vector<int>& v){
    unordered_map<int, int> prev;
    int res = 0, curr = 0;
    for (int i = s; i < e; i++) {
        curr += v[i];
        if (curr == 0)
            res++;

        if (prev.find(curr) != prev.end())
            res += (prev[curr]);
        prev[curr]++;
    }

    return res;
}

long getMedianSubarrays(vector<int>& s, int k){
    int n = s.size();
    vector<int> small(n, 0), gre(n, 0);
    for (int i = 0; i < n; i++) {
        small[i] = s[i] < s[k - 1];

        gre[i] = s[i] > s[k - 1];
    }
    vector<int> diff(n, 0);
    for (int i = 0; i < n; i++)
        diff[i] = small[i] - gre[i];
    long v1 = sum(0, n, diff);
    long v2 = sum(0, k - 1, diff);
    long v3 = sum(k, n, diff);
    return v1 - v2 - v3;
}

int main(){
    vector<int> arr={5, 3, 1, 4, 7, 7};
    int K = 4;
    cout << getMedianSubarrays(arr, K);
}

Sport week in Hackerland ✅

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

string findTheString(vector<vector<int>>& lcp) {
    int n = lcp.size();
    string s(n, 'a');
    set<char> used;
    
    auto validate = [&](int i, int j) {
        return lcp[i][j] == (int)min(s.length(), s.length());
    };
    
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (!validate(i, j)) return "Impossible";
            if (lcp[i][j] > 0) {
                s[j] = s[i];
                used.insert(s[j]);
            }
        }
    }
    
    if (used.size() > 26) return "Impossible";
    
    char next_char = 'a';
    for (char c : used) {
        if (next_char > 'z') return "Impossible";
        replace(s.begin(), s.end(), c, next_char);
        next_char++;
    }
    
    return s;
}

Tekion ✅

def photoAlbum(index_count, index, identity_count, identity):
    output = [0] * index_count
    for i in range(index_count):
        output[i] = identity[index[i]]
    return output

Schrodinger ✅

set<ll> primes(ll n)
{
    map<ll,ll>mp;
    set<ll>st;
    while (n % 2 == 0)
    {
        mp[2]++;
        n = n/2;
    }
    for (int i = 3; i <= sqrt(n); i = i + 2)
    {
        while (n % i == 0)
        {
            mp[i]++;
            n = n/i;
        }
    }
    if (n > 2)
        mp[n]++;
    for(auto it:mp){
        if(it.ss%2==1){
            st.insert(it.ff);
        }
    }
    return st;
}
ll getNonPerfectPairs(ll n, vl arr,ll k){
    map<set<ll>,ll>mp;
    ll cnt=0;
    for(int i=0;i<n;i++){
        set<ll>temp=primes(arr[i]);
        mp[temp]++;
    }
    vl ans;
    for(auto it:mp){
        ans.pb(it.ss);
    }
    sort(all(ans));
    priority_queue<ll>pq;
    for(int i=0;i<ans.size();i++){
        pq.push({ans[i]});
    }
    debug(ans);
    while(pq.size()>1){
        ll x=pq.top();
        pq.pop();
        ll y=pq.top();
        pq.pop();
        cnt++;
        if(x-1>0){
            pq.push(x-1);
        }
        if(y-1>0){
            pq.push(y-1);
        }
    }  
    ll temp=0;
    if(pq.size()>0){
        temp=pq.top();
    }
    debug(temp);
    ll mini=min(k,temp/2);
    cnt+=mini;
    cout<<cnt<<endl;
}

Schrodinger ✅