Off Campus Job Update
Kanalga Telegram’da o‘tish
500+ Placement & Competitive Exam Materials 75+ Companies Materials 100+ JOB Updates in a Month 🚀DM for Promotion @Wren_0 🚀Placement Updates: @offcampusjobs_0 🌟 Placment Material: @placement_materials0
Ko'proq ko'rsatish
Tarmoq:8 266
Obunachilar
Ma'lumot yo'q24 soatlar
Ma'lumot yo'q7 kunlar
-12430 kunlar
Postlar arxiv
C language
Pp code (prime and palindrome) In
Telegram -
https://t.me/Coding_solution_0
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
Whales code
Telegram- https://t.me/Coding_solution_0
n=int(input())
x=int(input())
y=int(input())
z=int(input())
a=[]
for i in range(n):
a.append(int(input()))
s=(x*1)+(y*2)+(z*3)
c=0
for i in a:
if i<=s:
c+=1
print(c)
Python
John Code
Telegram
https://t.me/Coding_solution_0
int res=X*1 + Y*2 + Z*3;
int count=0;
for(int i=0;i<A.size();i++){
if(A.get(i)<=res){
count++;
}
}
return count;
For John Code
Telegram - https://t.me/Coding_solution_0
perfect_sum(arr, s, result) :
x = [0]*len(arr)
j = len(arr) - 1
while (s > 0) :
x[j] = s % 2
s = s // 2
j -= 1
sum = 0
for i in range(len(arr)) :
if (x[i] == 1) :
sum += arr[i]
if (sum == result) :
print("{",end="");
for i in range(len(arr)) :
if (x[i] == 1) :
print(arr[i],end= ", ");
print("}, ",end="")
def print_subset(arr, K) :
x = pow(2, len(arr))
for i in range(1, x):
perfect_sum(arr, i, K)
# Driver code
arr = [ ]
n = int(input("Enter length of array : "))
s=int(input("Enter sum : "))
for i in range(n):
ele=int(input("Enter element : "))
arr.append(ele)
print_subset(arr, s)
array AR of size N
Telegram - https://t.me/Coding_solution_0
INFOSYS EXAM ALL SLOTS SOLUTION GROUP 👇
Telegram - https://t.me/Coding_solution_0
Telegram - GROUP
https://t.me/good_coders
✅ Share post in ur college Whatsapp grps.
max_li=[]
def longest_subarray(arr, d):
(i, j, e) = (0, 1, 0)
for i in range(d - 1):
if arr[i] == arr[i + 1]:
j += 1
else:
j = 1
if e < j:
e = j
return e
temp=li.copy()
for each in li:
max_li.append(longest_subarray(temp, len(temp)))
temp=li.copy()
while(True):
try:
temp.remove(each)
except:
break
print(max(max_li))
Python
Ali army
Telegram-
https://t.me/Coding_solution_0
C language
N Numbers Code
Telegram -
https://t.me/company_0
https://t.me/company_0
✅Working with codes
✅Guys if you cant send messages in discussion group
Join this the problem will resolve
https://t.me/company_0
https://t.me/company_0
https://t.me/company_0
