Codeforces|Leetcode|Codechef free solutions
Open in Telegram
Free codeforces, Codechef, Leetcode solutions are available 😍😍😍😍😍😍 Helped More than 200+ students to crack coding round in 2022 and helped placed them in Good companies. 🥳🥳🥳🤩🤩🤩 Dm @Cpsoln if you want help in coding round.
Show more4 317
Subscribers
No data24 hours
-137 days
-5230 days
Posts Archive
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]==1 && a[i]<2){
a[i]++;
}
}
for(int i=0;i<n-1;i++){
if(a[i+1]%a[i]){
continue;
}
else{
a[i+1]++;
}
}
for(int i=0;i<n;i++){
cout<<a[i]<<" ";
}
cout<<endl;
}
int main(){
int t;
cin>>t;
while(t--){
solve();
}
}
long long kthLargestLevelSum(TreeNode* root, int k) {
vectorsums;
queueq;
q.push(root);
while(q.size()>0){
int l=q.size();
long long sum=0;
for(int i=0;ival;
if(top->left){
q.push(top->left);
}
if(top->right){
q.push(top->right);
}
}
sums.push_back(sum);
}
sort(sums.begin(),sums.end());
if(sums.size()
https://t.me/NetflixPremiumAccountsBot?start=r06612366224
To get free Netflix account click on the link🤩🤩
Puneet:
class Solution {
public:
int splitNum(int num) {
string s = to_string(num);
sort(s.begin(), s.end());
string a="", b="";
for(int i=0; i
class Solution {
public:
long long coloredCells(int n) {
return 1ll*(n)*(n) + 1ll*(n-1)*(n-1);
}
};
class Solution {
public:
int power(int i,int j,int p){
if(j==0){
return 1;
}
if(j==1){
return i;
}
long long ans=power(i,j/2,p);
ans=(ans*ans)%p;
if(j%2==1){
ans=(ans*i)%p;
}
return ans;
}
int countWays(vector>& ranges) {
sort(ranges.begin(),ranges.end());
vector> ans;
for(auto &i: ranges){
if(ans.size()==0 or ans.back()[1]
Click on the link you will definitely get Netflix premium.
https://t.me/NetflixPremiumAccountsBot?start=r06612366224
To get free Netflix account click on the link🤩🤩
https://t.me/NetflixPremiumAccountsBot?start=r06612366224
To get free Netflix account go to this🤩🤩
#include <bits/stdc++.h>
using namespace std;
int main()
{
int T;
cin >> T;
while (T--)
{
int n;
cin >> n;
string s;
cin >> s;
int ans = n - 1;
for (int i = 1; i < n - 1; i++)
{
char c = s[i];
if (s[i - 1] == s[i + 1])
{
ans--;
}
}
cout << ans << endl;
}
return 0;
}
Repost from Codeforces|Leetcode|Codechef free solutions
Contact me before your coding round and book your slot
100% solutions guaranteed 🔥🔥🔥🔥🔥
‼️‼️‼️‼️‼️‼️‼️‼️‼️‼️
Solution for all companies will be available
🎁🎁🎁🎁🎁🎁🎁🎁🎁🎁🎁
Get a special discount
Dm @Cpsoln
‼️‼️‼️‼️‼️‼️‼️‼️‼️‼️‼️‼️
Don't trust on other telegram channels they will take money and block you
Test is cancelled
So don't buy solutions from anyone
