๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.62K subscribers
5.59K photos
3 videos
95 files
10.2K 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
๐ŸŽฏIGT Solutions Walk-in Drive 2023 for Process Associate | Any degree | 15 November 2023๐ŸŽฏ

๐Ÿ”ธJob Role : Process Associate
๐Ÿ”ธQualification : Any Degree/Any PG degree
๐Ÿ”ธExperience : Freshers
๐Ÿ”ธSalary : Rs. 15,000/-

WALKIN TIMINGS & VENUE -

Date/Day - 15-Nov-23 , Wednesday , 10:30am onwards

Please share your resume on sameer.gandhi@igtsolutions.com

Infotech Centre, 14/2 Old Delhi Gurgaon Road Dundahera, GURGAON, Haryana, India
PLEASE MENTION "Sameer Gandhi" ON TOP OF YOUR RESUME
def sameSubstring(s, t, K):
    n = len(s)
    cost = 0
    length = 0
    res = 0

    for i in range(n):
        cost += abs(ord(s[i]) - ord(t[i]))
        length += 1
       
        while cost > K:
            cost -= abs(ord(s[i - length + 1]) - ord(t[i - length + 1]))
            length -= 1

        res = max(res, length)

    return res
bool comp(vector<int> a, vector<int> b) {
    if (a[1] == b[1])
        return a[0] < b[0];
    else
        return a[1] < b[1];
}

int solve(vector<vector<int>>& b) {
    sort(b.begin(), b.end(), comp);
    int count = 1;
    int end = b[0][1];
    for (int i = 1; i < b.size(); i++) {
        if (b[i][0] > end) {
            count++;
            end = b[i][1];
        }
    }
    return count;
}