Minimum Cost (Atlasian) ✅

Atlasian Q2✅

vector<string>sol(vector<string>&a)
{
    int n=a.size();
    vector<string>ans;

    vector<int>vis(n,0);

    for(int i=0;i<n;i++)
    {
        string s=a[i];
        int cnt=0;
        for(int j=i;j>=max(0,i-4);j--)
        {
            if(a[j]==s)
            {
                if(!vis[j])
                {
                    cnt++;
                }
            }
        }

        if(cnt>2)
        {
            ans.push_back("{status: 429, message: Too many requests}");
            vis[i]=1;
            continue;
        }

        cnt=0;

        for(int j=i;j>=max(i-29,0);j--)
        {
            if(a[j]==s)
            {
                if(!vis[j])
                {
                    cnt++;
                }
            }
        }

        if(cnt>5)
        {
            ans.push_back("{status: 429, message: Too many requests}");
            vis[i]=1;
            continue;
        }

        ans.push_back("{status: 200, message: OK}");
    }

    return ans;
}

Atlassian Q1st ✅

Guys Anyone got OA link For hackerrank ?

Cradle point java

Company Name: Siemens Healthineers.

Last Date to apply: 7th Oct, 4:00 pm
Job Id: 389626 (Graduate Engineer Trainee)
Min CGPA: 6.5
Branches : B.E/B.Tech/MCA in CSE/ECE/EE/EEE graduating in 2024
No active backlogs

Kisi bhi employee se referral lelo and apply.

Company Name: WhiteCarrot

Role: Full Stack Developer Intern

Batch eligible: 2023 grads only

Apply: https://bit.ly/45mAI3E

RedHat Hiring Associate Software Engineer

Batch - 2022 or before

Link 🔗
https://global-redhat.icims.com/jobs/99686/associate-software-engineer/job?

#include <bits/stdc++.h>
using namespace std;
 
  bool check(int a,int b,map<int,vector<int>> m){
     
      if(a==b) return 1;
     
      for(auto &x : m[a]){
          if(check(x,b,m)) return 1;
      }
     
      return 0;
  }
  
  int main() {
   
   
    int n,l;
    cin>>n>>l;
   
    vector<int> v1(n) , v2(l);
    map<int,vector<int>> m;
    for(int i=0;i<n;i++){
         cin>>v1[i];
    }
    for(int i=0;i<l;i++){
        cin>>v2[i];
    }
   
    for(int i=0;i<n-1;i++){
        m[v1[i]].push_back(v1[i+1]);
    }
     for(int i=0;i<l-1;i++){
        m[v2[i]].push_back(v2[i+1]);
    }
  
   int a,b;
   cin>>a>>b;
  
   bool ok=check(a,b,m);
   if(ok){
       cout<<"YES";
   }else{
       cout<<"NO";
   }
  
  
  }

Shopping Spree ✅

Nasdaq hiring Software engineer
2024 Summer Internship – Technology Interns (Bangalore)

Duration : 8 weeks
batch - 2025/ 2026
Stipend - 50K /month
Apply - https://nasdaq.wd1.myworkdayjobs.com/en-US/Global_External_Site/job/India---Bangalore---Karnataka/XMLNAME-2024-Summer-Internship---Technology-Interns--Bangalore-_R0015197

Maximum Groups (Sap Labs)✅

Maximum Phone Number (Consultadd)

Minimum Moves To Sort Binary Array
IBM✅

#include <bits/stdc++.h>
#define MOD 1000000007

using namespace std;

int memo(int n,vector<int> &dp){
        if(n <= 1) return 1;
        else if(n==2) return 2;
        else if(n==3) return 4;
       
        if(dp[n] != -1) return dp[n];
       
        return dp[n] = (memo(n-1,dp) + memo(n-2,dp) + memo(n-3,dp))%MOD;
}

int climbStairs(int n) {
    vector<int> dp(n+1,-1);
    return memo(n,dp);
}

int main()
{
    cout<<climbStairs(4);

    return 0;
}

Stair
C++