Any campus placement or Offcampus Exam.
Help available in All exams.
Book your slot.๐จโ๐ป
Contact @ILOVEU_143โ
Its paid โ
100% clearance guarantee ๐ฅ๐ฅ
Share @Coding_000 โค๏ธ
Help available in All exams.
Book your slot.๐จโ๐ป
Contact @ILOVEU_143โ
Its paid โ
100% clearance guarantee ๐ฅ๐ฅ
Share @Coding_000 โค๏ธ
๐2๐ฅฐ1
Guys!!
If you are seriously looking for good job opportunities,
https://practice.geeksforgeeks.org/contest/job-a-thon-20-hiring-challenge
Do participate :) ๐ฅ
If you are seriously looking for good job opportunities,
https://practice.geeksforgeeks.org/contest/job-a-thon-20-hiring-challenge
Do participate :) ๐ฅ
practice.geeksforgeeks.org
Contest | Job-A-Thon 20 - Hiring Challenge
With over 1500+ candidates placed in 200+ companies in the last 1 year, Job-A-Thon brings you yet another chance to get placed in top companies. Times may get tough, but for you, Job-A-Thon will be enough!
Watch the Post Contest Analysis - Live:
Mentorโฆ
Watch the Post Contest Analysis - Live:
Mentorโฆ
๐1
class Solution{
public:
long long refueling(int X)
{
long long a, b;
for(int i=0; i<X; i++){
a = pow(2,i);
if(a == X)return a;
else if(a>X){
b = pow(2,i-1);
if(abs(X-a) == abs(X-b))return a;
if(abs(X-a) < abs(X-b))return a;
else return b;
}
}
return -1;
}
};
C++
Refueling
public:
long long refueling(int X)
{
long long a, b;
for(int i=0; i<X; i++){
a = pow(2,i);
if(a == X)return a;
else if(a>X){
b = pow(2,i-1);
if(abs(X-a) == abs(X-b))return a;
if(abs(X-a) < abs(X-b))return a;
else return b;
}
}
return -1;
}
};
C++
Refueling
๐1
class Solution{
public:
string kPeriodic(string s, int K){
// code here
map<char,int> hm;
for(int i=0;i<s.size();i++){
hm[s[i]]++;
}
int n= s.size();
int res= n/__gcd(n,K);
for(auto t:hm){
if(t.second % res)
return "-1";
}
string p="";
for(auto t:hm){
int pre=t.second/res;
while(pre--)
p+=t.first;
}
string ans="";
while(res--)
ans+=p;
return ans;
}
};
C++
K-Periodic Circular String
Second
GFG Weekly Coding Contest 103
public:
string kPeriodic(string s, int K){
// code here
map<char,int> hm;
for(int i=0;i<s.size();i++){
hm[s[i]]++;
}
int n= s.size();
int res= n/__gcd(n,K);
for(auto t:hm){
if(t.second % res)
return "-1";
}
string p="";
for(auto t:hm){
int pre=t.second/res;
while(pre--)
p+=t.first;
}
string ans="";
while(res--)
ans+=p;
return ans;
}
};
C++
K-Periodic Circular String
Second
GFG Weekly Coding Contest 103
๐2
Guys share the screenshot in large groups and Share with your friends โ
๐ฅ @whitehatcodingโค๏ธ
I don't see anyone sharing ๐ฅฒ
I don't see anyone sharing ๐ฅฒ
๐1
class Solution {
public:
int finalDestination(int N, int M, int K, vector<vector<int>> &Roads) {
// code here
vector<vector<pair<int, int>>> adjList(N);
for (int i = 0; i < N; i++) {
adjList[i] = vector<pair<int, int>>();
}
for (vector<int>& road : Roads) {
int cityA = road[0];
int cityB = road[1];
int weight = road[2];
adjList[cityA].push_back(make_pair(cityB, weight));
}
vector<vector<int>> dp(N, vector<int>(K + 1, INT_MAX));
dp[0][0] = 0;
for (int k = 0; k <= K; k++) {
for (int i = 0; i < N; i++) {
if (dp[i][k] != INT_MAX) {
for (pair<int, int>& neighbor : adjList[i]) {
int nextCity = neighbor.first;
int weight = neighbor.second;
if (k + 1 <= K) {
dp[nextCity][k + 1] = min(dp[nextCity][k + 1], dp[i][k] + weight / 2);
}
dp[nextCity][k] = min(dp[nextCity][k], dp[i][k] + weight);
}
}
}
}
int minFuel = INT_MAX;
for (int k = 0; k <= K; k++) {
minFuel = min(minFuel, dp[N - 1][k]);
}
return minFuel == INT_MAX ? -1 : minFuel;
}
};
public:
int finalDestination(int N, int M, int K, vector<vector<int>> &Roads) {
// code here
vector<vector<pair<int, int>>> adjList(N);
for (int i = 0; i < N; i++) {
adjList[i] = vector<pair<int, int>>();
}
for (vector<int>& road : Roads) {
int cityA = road[0];
int cityB = road[1];
int weight = road[2];
adjList[cityA].push_back(make_pair(cityB, weight));
}
vector<vector<int>> dp(N, vector<int>(K + 1, INT_MAX));
dp[0][0] = 0;
for (int k = 0; k <= K; k++) {
for (int i = 0; i < N; i++) {
if (dp[i][k] != INT_MAX) {
for (pair<int, int>& neighbor : adjList[i]) {
int nextCity = neighbor.first;
int weight = neighbor.second;
if (k + 1 <= K) {
dp[nextCity][k + 1] = min(dp[nextCity][k + 1], dp[i][k] + weight / 2);
}
dp[nextCity][k] = min(dp[nextCity][k], dp[i][k] + weight);
}
}
}
}
int minFuel = INT_MAX;
for (int k = 0; k <= K; k++) {
minFuel = min(minFuel, dp[N - 1][k]);
}
return minFuel == INT_MAX ? -1 : minFuel;
}
};
๐5โค2
Guys share the screenshot in large groups and Share with your friends โ
๐ฅ @CODING_000โค๏ธ
I don't see anyone sharing ๐ฅฒ
I don't see anyone sharing ๐ฅฒ
๐2
FINAL DESTINATION CODE
๐2
๐๐๐ ๐๐๐ญ๐ ๐ฌ๐๐ข๐๐ง๐๐
๐ ๐๐ฅ๐จ๐ฎ๐ ๐ ๐ฎ๐ซ๐ฎ
๐๐ฅ๐จ๐ ๐ ๐ข๐ง๐ ๐ฑ
๐๐ ๐ฆ๐๐ฌ๐ญ๐๐ซ ๐๐๐๐๐๐ฆ๐ฒ
๐๐จ๐๐ ๐ฐ๐ข๐ญ๐ก ๐๐จ๐ฌ๐ก
๐๐จ๐๐๐๐๐ญ๐๐ซ๐ญ๐ฎ๐ฉ
๐๐ซ.๐๐๐๐ง ๐ฅ๐๐๐ญ๐ฎ๐ซ๐๐ฌ
๐๐ซ.๐๐๐ฃ๐๐๐ ๐ฅ๐๐๐ญ๐ฎ๐ซ๐๐ฌ
๐๐๐ฏ๐ ๐๐ซ๐๐ข๐ง๐ฌ
๐ฃ๐๐ฏ๐๐ฌ๐ฉ๐๐๐ข๐๐ฅ๐ข๐ฌ๐ญ๐ฌ
๐๐๐ญ๐ ๐๐ง๐ ๐ข๐ง๐๐๐ซ๐ข๐ง๐
๐๐ซ๐ข๐ฌ ๐๐จ๐ฎ๐ซ๐ฌ๐๐ฌ
๐๐๐ฅ๐ฅ ๐๐๐๐๐๐ฆ๐ฒ
๐๐๐ง๐ญ๐๐ฌ๐ญ๐๐ซ
๐๐๐๐๐๐ฆ๐ฒ
๐๐ซ๐๐ฉ๐ข๐ง๐ฌ๐ญ๐
๐๐ฉ๐ ๐ซ๐๐
๐๐๐ซ๐จ๐๐๐ฒ๐ฌ๐ญ๐๐ซ๐ฒ
๐๐ฅ๐ฅ ๐ฉ๐ซ๐๐ฆ๐ข๐ฎ๐ฆ ๐๐จ๐ฎ๐ซ๐ฌ๐๐ฌ ๐๐ฏ๐๐ข๐ฅ๐๐๐ฅ๐ ๐๐ญ ๐๐๐๐ซ๐ฌ ๐จ๐ง๐ฅ๐ฒ ๐คฉ
๐๐ ๐ฎ ๐ซ ๐ข๐ง๐ญ๐๐ซ๐ญ๐๐ฌ๐ญ๐๐ ๐๐ฆ @ILOVEU_143โ
๐๐ก๐ข๐ฌ ๐๐จ๐ฎ๐ซ๐ฌ๐๐ฌ ๐ก๐๐ฅ๐ฉ ๐ฒ๐จ๐ฎ ๐ญ๐จ ๐๐๐ฌ๐ญ๐๐ซ ๐ข๐ง ๐ฉ๐ซ๐จ๐ ๐ซ๐๐ฆ๐ฆ๐ข๐ง๐ ๐คฉ๐
๐ ๐๐ฅ๐จ๐ฎ๐ ๐ ๐ฎ๐ซ๐ฎ
๐๐ฅ๐จ๐ ๐ ๐ข๐ง๐ ๐ฑ
๐๐ ๐ฆ๐๐ฌ๐ญ๐๐ซ ๐๐๐๐๐๐ฆ๐ฒ
๐๐จ๐๐ ๐ฐ๐ข๐ญ๐ก ๐๐จ๐ฌ๐ก
๐๐จ๐๐๐๐๐ญ๐๐ซ๐ญ๐ฎ๐ฉ
๐๐ซ.๐๐๐๐ง ๐ฅ๐๐๐ญ๐ฎ๐ซ๐๐ฌ
๐๐ซ.๐๐๐ฃ๐๐๐ ๐ฅ๐๐๐ญ๐ฎ๐ซ๐๐ฌ
๐๐๐ฏ๐ ๐๐ซ๐๐ข๐ง๐ฌ
๐ฃ๐๐ฏ๐๐ฌ๐ฉ๐๐๐ข๐๐ฅ๐ข๐ฌ๐ญ๐ฌ
๐๐๐ญ๐ ๐๐ง๐ ๐ข๐ง๐๐๐ซ๐ข๐ง๐
๐๐ซ๐ข๐ฌ ๐๐จ๐ฎ๐ซ๐ฌ๐๐ฌ
๐๐๐ฅ๐ฅ ๐๐๐๐๐๐ฆ๐ฒ
๐๐๐ง๐ญ๐๐ฌ๐ญ๐๐ซ
๐๐๐๐๐๐ฆ๐ฒ
๐๐ซ๐๐ฉ๐ข๐ง๐ฌ๐ญ๐
๐๐ฉ๐ ๐ซ๐๐
๐๐๐ซ๐จ๐๐๐ฒ๐ฌ๐ญ๐๐ซ๐ฒ
๐๐ฅ๐ฅ ๐ฉ๐ซ๐๐ฆ๐ข๐ฎ๐ฆ ๐๐จ๐ฎ๐ซ๐ฌ๐๐ฌ ๐๐ฏ๐๐ข๐ฅ๐๐๐ฅ๐ ๐๐ญ ๐๐๐๐ซ๐ฌ ๐จ๐ง๐ฅ๐ฒ ๐คฉ
๐๐ ๐ฎ ๐ซ ๐ข๐ง๐ญ๐๐ซ๐ญ๐๐ฌ๐ญ๐๐ ๐๐ฆ @ILOVEU_143โ
๐๐ก๐ข๐ฌ ๐๐จ๐ฎ๐ซ๐ฌ๐๐ฌ ๐ก๐๐ฅ๐ฉ ๐ฒ๐จ๐ฎ ๐ญ๐จ ๐๐๐ฌ๐ญ๐๐ซ ๐ข๐ง ๐ฉ๐ซ๐จ๐ ๐ซ๐๐ฆ๐ฆ๐ข๐ง๐ ๐คฉ๐
๐4๐คฉ1
Societe Generaleโ
๐๐ ๐ฎ๐บ ๐ต๐ฒ๐น๐ฝ ๐ฎ๐๐ฎ๐ถ๐น๐ฎ๐ฏ๐น๐ฒ ๐ฅ๐ฏ
๐๐ผ๐ผ๐ธ ๐๐ผ๐๐ฟ ๐๐น๐ผ๐
๐๐ผ๐ป๐act Me @ILOVEU_143 โค๏ธ
๐คฉ ๐ง๐ฒ๐๐ ๐๐น๐ฒ๐ฎ๐ฟ๐ฎ๐ป๐ฐ๐ฒ ๐๐๐ฎ๐ฟ๐ฎ๐ป๐๐ฒ๐ฒ๐ฑ โ ๐ฌ๐ผ๐๐ฟ ๐๐ผ๐ฏ ๐ข๐๐ฟ ๐ฅ๐ฒ๐๐ฝ๐ผ๐ป๐๐ถ๐ฏ๐ถ๐น๐ถ๐๐ ๐
๐๐จ๐ข๐ง ๐๐ง๐ ๐ฌ๐ก๐๐ซ๐ ๐จ๐ฎ๐ซ ๐๐ก๐๐ง๐ง๐๐ฅ
https://t.me/Coding_000 โค๏ธ
๐๐ ๐ฎ๐บ ๐ต๐ฒ๐น๐ฝ ๐ฎ๐๐ฎ๐ถ๐น๐ฎ๐ฏ๐น๐ฒ ๐ฅ๐ฏ
๐๐ผ๐ผ๐ธ ๐๐ผ๐๐ฟ ๐๐น๐ผ๐
๐๐ผ๐ป๐act Me @ILOVEU_143 โค๏ธ
๐คฉ ๐ง๐ฒ๐๐ ๐๐น๐ฒ๐ฎ๐ฟ๐ฎ๐ป๐ฐ๐ฒ ๐๐๐ฎ๐ฟ๐ฎ๐ป๐๐ฒ๐ฒ๐ฑ โ ๐ฌ๐ผ๐๐ฟ ๐๐ผ๐ฏ ๐ข๐๐ฟ ๐ฅ๐ฒ๐๐ฝ๐ผ๐ป๐๐ถ๐ฏ๐ถ๐น๐ถ๐๐ ๐
๐๐จ๐ข๐ง ๐๐ง๐ ๐ฌ๐ก๐๐ซ๐ ๐จ๐ฎ๐ซ ๐๐ก๐๐ง๐ง๐๐ฅ
https://t.me/Coding_000 โค๏ธ
๐2
https://goo.gle/girl-hackathon-website-2023
FROM 2024-2027 BATCHES
Girls Register Soon
Share @Coding_000โค๏ธ
FROM 2024-2027 BATCHES
Girls Register Soon
Share @Coding_000โค๏ธ
๐3
Any one want projects -mini or Major ๐ Unique project๐ฅ๐ฅ
Domain AI/ML
contact -@ILOVEU_143 โค๏ธ
Anyone need help in GRE and TOFEL, GMAT, DUOLINGO Exam help ๐จโ๐ป๐จโ๐ป
SOP , LORโ๐
Note -paid ๐ค
shareโ share โ @Coding_000
Domain AI/ML
contact -@ILOVEU_143 โค๏ธ
Anyone need help in GRE and TOFEL, GMAT, DUOLINGO Exam help ๐จโ๐ป๐จโ๐ป
SOP , LORโ๐
Note -paid ๐ค
shareโ share โ @Coding_000
๐3
๐๐
๐ฎ๐บ ๐ต๐ฒ๐น๐ฝ ๐ฎ๐๐ฎ๐ถ๐น๐ฎ๐ฏ๐น๐ฒ ๐ฅ๐ฏ
๐๐ผ๐ผ๐ธ ๐๐ผ๐๐ฟ ๐๐น๐ผ๐
๐๐ผ๐ป๐act Me @ILOVEU_143 โค๏ธ
๐คฉ ๐ง๐ฒ๐๐ ๐๐น๐ฒ๐ฎ๐ฟ๐ฎ๐ป๐ฐ๐ฒ ๐๐๐ฎ๐ฟ๐ฎ๐ป๐๐ฒ๐ฒ๐ฑ
๐๐จ๐ข๐ง ๐๐ง๐ ๐ฌ๐ก๐๐ซ๐ ๐จ๐ฎ๐ซ ๐๐ก๐๐ง๐ง๐๐ฅ
@Coding_000 โค๏ธ
๐๐ผ๐ผ๐ธ ๐๐ผ๐๐ฟ ๐๐น๐ผ๐
๐๐ผ๐ป๐act Me @ILOVEU_143 โค๏ธ
๐คฉ ๐ง๐ฒ๐๐ ๐๐น๐ฒ๐ฎ๐ฟ๐ฎ๐ป๐ฐ๐ฒ ๐๐๐ฎ๐ฟ๐ฎ๐ป๐๐ฒ๐ฒ๐ฑ
๐๐จ๐ข๐ง ๐๐ง๐ ๐ฌ๐ก๐๐ซ๐ ๐จ๐ฎ๐ซ ๐๐ก๐๐ง๐ง๐๐ฅ
@Coding_000 โค๏ธ
๐2
โ๏ธโ๏ธโ๏ธโ๏ธVelotio calling candidates for Interviewโ๏ธโ๏ธโ๏ธ Keep your Phone onโ๏ธโ๏ธโ๏ธโ๏ธ
๐5
AMAZING OPPORTUNITY FOR ONGOING ABROAD STUDENTS:
PROFESSIONAL WRITERS AVALABLE FOR
1. SOP
2. RESUME
3. LOR
4. ALL DOCUMENT WRITERS
CONTACT - @ILOVEU_143 FOR MORE DETAILED INFO๐จโ๐ป
DONT MISS๐คฉ๐๐คฉ
PROFESSIONAL WRITERS AVALABLE FOR
1. SOP
2. RESUME
3. LOR
4. ALL DOCUMENT WRITERS
CONTACT - @ILOVEU_143 FOR MORE DETAILED INFO๐จโ๐ป
DONT MISS๐คฉ๐๐คฉ
๐3
Guys anyone need help in ๐๐
๐ธA๐ป๐ ๐ฝ๐น๐ฎ๐ฐ๐ฒ๐บ๐ฒ๐ป๐ ๐ฒ๐ ๐ฎ๐บ help available โ
๐ฏ% clearance will be provided
๐ธContact : @ILOVEU_143โค๏ธ to book slot for any placement exam.
๐ธA๐ป๐ ๐ฝ๐น๐ฎ๐ฐ๐ฒ๐บ๐ฒ๐ป๐ ๐ฒ๐ ๐ฎ๐บ help available โ
๐ฏ% clearance will be provided
๐ธContact : @ILOVEU_143โค๏ธ to book slot for any placement exam.
๐3