Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
3.36K subscribers
1.13K photos
3 videos
17 files
373 links
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
Download Telegram
WILEY EDGE
or any exam help available 🔥💯

Book your slot

Contact here
@ILOVEU_143❤️

100% clearance guarantee 🔥🔥
👍1
Wiley Edge Graduate Recruitment

Degree B.E/ B.Tech/ M.E/ M.Tech/ BCA/MCA/B.Sc/ M.Sc

Branch CSE, ECE/EC, I.T, EEE, EIE, Mathematics, Statistics

Percentage 60% through graduation, 12th and 10th

Year of Passing 2022 and 2023 Only with No Standing Arrears

Click here to apply
👇👇

https://wileyedge.neohire.io/registration/


Share @offcampus_000

Telegram @Coding_000
👍1
WILEY EDGE exam help available 🔥💯

Book your slot

Contact here
@ILOVEU_143❤️

100% clearance guarantee 🔥🔥
👍2🥰1
Done with
WILEY EDGE
or any exam help available 🔥💯

Book your slot

Contact here
@ILOVEU_143❤️

100% clearance guarantee 🔥🔥
👍1
WILEY EDGE
Company Hiring

Batches: 2022 & 2023
Package: 7-11Lpa
Percentage: 60%
Eligible: B.Tech/B.E/M.Tech

Apply: Click Here

Exam Help Available 😊

Contact @ILOVEU_143 ❤️

Share our channel @Coding_000👨‍💻
👍2🔥1🥰1
AMAZING OPPORTUNITY FOR ONGOING ABROAD STUDENTS:
PROFESSIONAL WRITERS AVALABLE FOR

1. SOP
2. RESUME
3. LOR
4. ALL DOCUMENT WRITERS

CONTACT - @ILOVEU_143 FOR MORE DETAILED INFO👨‍💻

DONT MISS🤩😍🤩
👍1
Video 📹🎞 editing available Guys 😄

If u are intersted 😅

Contact 👉@Krish_1431
👍1🔥1
def update_matrix(matrix):
    m = len(matrix)
    n = len(matrix[0])
    updated_matrix = [[matrix[i][j] for j in range(n)] for i in range(m)]  # create a copy of the original matrix

    for i in range(m):
        for j in range(n):
            if matrix[i][j] == "C":  # if a copying student is found
                for di, dj in [(-1,-1), (-1,1), (1,-1), (1,1)]:  # check diagonally adjacent elements
                    ni, nj = i + di, j + dj
                    if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] != "C":
                        updated_matrix[ni][nj] = "C"  # replace the element with "C"

    return updated_matrix



L2
👍1
n = int(input())

for i in range(1, n + 1):
print(" " * (n - i), end="")
for j in range(1, i):
print(j, end=",")
for j in range(i, 0, -1):
print(j, end="")
if j != 1:
print(",", end="")
print()

for i in range(n - 1, 0, -1):
print(" " * (n - i), end="")
for j in range(1, i):
print(j, end=",")
for j in range(i, 0, -1):
print(j, end="")
if j != 1:
print(",", end="")
print()
👍1
WILEY EDGE ,Mphasis help available 🔥💯

Book your slot

Contact here
@ILOVEU_143❤️

100% clearance guarantee 🔥🔥


Share @Coding_000 ❤️
👍1🥰1