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

void solve(){
vector<int> ans;
string s;
cin>>s;
string c;
cin>>c;
int m=c.size();
int n=s.size();
int i=0;
int j=0;
while(i<n){
ans.allcoding_back((s[i]-'a')+1 +(c[j]-'0'));
j = (j+1)%m;
i++;
}

for(auto &it: ans ) {
cout<<it <<" ";
}
}

int main() {
solve();
return 0;
}

C++

Telegram:- @allcoding1

n=int(input ())
k=0
for i in n:
k=i-80
print (k)


Telegram:- @allcoding1

🎯Sagility Hiring Software Engineer with 5.5 LPA

Job Role : Associate Software Engineer
Education : Any Graduate
Batch : Any
CTC : 4.5-5.5 LPA

Apply Now:- http://www.allcoding1.com

Telegram:- @allcoding1

🎯Baker Hughes Off-Campus Drive 2023 | ASPIRE Early Career Program

Job Role : Engineering & Technology, Field Engineer, Supply Chain, Finance
Experience : Freshers/0-3 Years
Education : BE/B.Tech
CTC : 6 LPA

Apply Now:- http://www.allcoding1.com

Telegram:- @allcoding1

Infosys SP and DSE codes. 21/10/22

C++
Lexicographically smallest code.

Telegram:- @allcoding1

Infosys SP and DSE . 21/10/22

C++
Entropy and dominant
Minimum Discomfort

Telegram:- @allcoding1

infosys exam

22oct_discussion_group

@allcoding1 @allcoding1
@allcoding1 @allcoding1
@allcoding1 @allcoding1

Python 3

Once check Output

Telegram:- @allcoding1

Infosys exam Answer's
(22/10/22)


https://www.joboffersadda.com/2022/01/infosys-exam-answer.html?m=1

https://www.joboffersadda.com/2022/01/infosys-exam-answer.html?m=1

https://www.joboffersadda.com/2022/01/infosys-exam-answer.html?m=1

Telegram:- @Infosys_Ans

from itertools import permutations

def count(arr):
    z=[]
    perm = permutations(arr)
    
    for i in list(perm):
        z.append(list(i))
    q=[]
    
    for i in range(len(arr)-1):
        x,y=arr[i],arr[i+1]
        
        for j in range(len(z)):
            if z[j].index(x)!=len(z[j])-1:
                if z[j][z[j].index(x)+1]==y:
                    q.append(z[j])
                    
    for i in range(len(q)):
         if q[i] in z:
             z.remove(q[i])
    return len(z)
a= int(input())
b=list(map(int,input().strip().split()))
print(count(b))

Python
Telegram - @allcoding1

if (n > k && n > a)
{
printf("N is the Biggest number is %d", n);
return n;
}
if (k > n && k > a)
{
printf("k is the Biggest number is %d", k);
return k;
}
if (a > n && a > k)
{
printf("a is the Biggest number is %d", a);
return a;
}

Telegram:- @allcoding1

Python

Find Minimum Distance Between two numbers in Array code

Telegram:- @allcoding1