๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
๐‚๐จ๐ฆ๐ฉ๐š๐ง๐ฒ ๐๐š๐ฆ๐ž: Microsoft

๐‘๐จ๐ฅ๐ž: SDE Intern

๐๐š๐ญ๐œ๐ก ๐ž๐ฅ๐ข๐ ๐ข๐›๐ฅ๐ž: 2024 grads

๐€๐ฉ๐ฉ๐ฅ๐ฒ: https://jobs.careers.microsoft.com/us/en/job/1577325/Software-Engineering---Internship-Opportunities?jobsource=linkedin
๐Ÿ‘1
int solution(vector<int> A){
    int n = A.size() >> 1;
    vector<int> dp(n, 1);
    for(int i=1; i<n; i++)
        for(int j=i-1; j>=0; j--)
            if(A[i<<1] == A[j<<1|1])
                dp[j] = max(dp[j], dp[i] + 1);
    return n - *max_element(dp.begin(), dp.end());
}


Microsoft Domioes Solution
C++โœ…
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define vc vector
#define L cout<<'\n';
#define E cerr<<'\n';
#define all(x) x.begin(),x.end()
#define rep(i,a,b) for (int i=a; i<b; ++i)
#define rev(i,a,b) for (int i=a-1; i>=b; --i)
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define setpr(x) cout<<setprecision(x)<<fixed
#define sz size()
#define seea(a,x,y) for(int i=x;i<y;i++){cin>>a[i];}
#define seev(v,n) for(int i=0;i<n;i++){int x; cin>>x; v.push_back(x);}
#define sees(s,n) for(int i=0;i<n;i++){int x; cin>>x; s.insert(x);}
const ll inf = INT_MAX;
const ld ep = 0.0000001;
const ld pi = acos(-1.0);
const ll mod = 1000000007;
int dp[1001][1001];
bool rem(ll a , ll b){return a%b;}
void init_code(){
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
ll add(ll x, ll y){
   return (x+y)%mod;
}
ll multi(ll x , ll y){
   return (x*y)%mod;
}
ll power(ll x , ll y){
   x %= mod;
   ll res = 1;
   while(y > 0){
      if(y&1)res=multi(res,x);
      y=y>>1;
      x = multi(x,x);
   }
   return res;
}

ll inverse(ll n,ll p){
   return power(n,p-2);
}
int helper(unordered_map<int,vector<int>>&mp, vi &v,int ind,int prev){
   if(ind==v.size()) return 1;
   // cout<<ans
   if(dp[ind][prev]!=-1) return dp[ind][prev];
   int ans=0;
   for(auto it:mp[v[ind]]){
     if(it>prev)ans+=helper(mp,v,ind+1,it);
     ans%=mod;
   }
   return dp[ind][prev]=ans;
}
void solve(){
   int n;
   cin>>n;
   vi v(n);
   rep(i,0,n) cin>>v[i];
   unordered_map<int,vector<int>>mp;
   for(int i=1;i<=1000;i++){
         string s=to_string(i);
         int val=0;
         for(auto it:s){
            val+=it-'0';
         }
         mp[val].pb(i);
   }
   // vector<vector<int>>dp(1001,vector<int>(1001,-1));
   memset(dp,-1,sizeof(dp));
   cout<<helper(mp,v,0,0)<<endl;
}


signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
init_code();
   int t;cin >> t;while(t--)
   solve();
   return 0;
}

Google โœ…
(C++)
int Find(vector<int> &v,int n){
  
     vector<int> bit(32,0);
    
     for(int i=0;i<n;i++)
         for(int j=0;j<32;j++)
             if( (v[i]>>j)&1 )
                  bit[j]++;
                 
                 
                 
     long long ans=0;
    
     int M=1e9+7;
     for(int i=0;i<n/2 ;i++){
        
         long long val=0;
        
         for(int j=0;j<32;j++){
             if(bit[j]){
                 val=(val | (1<<j));
                 bit[j]--;
             }
         }
           
           
            ans+=(val*val);
            ans%=M;
        
     }
    
     return ans;
       
    
}

Sneaker shoppingโœ…
Sprinklr
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int numTests;
    cin >> numTests;
    while(numTests--)
    {
        int length;
        cin >> length;
        
        string inputString;
        cin >> inputString;
        
        if (length % 3 == 1)
        {
            cout << "Yes\n";
            continue;
        }
        
        bool flag = false;
        for (char ch = 'a'; ch <= 'z'; ch++)
        {
            int firstIndex = length + 1, lastIndex = -1;
            for (int i = 0; i < length; i++)
            {
                if (i % 3 == 0 && inputString[i] == ch)
                {
                    firstIndex = i;
                    break;
                }
            }
            for (int i = length - 1; i >= 0; i--)
            {
                int x = length - 1 - i;
                if (x % 3 == 0 && inputString[i] == ch)
                {
                    lastIndex = i;
                    break;
                }
            }

            if (firstIndex < lastIndex)
            {
                flag = true;
                break;
            }
        }
        
        if (flag)
            cout << "Yes\n";
        else
            cout << "No\n";
    }
    return 0;
}

Blast palindromeโœ…
๐‚๐จ๐ฆ๐ฉ๐š๐ง๐ฒ ๐๐š๐ฆ๐ž: Tech Mahindra

๐‘๐จ๐ฅ๐ž: Software Engineer

๐๐š๐ญ๐œ๐ก ๐ž๐ฅ๐ข๐ ๐ข๐›๐ฅ๐ž: 2022 and 2023 grads

https://registration.techmahindra.com/Candidate/RegDefault.aspx
Please find latest Opportunities from Career page and Apply before Expired before applying kindly follow jobs description and eligibility carefully

passout year: 2023, 2022, 2021, 2020, 2019, 2018


CapitalOne Hiring Associate Software Engineer
Qualification Tag : Engineering
Salary: 10lpa - 15lpa 
Apply now: https://www.capitalonecareers.com/job/-/-/1732/51188481952

HPE Hiring Cloud Engineer
Qualification Tag : Engineering
Salary: 10lpa ( Expected)
Apply now: https://careers.hpe.com/us/en/job/1158683/Cloud-Engineer

Siemens Hiring Software Tester
Qualification Tag : Engineering
Salary: 7.5 lpa ( Expected)
Apply now:  https://jobs.siemens.com/careers/job/563156116064691

Assa Abloy Hiring Software Engineer
Qualification Tag : Engineering
Salary: 4lpa - 6 lpa ( Expected)
Apply now: https://assaabloy.jobs2web.com/job/Associate-Software-Engineer/950550001/

Cognizant Hiring Junior Data Analyst
Qualification Tag : Engineering
Salary: 4.5 lpa
Apply now: https://careers.cognizant.com/in/en/job/COGNGLOBAL00043576146/Trainee-Junior-Data-Analyst

Zoho Hiring Software Engineer
Qualification Tag : Engineering
Apply now :
Salary: 8lpa ( Expected)
Apply now: https://www.zoho.com/careers/jobdetails/?job_id=2803000614929615

Cognizant Hiring Programmer Analyst
Qualification Tag : Engineering
Salary: 4.4 lpa ( Expected)
Apply now: https://careers.cognizant.com/global/en/job/00039714235/Programmer-Analyst-Trainee

TVS Next Hiring Software Engineer Trainee
Qualification Tag : Engineering
Apply now : https://learning.tcsionhub.in/jobs/TVS-NEXT-LIMITED/Software-Engineer--Trainee-6095/

Harris Computer Hiring Software Trainee
Qualification Tag : Engineering
Apply now: https://harriscomputer.wd3.myworkdayjobs.com/en-US/1/job/Office---Mumbai-Andheri/Software-Trainee_R0020106

Sony Hiring Junior Full Stack developer
Qualification Tag : Engineering
Apply now : https://sonyglobal.wd1.myworkdayjobs.com/en-US/SonyGlobalCareers/job/Bangalore/Jr-Fullstack-Developer_JR-113869-1
Konecranes hiring Fresher Trainee Software Engineer โ€“ SAP MM/WM

Job Designation : Trainee Software Engineer โ€“ SAP MM/WM

Qualification :  Bachelorโ€™s / Masterโ€™s Degree

Experience : Freshers / 0 โ€“ 1 year

Skill Set :
- Good communication and presentation skills.
- Must have at least basic SAP MM / WM knowledge.
- Should have excellent inter-personnel skills.
https://fresherdrives.com/it-jobs/konecranes-hiring-fresher-trainee-software-engineer-sap-mm-wm-2/