WhiteHat Coding

Main channel https://t.me/whitehatcoding OffCampus updates join -https://t.me/Offcampus_000 Discussion group join- https://t.me/exams_discussion 💯% clearance in any placement exams ✅ Just msg here.. Free help❤️✅ Sharing = caring = spreading happiness😊

https://drive.google.com/drive/folders/1h_-oalz4GLywyKURcKm6MV57QE7mJIR9?usp=sharing Download this in Laptop and save it You can prepare for all exams with this It has all exams papers,Resume Templates,Notes,Interview Questions etc Share it with your Friends✅

def is_prime(n):     if n <= 1:         return False     for i in range(2, int(n ** 0.5) + 1):         if n % i == 0:             return False     return True def prime_sum(num):     for i in range(2, num):         if is_prime(i) and is_prime(num - i):             return str(i) + ", " + str(num - i)     return "N/A" num = int(input()) print(prime_sum(num))

To remove Plagiarism🟥🟨🟧🟩🟦🟪 1) Use your Own template✅ 2) Change Variables ✅ 3) Try to read input in unique style✅ 4) Understand the code and write in your style ✅ 5) Write whole code in main function / write in diffrent function✅ 6) Change Function name solve()=> unique✅ 7) If possible change flow of the problem (if it doesn't impact the logic of code)✅   there are so many other things to avoid Plagiarism🔥🔲 @whitehatcoding ❤️

ARRAY GAME CODE ✅

Who want ans...for this... Just share our channel I will upload Ans...👉 @whitehatcoding ✅

python3✅ Share ur questions here any exam....we will help Free... Share our channel ✅ share @whitehatcoding❤️

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

Any one want to crack Azure Fundamentals Dumps available ✅ Contact @ILOVEU_143👨‍💻 100% clearance guarantee 🔥🔥 Share @Coding_000 ❤️

Python interview questions 🧑‍💻🤩

Share our channel screenshot in large groups ✅✅✅✅✅ For More  answers 🏃🏃🏃🏃

geek and xor play code done   ✅ class Solution { public: #define ll long long     vector<ll> xorPairs(int n, vector<int> &A1, vector<int> &A2, int Q, vector<vector<int>> &query)     {         vector<vector<ll>> temperary(30, vector<ll>(n)), typmu(30, vector<ll>(n));         for (int j = 0; j < 30; j++)         {             for (int i = 0; i < n; i++)             {                 temperary[j][i] = (i ? temperary[j][i - 1] : 0) + ((A1[i] >> j) & (1ll) == 1);             }             for (int i = 0; i < n; i++)             {                 typmu[j][i] = (i ? typmu[j][i - 1] : 0) + ((A2[i] >> j) & (1ll) == 1);             }         }         vector<ll> answer;         for (auto it : query)         {             ll k = it[0];             k--;             ll l1 = it[1];             ll r1 = it[2];             ll l2 = it[3];             ll r2 = it[4];             l1--;             r1--;             l2--;             r2--; @Coding_000             ll cnt_k_1 = temperary[k][r1] - (l1 ? temperary[k][l1 - 1] : 0);             ll cnt_k_2 = typmu[k][r2] - (l2 ? typmu[k][l2 - 1] : 0);             ll ans1 = 0;             ans1 += (r1 - l1 + 1 - cnt_k_1) * (cnt_k_2);             ans1 += (r2 - l2 + 1 - cnt_k_2) * (cnt_k_1);             answer.push_back(ans1);         }         return answer;     } }; code in c++  ✅ ✅ share @Coding_000❤️

fest and poster code done  ✅ class Solution {   public:   @Coding_000   bool check(int valmed, int num, vector<int> &watch){       int counting = 0;       for(auto x : watch) counting += (x / valmed);       return counting >= num;   } @Coding_000     long long minimumTime(int N, int num, vector<int> &watch) {         long long l = 1, r = 1e18, ans = 1e18; @Coding_000         while(l <= r){             long long valmed = (l + r) >> 1;             if(check(valmed, num, watch)) {                 ans = valmed;                 l = valmed - 1;             }             else r = valmed + 1;         }         return ans;             } }; code in c++  ✅ share @Coding_000❤️

select maximum number code✅ class Solution {   public:     vector<int> findDifferenceArray(int n, vector<int> &A) {         vector<int>prefix(n, 0) , backword(n, 0);         for(int i=0;i<n;i++){             prefix[i] = min((i?prefix[i-1]:INT_MAX) , A[i]);         } @Coding_000         for(int i=n-1;i>=0;i--){             backword[i] = min(((i+1<n)?backword[i+1]:INT_MAX) , A[i]);         }                 if(n==1){             return {0};         }         @Coding_000         vector<int>answer(n, 0);         for(int i=0;i<n;i++){             if(i==0){                 answer[i] = -backword[i+1];                 continue;             }                         if(i==n-1){                 answer[i] = prefix[i-1];                 continue;             }                         answer[i] = prefix[i-1] - backword[i+1];         }         return answer;     } }; telegram @Coding_000❤️✅

https://practice.geeksforgeeks.org/contest/job-a-thon-18-hiring-challenge Everyone register this 18 company hiring through this

Unstop Exam ✅ Python 3

Currently the recession is going on due to which many companies are on hiring freeze that’s why you are getting so less response. Please have patience and keep trying and most importantly up-skill yourself in this tough time, you never know when does opportunity come. share @whitehatcoding❤️

cisco ASIC Engineer- (New Grad)- India UHR Click here to apply 🔥👇 https://jobs.cisco.com/jobs/IsAJob?projectId=1376727 Join Telegram --> @offcampus_000😊 SHARE  IT WITH  YOUR FNDZ Also✅