Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Wiley edge code python ✅😁 @Coding_000✅✅

Wiley edge code X pattern ✅ Python @Coding_000

Guys if anyone having onCampus and offcampus exams on AMCAT or SHL Platform. Msg --> @ILOVEU_143 All answers will be provided with low cost ❤️

Any one want projects -mini or Major 😊  Unique project💥💥 Domain AI/ML contact -@ILOVEU_143 Note -paid 🤑 share✅ share ✅@Coding_000

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✅

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✅

Any one want projects -mini or Major 😊  Unique project💥💥 Domain AI/ML contact -@ILOVEU_143 Note -paid 🤑 share✅ share ✅@Coding_000

Raju code

Raju and team

guys pls type correctly...it will pass all test cases...✅✅

🛑🛑Please change the code logic and varibles names to avoid plagiarism 🥹🥹 Share ✅ @Coding_000

Raj and ajay code

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

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 ✅

easy 2 ✅

easy 1 ✅

Easy problem 2

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)