๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.61K subscribers
5.59K photos
3 videos
95 files
10.1K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
 Si14 Semiconductors Pvt. Ltd.

We are Hiring trained Freshers (B. Tech/M. Tech) Passed out years should be 2021 or below.

Open Positions:
ยท    Physical Design Engineer
ยท    Design Verification Engineer
ยท    STA Engineer

Location: Bangalore, KA.
Submit your CV to hr@si14semicon.com
ZS, a leading professional services firm, is hiring for freshers!

Looking for a Decision Analytics Associate to join ZS team in Pune.
---YOE: BE/B.Tech graduate with 0-2 years of experience,
To apply, email your resume to vedali.kshirsagar@zs.com along with your total experience, CCTC, ECTC, notice period, and preferred location.
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
โค1
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 โœ…
๐Ÿ‘1
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
๐Ÿ‘1