Allen's value ✅

Tech Mahindra - Ahmedabad, Fresher Hiring - Manual Testing - July 2024

openings for Manual Testing requirement and are looking for fresher graduates 2023 or 24 pass outs, who can join us at our Ahmedabad office on immediate basis.

Deadline : Before 4 PM, 8th July


https://docs.google.com/forms/d/e/1FAIpQLSfSOlLbgyoYo877t3JtuX8CzTeEM3Fv9WybG86Xb6WVn8qWGQ/viewform

Who have Google exams guys??

Send questions here solutions will be provide What the time of exam

DE Shaw ✅

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

int maxi = 0;

int F(int col , vector<vector<int>> &a , vector<int> &dp){
    if(col == a[0].size()){
        return maxi = max(maxi , (int) dp.size());
    }
    for(int row = 0 ; row < a.size() ; row++){
        if(dp.size() == 0 || dp.back() < a[row][col]){
            dp.push_back(a[row][col]);
            F(col + 1 , a , dp);
            dp.pop_back();
        }
        else{
            int id = lower_bound(dp.begin() , dp.end() , a[row][col]) - dp.begin();
            int old = dp[id];
            dp[id] = a[row][col];
            F(col + 1 , a , dp);
            dp[id] = old;
        }
    }
}

int longestSequence(vector<vector<int>> &matrix){
    maxi = 0;
    vector<int> dp;
    F(0 , matrix , dp);
    return maxi;
}

DE Shaw ✅

My friend Ashwin Kulkarni’s (Senior Software Engineer at IBM Cloud) is taking a FREE group session on Career in Cloud this weekend!

➡️ Available career options and growth strategies.

➡️ Expert roadmap for ideal preparation.

➡️ AMA with Ashwin directly!

Date: July 7 (12: 30 PM)

Register your spot - https://explore.preplaced.in/B47EP7

Company Name: Groww

🛄 Job Title: SDE Intern (Frontend)
✍🏻 YOE: 2024, 2025 and 2026 grads

➡️ Apply: https://docs.google.com/forms/d/e/1FAIpQLScoBAT-JXiyzJ-ey9Jikaw86W5DwwNCeMfkpa70duRUPK5C7A/viewform?pli=1

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

Tech Mahindra - Ahmedabad, Fresher Hiring - Manual Testing - July 2024

openings for Manual Testing requirement and are looking for fresher graduates 2023 or 24 pass outs, who can join us at our Ahmedabad office on immediate basis.

Deadline : Before 4 PM, 8th July


https://docs.google.com/forms/d/e/1FAIpQLSfSOlLbgyoYo877t3JtuX8CzTeEM3Fv9WybG86Xb6WVn8qWGQ/viewform

Goldman Sachs is hiring Non-Engineering Grads

For - 2026 Grads

Location - Bangalore, Hyderabad

https://www.linkedin.com/posts/kazim11_graduate-campus-hiring-program-2024-25-activity-7214606465146257408-q1R6?utm_source=share&utm_medium=member_android

Software Development At Nference Labs

Batch: 2023, 2024, 2025
Stipend : 30k / Month

https://internshala.com/internship/detail/software-development-internship-in-bangalore-at-nference-labs1719289872/

#include <iostream>
#include <unordered_set>
#include <string>
using namespace std;
void generateSubstrings(const string &s, int len, unordered_set<string> &substrings) {
    for (int i = 0; i <= s.size() - len; ++i) {
        substrings.insert(s.substr(i, len));
    }
}

string findMinimalString(const string &s) {
    unordered_set<string> substrings;
    for (int len = 1; ; ++len) {
        substrings.clear();
        generateSubstrings(s, len, substrings);
        string candidate(len, 'a');
        while (true) {
            if (substrings.find(candidate) == substrings.end()) {
                return candidate;
            }
            int pos = len - 1;
            while (pos >= 0 && candidate[pos] == 'z') {
                candidate[pos] = 'a';
                --pos;
            }
            if (pos < 0) break;
            ++candidate[pos];
        }
    }
}

int main() {
    string S;
    cin >> S;
    cout << findMinimalString(S) << endl;
    return 0;
}. 

// Minimal String

Infosys ✅

#include <iostream>
#include <vector>
using namespace std;
vector<bool> sieve(int max_val) {
    vector<bool> is_prime(max_val + 1, true);
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i * i <= max_val; ++i) {
        if (is_prime[i]) {
            for (int j = i * i; j <= max_val; j += i) {
                is_prime[j] = false;
            }
        }
    }
    return is_prime;
}

int main() {
    int N;
    cin >> N;

    vector<int> A(N);
    int max_val = 0;
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
        if (A[i] > max_val) {
            max_val = A[i];
        }
    }

    vector<bool> is_prime = sieve(max_val);

    int prime_count = 0, composite_count = 0;
    for (int i = 0; i < N; ++i) {
        if (is_prime[A[i]]) {
            prime_count++;
        } else {
            composite_count++;
        }
    }

    int good_pairs = prime_count * composite_count;
    cout << good_pairs << endl;

    return 0;
}.  

find good pairs in array
Infosys ✅

Good set
Infosys ✅

Possible strings ✅
Credit : Winner

bool isp(string s){
    int n=s.length();
    for(int i=0;i<n/2;i++){
        if(s[i]!=s[n-i-1]){
            return false;
        }
    }
    return true;
}

int longestString(vector<string>v){
    unordered_map<string,int>mp;
    for(auto x:v){
        mp[x]++;
    }
    int ans=0;
    for(auto x:mp){
      if(x.second>1){
        int k=(x.second)/2;
          ans+=k*(x.first.length()); 
      }
      if(x.second%2!=0){
         mp[x.first]=1;
      }
      else
      mp.erase(x.first);
    }
    int maxi=0;
    for(auto x:mp){
        if(isp(x.first)){
            maxi=max(maxi,(int)x.first.length());
        }
    }
    return ans+maxi;
}

Max palindrome
Infosys ✅