๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K 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
โœ…โœ…โœ…#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;
โœ…โœ…โœ…#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
โœ…โœ…โœ…#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
โœ…โœ…โœ…#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;
}
โœ…โœ…โœ…#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";
}
}
๐Ÿ“Œ 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
#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
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