Channel address:
Categories:
Technologies
Language: English
Subscribers:
141.49K
Description from channel
Codingsolution_it
#coding
#codingsolution
#codingsolutionhelp
#codingsolutionit
#coding_solution_help
#codingsolutionhelpit
Codingsolution
#Coding_solution
#Coding_solution_it
#Coding solution help
Codingsolutionhelp
#Coding solution it
#codingsol
coding
Ratings & Reviews
Reviews can be left only by registered users. All reviews are moderated by admins.
5 stars
0
4 stars
2
3 stars
0
2 stars
1
1 stars
0
The latest Messages 6
2021-10-24 11:02:25
Python
Min element
Telegram - t.me/coding_solution_help
14.4K views08:02
2021-10-21 16:14:31
WIPRO & ATOS EXAM TOMORROW DISCUSSION GROUP
@infosys_wipro_atos_syntel_exam
8.1K viewsedited 13:14
2021-10-21 16:13:30
CAPGEMINI & GLOBAL EDGE EXAM TOMORROW DISCUSSION GROUP
@infosys_global_edge_capgemini
8.0K views13:13
2021-10-21 08:10:10
1:- shiv and lucky
n=int(input())
a=input()
arr=[]
less=0
more=0
equal=0
cap=0
for i in a:
if i.isupper():
cap+=1
break
a=a.lower()
for i in range(len(a)//2):
if(a[i]
less+=1
elif(a[i]==a[len(a)-i-1]):
equal+=1
else:
more+=1
print(n//2-max([less,more,equal])+cap)
2:-Number game
n=int(input())
l=[]
for i in range(n):
l.append(int(input()))
b=[]
d=l[:]
d.sort(reverse=True)
if(l==d or l==sorted(l)):
b=[-1 for i in range(len(l))]
else:
for i in range(len(l)):
c=[]
for j in range(i+1,len(l)):
if(len(c)==0 and l[i] c.append(l[j])
if len(c)==1 and l[j] b.append(l[j])
c.pop()
break
else:
b.append(-1)
for i in b:
print(i,end=" ")
3:- win the coupoun
n=int(input())
l=[]
count=0
for i in range(n):
l.append(input().strip())
for i in range(n):
for j in range(i+1,n):
set1=set(l[i])
set2=set(l[j])
set1.update(set2)
if len(set1)==10:
count+=1
print(count)
4:- vivek and dilema
tn=int(input())
for i in range(0,tn):
nm=int(input())
lc=list(map(int,input().split()))
flag=0
for i in range(0,nm):
smb=sum(lc[0:i])
sma=sum(lc[i+1:])
if smb!=0 and smb==sma:
flag=1
break
if flag==0:
print("{} {}".format(0,0))
else:
print("{} {}".format(i+1,sma))
5:vivek and desire
n=int(input())
l=[]
count=0
for i in range(n):
l.append(input().strip())
for i in range(n):
for j in range(i+1,n):
set1=set(l[i])
set2=set(l[j])
set1.update(set2)
if len(set1)==10:
count+=1
print(count)
6:- save patient
n=int(input())
c=0
for i in range(n):
k=int(input())
c=0
a=list(map(int,input().split()))
b=list(map(int,input().split()))
for j in range(len(a)):
if(a[j]>b[j]):
c+=1
if(c==len(a)):
print("Yes")
else:
print("No")
7:tricks
n=int(input())
for i in range(n):
p=int(input())
c=1
j=0
while(c
c*=2
if(c>p):
j=j+p-(c//2)
break
j+=1
print(j)
8:-messi
T=int (input())
for _ in range(T):
n=int(input())
s=list(map(int, input().split()))
T=int (input())
s.sort()
satisfied_friends = s[:T]
result=sum(satisfied_friends)
result += s[T-1] * (n-T)
print (result)
9:co prime
import math
t = int(input())
while(t>0):
x=int(input())
y=[]
count=0
for i in range(1,x+1):
if x%i == 0:
y.append(i)
for i in range(0,len(y)):
for j in range(i+1,len(y)):
if math.gcd(y[i],y[j])==1:
count+=1
print(count)
t=t-1
10:-manufacture hub
n=int(input())
for i in range(n):
p=int(input())
c=1
j=0
while(c
c*=2
if(c>p):
j=j+p-(c//2)
break
j+=1
print(j)
11:-birthday party
t=int(input())
def solve():
n,m=list(map(int,input().split()))
if(m%n==0):
print("yes")
else:
print("no")
for i in range(t):
solve()
12:-max and
Max And
for i in range(int(input())):
l=[]
max=0
a=list(map(int,input().split()))
for j in range(a[0],a[1]+1):
l.append(j)
for i1 in range(len(l)-1):
for j1 in range(i1+1,len(l)):
if l[i1]&l[j1]>max:
max=l[i1]&l[j1]
print(max)
13:-wealthy move
n= int(input())
nums= list(map(int, input().spilt(' ')))
swap = 0
for i in range(n):
for j in range(i+1, n):
swap+=1
nums[i],nums[j]= nums[j],nums[i]
print(swap)
14:- Ruby and numerology
Telegram - t.me/coding_solution_help
13.2K views05:10
2021-10-21 07:47:04
1st One
#include
using namespace std;
#define ll long long int
vector g[1001];
vector>> pt;
void dfs(ll st,ll e,ll vis[],vector rs,ll w){
rs.push_back(st);
if(st == e){
pt.push_back({w*(rs.size()-1),rs});
return;
}
for(auto u : g[st]){
if(vis[u] == 0){
vis[st] = 1;
dfs(u,e,vis,rs,w);
vis[st] = 0;
}
}
}
int main()
{
ll n,m,t,c,u,v;
cin>>n>>m>>t>>c;
while(m--){
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
if(n == 1)
cout<<0< else if(n == 2)
cout< else{
vector rs;
ll w = c;
ll vis[n+1] = {0};
dfs(1,n,vis,rs,w);
if(pt.size() == 0)
cout<<-1< else{
sort(pt.begin(),pt.end());
ll te = 0;
ll nt = 0;
for(int i=1;i te += c + (nt-te);
while(nt < te)
nt += t;
}
cout< }//else
}
return 0;
}
2nd One
#include
using namespace std;
#define ll long long int
vector g[1001];
vector>> pt;
void dfs(ll st,ll e,ll vis[],vector rs,ll w){
rs.push_back(st);
if(st == e){
pt.push_back({w*(rs.size()-1),rs});
return;
}
for(auto u : g[st]){
if(vis[u] == 0){
vis[st] = 1;
dfs(u,e,vis,rs,w);
vis[st] = 0;
}
}
}
int main()
{
ll n,m,t,c,u,v;
cin>>n>>m>>t>>c;
while(m--){
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
vector rs;
ll w = c;
ll vis[n+1] = {0};
dfs(1,n,vis,rs,w);
sort(pt.begin(),pt.end());
vector rt[n+1];
for(int i=0;i ll nes = pt[i].second.size();
for(auto u : pt[i].second){
rt[u].push_back(nes);
}
}
ll trt[n+1] = {0};
trt[1] = 1;
trt[n] = 1;
for(int i=2;i<=n-1;i++){
if(rt[i].size() > 0){
ll tm = rt[i][0];
ll up = upper_bound(rt[i].begin(),rt[i].end(),tm) - rt[i].begin();
trt[i] = up;
}
}
for(int i=1;i<=n;i++)
cout< return 0;
}
3rd One:
def fun(d,st,en,l,c,t,ans,final,green,ch):
if ans//t>ch:
green=not green
ch+=1
if st==en:
final.append(ans)
return
for i in d[st]:
if str(i) not in l[:-1].split():
if green:
fun(d,i,en,l+str(i)+" ",c,t,ans+c,final,green,ch)
else:
aq=ans%t
fun(d,i,en,l+str(i)+" ",c,t,ans+c+t-aq,final,not green,ch)
return
n,m,t,c=map(int,input().split())
d={}
for i in range(m):
u,v=map(int,input().split())
if u in d:
d[u].append(v)
else:
d[u]=[v]
if v in d:
d[v].append(u)
else:
d[v]=[u]
l="1 "
final=[]
green=True
ch=0
ret=fun(d,1,n,l,c,t,0,final,green,ch)
final=set(final)
final=list(final)
final.sort()
if len(final)>1:
print(final[1])
else:
print(-1)
//1st 6/9 passed ( Python3) 1.Q)
//2nd 6/9 passed ( C++) 2.Q
//3rd 7/9 passed. ( Python3) 3.Q
Telegram - t.me/coding_solution_help
10.3K viewsedited 04:47
2021-10-21 07:43:39
Confusing array
#include
using namespace std;
typedef unsigned long long int ll;
int main()
{
int n;
cin>>n;
int A[n+1],X[n+1],b[n+1];
for(int i=1;i<=n;i++)
{
cin>>A[i];
b[i]=0;
}
for(int i=1;i<=n;i++)
cin>>X[i];
for(int i=1;i<=n;i++)
{
int temp=A[i];
int p=i,q=i;
while(1)
{
if((A[p]
break;
if(A[p]
else if((p-1)>=1)
p--;
if(A[q]
else if((q+1)<=n)
q++;
}
if(A[p]
p++;
if(A[q]
q--;
// cout<
for(int j=p;j<=q;j++)
b[j]+=X[i];
}
for(int i=1;i<=n;i++)
cout<
return 0;
}
CONFUSING ARRAYS
Telegram - t.me/coding_solution_help
8.7K views04:43
2021-10-20 19:56:15
COLOR TOKENS & CAPGEMINI EXAM TOMORROW DISCUSSION GROUP
@hidden_color_tokens_capgemini
11.1K views16:56
2021-10-20 19:54:22
GLOBAL EDGE & WIPRO EXAM TOMORROW DISCUSSION GROUP
@wipro_atos_syntel_global_exam
11.0K viewsedited 16:54
2021-10-20 19:49:21
OOPs INTERVIEW Qns & Ans Micro CheatBook:
Telegram - t.me/coding_solution_help
11.5K viewsedited 16:49
2021-10-20 17:16:52
#include
#include
void main()
{
char s[200];
int count = 0, i;
printf("Enter the string:\n");
scanf("%[^\n]s", s);
for (i = 0;s[i] != '\0';i++)
{
if (s[i] == ' ' && s[i+1] != ' ')
count++;
}
printf("Number of words in given string are: %d\n", count + 1);
}
Telegram - t.me/coding_solution_help
11.6K views14:16
C
