❗️HealthAsyst Off Campus Drive 2021 | Freshers | Software Developer | INR 4.5 LPA❗️

👨‍💻Job Role : Software Developer
🎓Qualification : B.E/B.Tech
🎖Experience : Freshers
💰Package : 4.5 LPA

⭕️ Apply Fast :   

https://www.healthasyst.com/careers/open-positions/?jobId=a5QXaBgKq3IU

persistentsystems hiring for Client Hospitality profile.

We are looking for candidates from the hospitality industry with 2 years experience.
 
Experience - 0-2 yrs
 
Joining - Immediate
 
JD - Managing client visits: Airport transfers, welcome formalities, board room arrangements, food arrangements, other Admin responsibilities.

Interested candidates please share your updated CV at krupa_jugade@persistent.com

GFG Jobathon is live , multiple companies hiring for Internships and Full Time roles

https://bit.ly/Jobathon31GFG

Internship at Swiggy - Summer'2024

https://docs.google.com/forms/d/1-pliqHMYSh7d0cNmEKqhbNqdwUfFiTQVF7oVU9cYbNo/viewform?edit_requested=true

❗️LS Digital Off Campus Drive 2024 Hiring AS Graduate Trainee | INR 4 LPA❗️

👨‍💻Job Role : Graduate Trainee
🎓Qualification : Any Degree
🎖Batch :   2023 & 2024
💰Package : INR 4 LPA

⭕️ Apply Fast :  

https://careers.lsdigital.com/lsdigital/jobview/graduate-trainee-mumbai-maharashtra-india-communication-skills-presentation-skills-interpersonal-skills-2024031911570666

PwC is hiring!
Position: Intern/ Trainee (Data, Analytics & Al)
Qualifications: Bachelor's/ Master's Degree/ UG
Salary: Upto 7 LPA (Expected)
Experience: Freshers
Location: Mumbai/ Gurugram

Apply Link: https://pwc.wd3.myworkdayjobs.com/Global_Experienced_Careers/job/Gurugram-Novus-Tower/Intern--Trainee_518129WD-2?source=172911

Paytm Off Campus Hiring Fresher For Product Analytics- Intern | Noida

Job Description :
Paytm is looking for a Product Analytics- Intern in Noida

Job Title : Product Analytics- Intern
Job Type : Full Time
Location : Noida
Experience : Fresher

Apply: https://jobs.lever.co/paytm/a24ee48b-8a81-42bb-85a6-bf12361508bb

def min_remaining_length(seq):
    stack = []
    for char in seq:
        if char == "A" or char == "B":
            if stack and stack[-1] == "A" and char == "B":
                stack.pop()
            elif stack and stack[-1] == "B" and char == "B":
                stack.pop()
            else:
                stack.append(char)
        else:
            stack.append(char)
   
    return len(stack)

Substring Removal ✅

int getMaxPrisonHole(int n, int m, vector<int> x, vector<int> y) {
    vector<bool> xb(n+1, true);
    vector<bool> yb(m+1, true);
   
    for(int i : x) {
        xb[i] = false;
    }
   
    for(int i : y) {
        yb[i] = false;
    }
   
    int cx = 0, xm = INT_MIN, cy = 0, ym = INT_MIN;
   
    for(int i = 0; i < xb.size(); i++) {
        if(xb[i]) {
            cx = 0;
        } else {
            cx++;
            xm = max(cx, xm);
        }
    }
   
    for(int i = 0; i < yb.size(); i++) {
        if(yb[i]) {
            cy = 0;
        } else {
            cy++;
            ym = max(cy, ym);
        }
    }
   
    return (xm+1) * (ym+1);
}

Prison Break ✅
Swiggy

public static int selectStock(int saving, int[] currentValue, int[] futureValue) {
        int n = currentValue.length;
        int[][] dp = new int[n + 1][saving + 1];

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j <= saving; j++) {
                dp[i][j] = dp[i - 1][j];

                if (j >= currentValue[i - 1]) {
                    dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - currentValue[i - 1]] + futureValue[i - 1] - currentValue[i - 1]);
                }
            }
        }

        return dp[n][saving];
    }

Selecting stocks ✅
Swiggy

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

int jumps(int flagHeight, int bigJump) {
    if (flagHeight <= bigJump)
        return 1;
   
    int remainingHeight = flagHeight - bigJump;
    int minJumps = remainingHeight / bigJump;
   
 
    if (remainingHeight % bigJump != 0)
        minJumps++;
   
    return minJumps + 1;
}

Jump to the flag ✅
Swiggy

int findMaxMinutes(int api_size, vector<int>& apiTimes) {
    sort(apiTimes.begin(), apiTimes.end());
    int maxMinutes = 0;
    int totalRunningTime = 0;
    for (int time : apiTimes) {
        totalRunningTime += time;
    }
    for (int time : apiTimes) {
        int simultaneousApps = totalRunningTime / time;
        maxMinutes = max(maxMinutes, simultaneousApps);
    }

    return maxMinutes;
}



Flipkart API

Just an update for you guys.

Currently Microsoft is actively hiring for Software Engineer role, if you want to apply please go on career page and try to apply through referral.

Best of luck 🤞

#define pll pair<long long,long long>
#define vll vector<long long>
#define ll long long
#define vvll vector<vector<long long>>
#define vpll vector<pair<long long,long long>>
class Solution {
public:
    bool isRobotBounded(string s) {
       
    ll x=0,y=0;
    ll d=0;
    vvll dir={{0,1},{1,0},{0,-1},{-1,0}};
    for(auto it:s)
    {
        if(it=='R') d=(d+1)%4;
        else if(it=='L') d=(d+3)%4;
        else x+=dir[d][0],y+=dir[d][1];
    }
    if(x==0 and y==0 or d>0) return 1;
    return 0;
    }
};

Encircular ✅