uz
Feedback
WhiteHat Coding

WhiteHat Coding

Kanalga Telegram’da o‘tish

Sharing = caring = spreading happiness

Ko'proq ko'rsatish
650
Obunachilar
Ma'lumot yo'q24 soatlar
-27 kunlar
-330 kunlar
Postlar arxiv
🤩🤩Tech Mahindra Hiring 2024 https://registration.techmahindra.com/Candidate/RegDefault.aspx For Only 2024 candidates

TECH Mahindra Exam Round 1 & 2 Help available.👨‍💻 100% Clearance GUARANTEE.✅ Check our past Results. 👇👇 https://t.me/Coding_000/5567?single https://t.me/Coding_000/5563?single Contact @ILOVEU_143

Attention everyone!! Those who need help for Cognizant, Accenture, Revature or any placement tests clearance should contact @ILOVEU_143👨‍💻😊 and book your slots ✅ 100% CLEARANCE ✅👨‍💻 Remote access available🤞 Telegram: @ILOVEU_143✅ SHARE @coding_000✅👨‍💻

IBM PYTHON 3✅ SHARE @WHITEHATCODING❤️😊
+3
IBM PYTHON 3✅ SHARE @WHITEHATCODING❤️😊

photo content

photo content

Pencils ✅
+1
Pencils ✅

Those who need Job in It Companies can check this channel Join now @Offcampus_000 🔥🔥 Latest Jobs and Internships Updates for 2021,2022, 2023 and 2024 Batch

AnimatedSticker.tgs0.02 KB

Revature is hiring fresher https://revature.com/apply/ Apply now

Genpact is hiring for 2022,2023,2024 Work from office Delhi ncr location https://forms.office.com/pages/responsepage.aspx?id=
Genpact is hiring for 2022,2023,2024 Work from office Delhi ncr location https://forms.office.com/pages/responsepage.aspx?id=IIrvvayqgE-zoNmjL5n9M9suui6swjBImu7iaOx00hhUQ0xRSkVTVFgwRjRVMEczWVkxRzRVN0VCTC4u Fill form and direct interview on 22nd

import re def is_prime(num):     if num <= 1:         return False &nbsp
import re def is_prime(num):     if num <= 1:         return False     if num == 2:         return True     if num % 2 == 0:         return False     for i in range(3, int(num**0.5) + 1, 2):         if num % i == 0:             return False     return True def fun(input_str):     numbers = re.findall(r'\d+', input_str)     total_sum = 0     for num_str in numbers:         num = int(num_str)         if is_prime(num) or num % 2 == 0:             total_sum += num         return total_sum print fun(raw_input())

Novago coding answer✅ python 3👨‍💻 🆓🆓🆓 share @coding_000😍 Don't pay money to anyone the above one passes all the test ca
Novago coding answer✅ python 3👨‍💻 🆓🆓🆓 share @coding_000😍 Don't pay money to anyone the above one passes all the test cases✅

F1 STUDENTS PLEASE FILL YOUR DS-160 FORM COMPLETELY AND UPDATE IN PORTAL BECAUSE AFTER  YOUR SLOT CONFIRMATION YOU CAN’T UPDATE YOUR DS-160 IN YOUR PROFILE. BECAUSE OF THIS MISTAKE EMBASSY WILL CANCEL YOUR APPOINTMENT ON THE DAY OF BIOMETRICS!! IF YOU ARE DOING YOUR PROCESS THROUGH CONSULTANCY PLEASE RE- CONFIRM THAT YOUR DS-160 IS UPDATED IN THE PORTAL… IF YOU ARE DOING BY YOURSELF THEN MAKE SURE THAT IT IS UPDATED!!!!

100% PASSING GUARANTEE in your first attempt👨‍💻 Direct message me for support with any of the following exams:👇👇 👉Microsoft Azure Certifications 👉Amazon Certifications 👉Google Certifications 👉GRE ,TOFEL, DUOLINGO ✅🎯 Need assistance? DM me 👉👉 @ILOVEU_143 👨‍💻 for Google, Azure, Microsoft, Salesforce, and other certifications!

def count_valid_strings(N): MOD = 10**9 + 7 T, A, N, R, U, S = range(6) dp = [[0] * 6 for _ in range(N + 1)] dp[1][T] = 1 dp[
def count_valid_strings(N):
    MOD = 10**9 + 7
    
    T, A, N, R, U, S = range(6)
    
    dp = [[0] * 6 for _ in range(N + 1)]
    
    dp[1][T] = 1
    dp[1][N] = 1
    dp[1][S] = 1
    
    for i in range(1, N):
        dp[i + 1][A] = (dp[i][T]) % MOD
        dp[i + 1][N] = (dp[i][A]) % MOD
        dp[i + 1][R] = (dp[i][A] + dp[i][N]) % MOD
        dp[i + 1][U] = (dp[i][R]) % MOD
        dp[i + 1][S] = (dp[i][U]) % MOD
        dp[i + 1][T] = (dp[i][S]) % MOD
        dp[i + 1][A] = (dp[i + 1][A] + dp[i][S]) % MOD
        dp[i + 1][N] = (dp[i + 1][N] + dp[i][S]) % MOD
        dp[i + 1][R] = (dp[i + 1][R] + dp[i][S]) % MOD
        dp[i + 1][U] = (dp[i + 1][U] + dp[i][S]) % MOD
    
    result = sum(dp[N][c] for c in [T, A, N, R, U, S]) % MOD
    return result
Thoughtwork ✅

def count_arrays(N, K, X):     MOD = 1000000007         if N == 1:         return 1 if X == 1 else 0     a = [0] * (N + 1)     b = [0] * (N + 1)         a[1] = 1     b[1] = 0         for i in range(2, N + 1):         a[i] = (a[i - 1] * (K - 2) + b[i - 1] * (K - 1)) % MOD         b[i] = a[i - 1] % MOD         return b[N] N = int(input()) K = int(input()) X = int(input()) print(count_arrays(N, K, X)) Number Of Array code Thoughtwork exam Python3 ✅

👉Hiii all .. . ❤️✌️ 📌If you need any  help with  any placements exams help, on campus &offcampus  (Cognizant  , Tech Mahindra , Accenture,  Amazon , IBM , Delotiee ,Cognizant ,  Capgemini, , L&T Wiley edge , etc …..  ) contact us 📌Any company internal  exams help , ( Accenture primer ,techleap etc ) 📌Nd Interview proxies (both fresher , exp) If anyone want accenture interview proxy you can contact us Nd 📌any certifications (internal/external) such as Gcp , AWS etc .., 📌Nd any assignments , projects help Please kindly refer your friends to our channel  🫂❤️ if you have any queries contact us 👉     👉@ILOVEU_143✅👨‍💻 Share @Coding_000👨‍💻✅ #coding_000 #iloveu_143 #examshelp #tcsexam #accenture #techmahindra #codinghelp #help #Trustusexpectus✌️

SQL Learning Series Part-2 Complete SQL Topics for Data Analysis👇👇👇👇 Join fast https://t.me/CodingWithHarry/84

Repost from N/a
📌Hello everyone ✌️ ✅So from today let’s learn SQL from basics to advance 😊 Share and join😍👨‍💻 https://t.me/CodingWithHarry https://t.me/CodingWithHarry