𝐂𝐨𝐦𝐩𝐚𝐧𝐲 𝐍𝐚𝐦𝐞: Trellix

𝐑𝐨𝐥𝐞: Software Engineer

𝐁𝐚𝐭𝐜𝐡 𝐞𝐥𝐢𝐠𝐢𝐛𝐥𝐞: 2022 and 2023 grads

𝐀𝐩𝐩𝐥𝐲: https://trellix.wd1.myworkdayjobs.com/en-US/EnterpriseCareers/job/Software-Engineer_JR0032175

𝐂𝐨𝐦𝐩𝐚𝐧𝐲 𝐍𝐚𝐦𝐞: NxtWave

𝐑𝐨𝐥𝐞: Content Developer

𝐁𝐚𝐭𝐜𝐡 𝐞𝐥𝐢𝐠𝐢𝐛𝐥𝐞: 2023 grads

𝐀𝐩𝐩𝐥𝐲: https://nxtwave.freshteam.com/jobs/OiL9lbPvROrz/content-developer-aptitude-and-programming-intern

𝐂𝐨𝐦𝐩𝐚𝐧𝐲 𝐍𝐚𝐦𝐞: GroundTruth

𝐑𝐨𝐥𝐞: Software Engineer Intern

𝐁𝐚𝐭𝐜𝐡 𝐞𝐥𝐢𝐠𝐢𝐛𝐥𝐞: 2023 and 2024 grads
𝐒𝐭𝐢𝐩𝐞𝐧𝐝: 32k - 35k per month

𝐀𝐩𝐩𝐥𝐲: https://www.groundtruth.com/job/4923253004-2/

Schneider Electric Hiring Data Analytics

Passout year : 2023, 2022, 2021 and before

Qualification: Any Graduation/ master Degree, in Engineering/MCA

Branch: ECE/EE/EEE

Salary: 9.5lpa ( Expected)

Application link  :  https://careers.se.com/global/jobs/008J93

HPE Hiring Data Analytics

Passout year : 2023, 2022, 2021 and before

Qualification: Any Graduation/ master Degree, in Engineering/MCA

Application link  :  https://careers.hpe.com/us/en/job/1144085/Data-Analyst

Are you a fresher who is Bengaluru based and interested in marketing or sales or AI/ML?

mirrAR is looking for talent like you.

Drop in your email to hr@mirrar.com marking jeevitha.m@mirrar.com in cc

We need immediate joiners. CTC offered would be 3-3.5LPA.

Message to all 2023, 2024 grads.

Do not stop your preparation after getting 1 offer, companies are revoking offers like a joke.

Bcoz once you stopped your preparation journey it will take 2-3 months to get back.

Be in safe side always:)

If you are a Student looking for an internship opportunity Please find below from Career page .

passout year: 2022, 2023, 2024, 2024, 2025, 2026


IBM Hiring SDE Intern( Work from Home)
Qualification Tag: pursuing BE/BTech/BS(CS/IT)/ME/Mtech/MCA
Salary: 30k - 40k per month ( Expected)
Apply now : https://careers.ibm.com/job/18698263/intern-software-engineer-remote/

Microsoft Hiring Research Intern
Qualification Tag: pursuing BE/BTech/BS(CS/IT)/ME/Mtech/MCA
Stipend: 1 lakh per month (Expected)
Apply now : https://jobs.careers.microsoft.com/us/en/job/1582723/Research-Intern

Oracle Hiring intern for multiple Role
Qualification Tag: pursuing BE/BTech/BS(CS/IT)/ME/Mtech/MCA
Salary: 50k per month
Apply now : https://careers.oracle.com/jobs/#en/sites/jobsearch/requisitions/preview/196625

Cisco Hiring Technical Consulting intern
Qualification Tag: pursuing BE/BTech/BS(CS/IT)/ME/Mtech/MCA
Salary: 50k per month ( Expected)
Apply now: https://jobs.cisco.com/jobs/ProjectDetail/Technical-Consulting-Engineer-Intern-India-UHR/1405181

Honeywell Hiring  software Engineer 1

https://www.linkedin.com/jobs/view/3659005814/

#Hiringalert

UI/UX Designer
WFO - Noida

Minimum 1yr of exp.

Design the Innovation platform for next Billion users.

CTC - Best in the Industry

https://www.linkedin.com/jobs/view/3659217594/

Anyone exam sprinkler OA on 13th?

Company Name: ClearTrip

Batch eligible: 2022 and earlier grad.

Role: SDE 1

Apply: https://www.linkedin.com/jobs/view/3656399033

Last Date : 14 July 2023
Apply Link : https://docs.google.com/forms/d/e/1FAIpQLSdcbfPNNj9UgT1XHz24WM0mg2a7P-zyYdq-BiF9lZBq937_BQ/viewform

Anyone give exam Microsoft OA Send Question here I will help

𝐂𝐨𝐦𝐩𝐚𝐧𝐲 𝐍𝐚𝐦𝐞: Microsoft

𝐑𝐨𝐥𝐞: SDE Intern

𝐁𝐚𝐭𝐜𝐡 𝐞𝐥𝐢𝐠𝐢𝐛𝐥𝐞: 2024 grads

𝐀𝐩𝐩𝐥𝐲: https://jobs.careers.microsoft.com/us/en/job/1577325/Software-Engineering---Internship-Opportunities?jobsource=linkedin

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