Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
Відкрити в Telegram
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
Показати більше3 257
Підписники
Немає даних24 години
-107 днів
-3930 днів
Архів дописів
Microsoft is integrating the technology behind the viral chatbot ChatGPT into its Bing search engine, hoping the artificial intelligence upgrade can help it chip away at Google’s dominance of the search market
08 лют 2023, 04:02
08 лют 2023, ~04:16
Apply amazon👇👇
👉@Offcampus_000
07 лют 2023, 23:59
Any one want projects -mini or Major 😊 Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143 ❤️
Anyone need help in GRE and TOFEL, GMAT, DUOLINGO Exam help 👨💻👨💻
SOP , LOR✍📝
Note -paid 🤑
share✅ share ✅@Coding_000
07 лют 2023, 23:47
You don`t have heart guys..🙄
Nobody give reactions..😒
07 лют 2023, 22:45
07 лют 2023, ~23:08
Wiley edge
Amazon Sde
AMcat
Deliotee
or any exam help available 🔥💯
Book your slot
Contact here @ILOVEU_143✅
Note: It's Paid 💰💰
Share✅ @Coding_000💯💥
💯 Clearance and genuine help
Check all previous proofs 😎💯
07 лют 2023, 22:44
Propose day guys..💍💍
👉 @ILOVEU_143 😅
07 лют 2023, 22:04
Happy rose day guys..🌹🌹
@ILOVEU_143 😅
07 лют 2023, 05:40
Everyone join this for off-campus updates
07 лют 2023, 01:44
In this channel i will share all 2023 batch offcampus job 🤘🤘
https://t.me/Offcampus_000
07 лют 2023, 01:44
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✅
06 лют 2023, 23:08
07 лют 2023, ~03:31
Wiley edge
Amazon Sde
AMcat
Deliotee
or any exam help available 🔥💯
Book your slot
Contact here @ILOVEU_143✅
Note: It's Paid 💰💰
Share✅ @Coding_000💯💥
💯 Clearance and genuine help
Check all previous proofs 😎💯
05 лют 2023, 22:45
07 лют 2023, ~22:44
enc=encoded=3_hBf7XNPTK0nFFzvt9WUNFBx6pAnIlSVCqAP3VPlCt7CBg7Dg3.docx0.33 KB
05 лют 2023, 07:55
Any one want projects -mini or Major 😊 Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143 ❤️
Anyone need help in GRE and TOFEL Exam help 👨💻👨💻
SOP , LOR✍📝
Note -paid 🤑
share✅ share ✅@Coding_000
05 лют 2023, 06:03
Wiley edge
Amazon Sde
AMcat
Deliotee
or any exam help available 🔥💯
Book your slot
Contact here @ILOVEU_143✅
Note: It's Paid 💰💰
Share✅ @Coding_000💯💥
💯 Clearance and genuine help
Check all previous proofs 😎💯
05 лют 2023, 01:49
05 лют 2023, ~22:45
def main():
w1 = input().lower()
w2 = input().lower()
w1_list = [0] * 26
w2_list = [0] * 26
for c in w1:
w1_list[ord(c) - ord('a')] += 1
for c in w2:
w2_list[ord(c) - ord('a')] += 1
if w1_list == w2_list:
print(len(w1))
else:
different_letters = []
for i in range(26):
if w1_list[i] != w2_list[i]:
different_letters.append(chr(i + ord('a')))
different_letters.sort()
print("".join(different_letters))
if name == 'main':
main()
WEB dEveloper code ✅
05 лют 2023, 01:36
THis question👆
05 лют 2023, 01:34
def check_order(boxes):
stack = []
for box in boxes:
if box in ['(', '{', '[']:
stack.append(box)
else:
if not stack:
return box
if box == ')' and stack[-1] != '(':
return box
if box == '}' and stack[-1] != '{':
return box
if box == ']' and stack[-1] != '[':
return box
stack.pop()
if stack:
return stack[0]
return len(boxes)
boxes = input()
result = check_order(boxes)
if isinstance(result, int):
print(result)
else:
print(result)
L1 M2
05 лют 2023, 01:33
L2 Hard
05 лют 2023, 01:20
