allcoding1
22.4K subscribers
2.19K photos
2 videos
77 files
913 links
Download Telegram
Java
Telegram:- @allcoding1
👍1
October 2022 Jobs notifications 🔔
@allcoding1_official

🎯Infosys 9.5LPA

🎯TCS

🎯 Accenture 3.33LPA

🎯 Amazon 5LPA

🎯 cognizant 4.5 LPA

🎯 Capgemini 4LPA

🎯 Qualcomm 8LPA

🎯 Wipro

🎯 Zoho 4LPA

🎯Alter 6LPA

🎯IBM 5LPA

🎯HCL 4.25 LPA

🎯DXC 4LPA

🎯LTI 4LPA

🎯 KPMG 4LPA

@allcoding1_official

🎯Zeta 3LPA

🎯Theyve 3.5LPA

🎯 Emerson 4LPA

🎯Hexaware 4LPA

🎯 Global Logic 4.2LPA

🎯 Google 7.5LPA

🎯 Pepsico 7LPA

🎯 Phonepe 5LPA

🎯 Sutherland 5.5LPA


Guys♥️

Once check All notifications and apply Now👇👇👇👇

http://www.allcoding1.com


↗️Share with your friends and groups


Telegram:- @allcoding1
👍17👏3😁1
#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
👍13
n=int(input ())
k=0
for i in n:
k=i-80
print (k)


Telegram:- @allcoding1
👍4
🎯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
👍5
🎯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
👍8
Infosys SP and DSE codes. 21/10/22

C++
Lexicographically smallest code.

Telegram:- @allcoding1
👍9
Infosys SP and DSE . 21/10/22

C++
Entropy and dominant
Minimum Discomfort

Telegram:- @allcoding1
👍10🥰2
👍4
Python 3

Once check Output

Telegram:- @allcoding1
👍29👏8😁6🔥1
Python 3

Telegram:- @allcoding1
👎14👍111
Java language

Telegram:- @allcoding1
👍7
Java language

Telegram:- @allcoding1
👍6
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
👍25
Java language

Telegram:- @allcoding1
👍6