𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅ Uber Sums Divisible By K - C++ Solutions

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

int sumsDivisibleByK(int A[], int n, int K)
{
  int freq[K] = { 0 };
  for (int i = 0; i < n; i++)
    ++freq[A[i] % K];
  int sum = freq[0] * (freq[0] - 1) / 2;
  for (int i = 1; i <= K / 2 && i != (K - i); i++)
    sum += freq[i] * freq[K - i];
  if (K % 2 == 0)
    sum += (freq[K / 2] * (freq[K / 2] - 1) / 2);
  return sum;
}
int main()
{

  int A[] = { 1,2,3,4,5 };
  int n = sizeof(A) / sizeof(A[0]);
  int K = 3;
  cout << sumsDivisibleByK(A, n, K);
  return 0;
}

566 viewsサンケットクマール, 15:01

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerRank Largest Number of Orders - SQL Solutions

select z
from (select x.customer_ID as z,
                    count(x.customer_ID) as l
from Orders x, Orders y
where x.ID = y.ID
group by x.customer_ID
order by l desc)
where rownum = 1;

577 viewsサンケットクマール, 15:01

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Maximum Similarity - C++ HackerEarth Solutions

#include <bits/stdc++.h>

using namespace std;
int main()
{
    int t;
    cin>>t;

    while(t--)
    {
        string str1, str2;
        cin>>str1>>str2;

        map<char,int> mp2;

        for(int i=0;i<str2.size();i++)
        mp2[str2[i]]++;

        int result=0;

        for(int i=0;i<str1.size();i++)
        {
            if(mp2[str1[i]]>0)
            {
                result++;
                mp2[str1[i]]--;
            }

            else
            break;
        }
        cout<<result<<endl;
    }
    return 0;
}

❤1

642 viewsサンケットクマール, 15:02

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerRank Metro Land Festival - C++ HackerRank Solution

int cost(x, y, a, b) {
   return (abs(x-a)+abs(y-b));
}
int minimizeCost(vector<int> numpeople, vector<int> x, vector<int> y){
    vector<int> xx, yy;
    int ans = 0;
    for(int i = 0 ; i < numpeople.size();i++){
        int count = numpeople[i];
        while(count--){
            xx.push_back(x[i]);
            yy.push_back(y[i]);
        }
    }

    sort(xx.begin(), xx.end());
    sort(yy.begin(), yy.end());
    int mx, my;

    mx = xx[xx.size() / 2];
    my = yy[yy.size() / 2];

    for(int i = 0; i < numpeople.size();  i++){
        ans += numpeople[i] * cost(mx, my, x[i], y[i]);
    }
    return ans;
}

👍2

643 viewsサンケットクマール, 15:03

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerRank Highly Profitable Months - HackerRank C++ Solutions

int countHighlyProfitableMonths(vector<int> stockPrices,int k){
    int n=stockPrices.size(),count=1;
    vector<int> a;
    for(int i=0;i+1<n;i++){
        if(stockPrices[i+1]>stockPrices[i])
            count+=1;
        else{
            a.push_back(count);
            count=1;
        }
    }
    a.push_back(count);
    int ans=0;
    for(auto x:a){
        if(x>=k)
            ans+=(x-k+1);
    }
    return ans;
}

657 viewsサンケットクマール, 15:03

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Coin collector - C++ HackerEarth Solutions

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

long long solve (int N, vector<long long> A, int X) {
    vector<long long>dp(N);     
    long long best_odd_score, best_even_score;
    if (A[0] % 2 == 0)
        best_even_score = A[0], best_odd_score = -X;
    else
        best_odd_score = A[0], best_even_score = -X;
    for (int i = 1; i < N; i++)
    {
        if (A[i] % 2)
        {
            dp[i] = max(best_odd_score + A[i], best_even_score - X + A[i]);
            best_odd_score = max(best_odd_score, dp[i]);
        }
        else
        {
            dp[i] = max(best_even_score + A[i], best_odd_score - X + A[i]);
            best_even_score = max(best_even_score, dp[i]);
        }
    }
    return dp[N - 1];
}

int main() {

    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    for (int t_i = 0; t_i < T; t_i++)
    {
        int N;
        cin >> N;
        vector<long long> A(N);
        for (int i_A = 0; i_A < N; i_A++)
        {
            cin >> A[i_A];
        }
        int X;
        cin >> X;

        long long out_;
        out_ = solve(N, A, X);
        cout << out_;
        cout << "\n";
    }
}

793 viewsサンケットクマール, 15:04

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

🔔 ReNew Power Off Campus Drive 2022 : Hiring Freshers as Graduate Engineer Trainees With 6 LPA

* Job Role : Graduate Engineer Trainees
* Qualification : B.E/ B.Tech
* Experience : Freshers
* CTC : 5 – 6 LPA

https://fresherearth.blogspot.com/2022/03/ReNew-Power-Off-Campus-Drive-2022-Hiring-Freshers-as-Graduate-Engineer-Trainees-With-6-LPA.html

FresherEarth - Get All Latest Jobs Here

ReNew Power Off Campus Drive 2022 : Hiring Freshers as Graduate Engineer Trainees With 6 LPA

fresher jobs, freshers jobs, off campus jobs, latest fresher jobs, fresher jobs bangalore, fresher jobs hyderabad, latest walk in drive

814 viewsサンケットクマール, 17:57

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

📌Cognizant Group Discussion Topics:

1)Fast food culture
2)Covid 19
3)Ukraine russia war
4)Women empowerment
5)Digital india

788 viewsDushyant, 01:48

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

📌 WIPRO INTERVIEW EXPERIENCE(Mechanical)

1- why you want to join wipro as a mechanical background
2- what is cloud computing
3- what is machine learning
4- what is diff between C ++ and C
5- what is encapsulation
6- what is deep learning
7- What is algorithm of determine Prime No.
8- what is torque
9- what is your challenges
10- what is your achievement
11- do you able to relocate
12- what is 10,12,btech percentage
13-introduction
14- what programming languages you know

882 viewsDushyant, 02:29

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

🔔 Infosys Off Campus Drive | Systems Engineer | 3.6 LPA

* Job Role : Systems Engineer
* Education : BE/BTech/ME/MTech/MCA/MSc
* Batch : 2019/2020/2021/2022
* CTC : 3.6 LPA

https://fresherearth.blogspot.com/2022/03/Infosys-Off-Campus-Drive-Systems-Engineer-3.6-LPA.html

FresherEarth - Get All Latest Jobs Here

Infosys Off Campus Drive | Systems Engineer | 3.6 LPA

fresher jobs, freshers jobs, off campus jobs, latest fresher jobs, fresher jobs bangalore, fresher jobs hyderabad, latest walk in drive

869 viewsサンケットクマール, 06:58

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

🔔Accenture Associate Software Engineer Hiring | 4.5 LPA

Job Role: Associate Software Engineer
Qualification: BE/BTech/BCA/B.Com/BSc/BBA/BA
Year Of Passing: 2019/2020/2021/2022
Experience: Freshers
Location : Bangalore, Hyderabad, Chennai, Pune
Salary : 4.5 LPA

https://fresherearth.blogspot.com/2022/03/Accenture-Associate-Software-Engineer-Hiring-4.5-LPA.html

FresherEarth - Get All Latest Jobs Here

Accenture Associate Software Engineer Hiring | 4.5 LPA

fresher jobs, freshers jobs, off campus jobs, latest fresher jobs, fresher jobs bangalore, fresher jobs hyderabad, latest walk in drive

981 viewsサンケットクマール, 09:00

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

https://docs.google.com/forms/d/e/1FAIpQLSemzff1LD5AqVdm3OX1l7pDr9XDI2HezmMttX92k0Yo2q-ALg/viewform

2022 and previous batches eligible.

2.15K viewsDushyant, 10:59

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

#interviewhacks

✅ Don’t confuse a job interview with a job offer
✅ Avoid trashing your previous jobs
✅ Research the company in advance
✅ Mind your body language
✅ Don’t expect an offer right away

934 viewsサンケットクマール, 15:24

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

C++✅(IBM)

1.91K viewsDushyant, 05:42

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

C++
IBM✅
Extract user message from transcript

1.88K viewsDushyant, 05:49

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

C++(IBM)

782 viewsDushyant, 05:58

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Photo

C++✅

1.91K viewsDushyant, 06:01

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Cost of path ✅
Python 3(IBM)

👍1

1.92K viewsDushyant, edited 06:03

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Accenture 4PM Slot :

English ability

1)q) my frd
A

2)q) the plane
Over
D

3)q) she lay down
Sleep
B

4)q) if you
Were being
A

5)q) find a door
Found
B

6)q) no sooner
Rigining
D

7)q) India
A wealth off
B

8)every year
An acre
B

9) q) paradox
Contradiction
A

10)q) oblivion
Alart

11)q)treason
Fidelity

12)q) the teacher
Consen
D

13)the reformer
Cbad

14)q) many people
Will
A

15)q) pariris
To jusfiy
B

16)q) assumption
Elaborate
A

17)q) one of the claims
Lavish
D

👍2

800 viewsDushyant, edited 11:05

About

Blog

Apps

Platform