Nine person

8) H

Deloitte exam ans

https://t.me/+sgf2nazHqhlkNmNl

#include <stdio.h>

struct Triangle {
    int side1;
    int side2;
    int side3;
};

int IdentifyTriangle(struct Triangle list[], int n) {
    if (list == NULL) {
        return -1;
    }

    int scaleneCount = 0;
    int isoscelesCount = 0;
    int notTriangleCount = 0;

    for (int i = 0; i < n; i++) {
        int s1 = list[i].side1;
        int s2 = list[i].side2;
        int s3 = list[i].side3;
        if ((s1 + s2 > s3) && (s1 + s3 > s2) && (s2 + s3 > s1)) {
            if (s1 != s2 && s2 != s3 && s1 != s3) {
                scaleneCount++;
            }
            else if (s1 == s2 s2 == s3 s1 == s3) {
                isoscelesCount++;
            }
        } else {
            notTriangleCount++;
        }
    }

    return (3 * scaleneCount) - (isoscelesCount + notTriangleCount);
}

Identify triangles

@allcoding1_official

int countBracketSequence(string s)
{
    int sum = 0;
    int n = s.size();
    for (int i = 0; i < n; i++)
    {
        if (s[i] == '(')
        {
            sum++;
        }
        else
        {
            sum--;
        }
    }
    int ans;
    if(sum!=1 && sum!=-1)
    {
        return 0;
    }
    if (sum < 0)
    {
        sum = 0;
        for (int i = 0; i < n; i++)
        {
            if (s[i] == '(')
            {
                sum++;
            }
            else
            {
                sum--;
            }
            if (sum < 0)
            {
                ans = i + 1;
                break;
            }
        }
    }
    else
    {
        sum = 0;
        int cnt = 0;
        for (int i = n - 1; i >= 0; i--)
        {
            if (s[i] == ')')
            {
                sum++;
            }
            else
            {
                sum--;
            }

            if (sum < 0)
            {
                ans = cnt + 1;
                break;
            }
            cnt++;
        }
    }

    return ans;
}

Bracket Sequence

@allcoding1_official

int maximizeRatings(vector<int> rating)
{
    int n=rating.size();
    int ans=0;
    for(int i=0;i<n;i++)
    {
        ans+=rating[i];
    }
    int dp[n];
    dp[n-1]=min(0,rating[n-1]);
    dp[n-2]=min(0,min(rating[n-1],rating[n-2]));
    for(int i=n-3;i>=0;i--)
    {
        dp[i]=min(rating[i]+dp[i+2],dp[i+1]);
    }
    return ans-dp[0];
}

Movie ratings

@allcoding1_official

long findSum(long cum[], int l, int r, int n)
{
    if (l == 0)
    {
        return cum[r];
    }
    return cum[r] - cum[l - 1];
}

long getThreeNonOverLappingIntervals(vector<int> starting, vector<int> ending)
{
    vector<pair<int, int>> vp;
    int n = starting.size();
    for (int i = 0; i < n; i++)
    {
        vp.push_back({starting[i], ending[i]});
    }
    sort(vp.begin(), vp.end());
    long dp[n];
    dp[n - 1] = 0;
    for (int i = n - 2; i >= 0; i--)
    {
        int l = i + 1;
        int r = n - 1;
        int pos = n;
        while (l <= r)
        {
            int mid = l + (r - l) / 2;
            if (vp[mid].first > vp[i].second)
            {
                pos = min(pos, mid);
                r = mid - 1;
            }
            else
            {
                l = mid + 1;
            }
        }
        dp[i] = n - pos;
    }
    long dp1[n];
    dp1[n - 1] = 0;
    dp1[n - 2] = 0;
    long ans = 0;

    long cum[n];
    cum[0] = dp[0];
    for (int i = 1; i < n; i++)
    {
        cum[i] = cum[i - 1] + dp[i];
    }
    for (int i = n - 3; i >= 0; i--)
    {
        int l = i + 1;
        int r = n - 1;
        int pos = n;
        while (l <= r)
        {
            int mid = l + (r - l) / 2;
            if (vp[mid].first > vp[i].second)
            {
                pos = min(pos, mid);
                r = mid - 1;
            }
            else
            {
                l = mid + 1;
            }
        }
        if(pos==n)
        {
            continue;
        }
        ans+=findSum(cum,pos,n-1,n);
    }
    return ans;
}

Non overlapping intervals

@allcoding1_official

int min(string str){
unordered_map<char,int>mp;
for(char :str){
  mp[ch]++;
}
unodered_set<int>d;
for(auto it:mp){
  d.insert(it.second);
}
return d.size();

}

Music Teacher
Only 4 test cases pass

Telegram:- @allcoding1_official

Chemical Factory

🎯Company : S&P Global

Role: Associate Software Engineer

Batch : 2022,2023

Apply: https://careers.spglobal.com/jobs/291161?lang=en-us

Telegram:- @allcoding1_official

🎯Mitsogo fresher hiring all batches

Apply:- https://www.mitsogo.com/career/opportunities-for-freshers/

Telegram:- @allcoding1_official

🎯Avasoft Walking hiring Drive Engineer Trainee

Location : Cheenai

https://forms.office.com/pages/responsepage.aspx?id=w4Nvcb16oUKG0uAgf0qpgR8XqsF7qqNNvrOkZCb6NMJUMEpRTkVYVzdRREhCTkVFU1ZJTDZCUkNENC4u

Telegram:- @allcoding1_official

Scammers

+91 93923 88258

🎯Numeus is Hiring

Role: Quantitative researcher
Batch- 2023 and before
Link-  https://boards.eu.greenhouse.io/numus/jobs/4083711101

Telegram:- @allcoding1_official

🎯ValueLabs is Hiring !!

Role: Frontend Developer

🔗Apply here: https://linkedin.com/jobs/view/3829198920/

🎯Accenture Biggest Hiring:

Role: PADA ( Packaged App Development Associate )

Eligibility: All streams/branches of B.E/B.Tech/M.E/M.Tech, MCA, and M.Sc. (CSE, IT only)

Graduation Year: 2023 / 2024
Experience: 0 Month - 11 Month

Salary: INR 4,60,700
Location: Bangalore, Hyderabad, Pune, Mumbai, Chennai, Gurugram, Kolkata, Indore, Jaipur, Coimbatore

Apply Now:- https://www.allcoding1.com/2024/02/accenture-hiring.html?m=1

If you are getting URL issue in above link then use this alternate link:

Alternate Apply Now:- https://www.allcoding1.com/2024/02/accenture-hiring.html?m=1


Telegram:- @allcoding1_official

🎯Accenture Hiring System and Application Services Associate:

Eligibility: All streams/branches of  B.Sc., BCA, BBA, B.A, B.Com, B.Voc, BMS, B.B.S, B.F.M, B.B.I, B.A.F, B.Ed., B.M.M., B.FA, , B.S.Micr ,B. Design, M.C.M, M.Sc (Non-CS/IT), M.A, M.Com or M.FA

Note: BE/ BTECH / ME / MTECH/MCA/ MSC (CS and IT Branch) MBA /PGDBM candidates are not eligible to apply for this role

Graduation Year: 2023 / 2024
Experience: 0 Month - 11 Month

Salary: INR 3,44,200
Location: Bangaluru, Hyderabad, Chennai, Coimbatore, Gurugram, Pune, Kolkata, Nagpur, Indore, Mumbai, Jaipur

Apply now:- https://www.allcoding1.com/2024/02/accenture-hiring.html?m=1


Telegram:- @allcoding1_official

🎯Axa XL Off Campus Drive 2024 Hiring Graduate Trainee | 12-14 LPA*

Job Title : Graduate Trainee – IDA
Qualification : B.E/B.Tech/BSC/MCA/M.Tech or Related
Batch : 2024/2023
Salary : 12-14 LPA

Apply Now :

https://careers.axa.com/global/en/job/AXGRGLOBAL13004910D20230622MYHRTALEOENEXTERNALENGLOBAL/Graduate-Trainee-IDA

Apply now:- @allcoding1_official