Python
Max value stored

Join https://t.me/Coding_human https://t.me/infosys_exam_help_all_slots

Prime and palindrom code

C language

Join : https://t.me/Coding_human

def check(a,n)
if n==1:
return 1
a.sort()
c=0
i=0
while(i<n-1):
if a[i+1]-a[i]==1:
i=i+2
c=c+1
else:
i=i+1
if c:
return c
else:
return 1
n=int(input())
a=[]
for i in range(n):
a.append(int(input()))
print(check(a,n))

Python
Array one code
Telegram- https://t.me/Coding_human

n = int(input())
a = list(map(int,input().split()))
c = 0
for i in range(n-1):
for j in range(i+1:n):
s1 = sum(list(map(int,bin(i)[2:].split())))
s2 = sum(list(map(int,bin(j)[2:].split())))
if s1 == s2:
c += 1
print(c)

Python
Bob and Numbers Code
Telegram- https://t.me/Coding_human

⭐️Technical and HR interviews material

https://bit.ly/3F98IDJ

Share our channel with your college friends : https://t.me/Coding_human

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>




int main(){
int t,count=0;
scanf("%d",&t);
for(int a0 = 0; a0 < t; a0++){
count=0;
int n;
int k;
scanf("%d %d",&n,&k);
int a[n];
for(int a_i = 0; a_i < n; a_i++){
scanf("%d",&a[a_i]);
}

for(int a_i = 0; a_i < n; a_i++){
if(a[a_i]<=0)
count++;
}
if(count<k)
printf("YES\n");
else
printf("NO\n");
//count=0;
}
return 0;
}


C language
Angry professor
Telegram- https://t.me/Coding_human

int main() {
char s[100];
int i;
printf("\nEnter a string : ");
gets(s);
for (i = 0; s[i]!='\0'; i++) {
if(s[i] >= 'a' && s[i] <= 'z') {
s[i] = s[i] - 32;
}
}
printf("\nString in Upper Case = %s", s);
return 0;
}

Warehouse Code
Telegram - https://t.me/Coding_human

Image processing code

TG : https://t.me/Coding_human

Municiple code

TG : https://t.me/Coding_human

int main() {
char s[100];
int i;
printf("\nEnter a string : ");
gets(s);
for (i = 0; s[i]!='\0'; i++) {
if(s[i] >= 'a' && s[i] <= 'z') {
s[i] = s[i] - 32;
}
}
printf("\nString in Upper Case = %s", s);
return 0;
}

Warehouse Code
Telegram - https://t.me/Coding_human

Accenture , LTI, Accolite exam all slots help

: https://t.me/Accenture_lti_Accolite_exam

https://t.me/Coding_human

Share with your friends.

Permutation and combination code

TG : https://t.me/Coding_human

TOM astrology code
Python

Join : https://t.me/Coding_human

Bank code python

Join : https://t.me/Coding_human

Find me out code
Join https://t.me/Coding_human

def findSubArray(arr, n):
sum = 0
maxsize = -1
for i in range(0, n-1):
sum = -1 if(arr[i] == 0) else 1
for j in range(i + 1, n):
sum = sum + (-1) if (arr[j] == 0) else sum + 1
if (sum == 0 and maxsize < j-i + 1):
maxsize = j - i + 1
startindex = i
if (maxsize == -1):
print(0);
else:
print(maxsize);

size = int(input())
arr = list(map(int, input().split()))
findSubArray(arr, size)

Python
Largest Sub Array
Telegram - https://t.me/Coding_human

Join for exam and coding help
https://t.me/Accenture_lti_Accolite_exam

58. All
59. 1024
60. Web page
61. All

62 Secure
63 Remote
64 Internet Ex

73 None
74 1 and 2
75 %temp%

Fibonacci code
Join : https://t.me/Coding_human

Renault Nissan Off campus drive

https://atultalksabhay.blogspot.com/2022/01/renault-nissan-off-campus-drive.html

Revature is hiring 2021 and 2022 batch

https://atultalksabhay.blogspot.com/2022/01/revature-is-hiring-2021-and-2022-batch.html?m=1