Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
Kanalga Telegram’da o‘tish
Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion
Ko'proq ko'rsatish3 257
Obunachilar
Ma'lumot yo'q24 soatlar
-107 kun
-3930 kun
Postlar arxiv
Wiley edge code python ✅😁
@Coding_000✅✅
15 Dek 2022, 04:15
27 Dek 2022, ~05:38
Wiley edge code X pattern ✅
Python @Coding_000
15 Dek 2022, 04:14
27 Dek 2022, ~05:38
Guys if anyone having onCampus and offcampus exams on AMCAT or SHL Platform.
Msg --> @ILOVEU_143
All answers will be provided with low cost ❤️
13 Dek 2022, 10:23
Any one want projects -mini or Major 😊 Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143
Note -paid 🤑
share✅ share ✅@Coding_000
12 Dek 2022, 03:35
JIO Help Available 👍👍
Contact: @ILOVEU_000
Book your slots ASAP
Scroll above and check the work
💯 Clearence @Coding_000
Note: It's paid💶🤑
✅Share✅Share✅Share ✅share✅
11 Dek 2022, 06:03
11 Dek 2022, ~06:27
Placements Help Available 👍👍
If you also want to crack your current placements
Contact: @ILOVEU_143
Book your slots ASAP
Scroll above and check the work
💯 Clearence @Coding_000
Note: It's paid💶🤑
✅Share✅Share✅Share ✅share✅
11 Dek 2022, 04:50
Any one want projects -mini or Major 😊 Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143
Note -paid 🤑
share✅ share ✅@Coding_000
11 Dek 2022, 02:45
12 Dek 2022, ~03:35
Raju code
11 Dek 2022, 02:00
Raju and team
11 Dek 2022, 01:55
guys pls type correctly...it will pass all test cases...✅✅
11 Dek 2022, 01:50
🛑🛑Please change the code logic and varibles names to avoid plagiarism 🥹🥹
Share ✅ @Coding_000
11 Dek 2022, 01:41
Raj and ajay code
11 Dek 2022, 01:40
n = input()
res-[n[i: j] for i in range (ten(n)) for in range(i+1, len(n)+1)]
C=0
for i in res:
t-il::-11
C+=1
print(c)
L1 medium 1
11 Dek 2022, 01:37
m = int(input())
n = int(input())
matrix_rows = []
for i in range(m):
row = input().split()
matrix_rows.append(row)
def finding_distance(out_matrix,v_index):
distance_list = []
for row in out_matrix:
for i in range(len(row)):
if row[i] == '-1':
distance = abs(v_index - i)
distance_list.append(distance)
return distance_list
for i in range(len(matrix_rows)):
for j in range(len(matrix_rows[i])):
if matrix_rows[i][j].lower() == 'v':
v_index = j
row_index = i
up_elements = []
down_elements = []
v_row = matrix_rows[row_index]
for row in matrix_rows:
up_elements.append(row[v_index])
down_elements.append(row[v_index])
out_matrix = []
out_matrix.append(up_elements)
out_matrix.append(down_elements)
out_matrix.append(v_row)
distance_list = finding_distance(out_matrix, v_index)
print(distance_list)
res = min(distance_list)
print(res)
chandra code ✅
11 Dek 2022, 01:36
easy 2 ✅
11 Dek 2022, 01:32
easy 1 ✅
11 Dek 2022, 01:31
Easy problem 2
11 Dek 2022, 01:27
Easy problem 1 L1✅
freq = {}
n = int(input())
arr = list(input().split())
mx = 0
mn = n+5
for x in arr:
if x in freq:
freq[x] += 1
else:
freq[x] = 1
mx = max(mx, freq[x])
mn = min(mn, freq[x])
mn_arr = []
mx_arr = []
for x in freq:
if freq[x] == mx:
mx_arr.append(x)
if freq[x] == mn:
mn_arr.append(x)
mn_arr.sort()
mx_arr.sort()
print(mn_arr)
print(mx_arr)
11 Dek 2022, 01:24
11 Dek 2022, 01:20
11 Dek 2022, ~01:21
