allcoding1

proofs👇 https://t.me/+mP2YTsMihZozNWQ1

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources English , 🇫🇷 All courses (100 rupees) Contact:- @meterials_available

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources English , 🇫🇷 100 rupees Contact:- @meterials_available

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources English , 🇫🇷 100 rupees Contact:- @meterials_available

Exam Ans:- @allcoding1 Jobs post:- @allcoding1_official

Salesperson ID's - IBM

Lexicographical smallest substring - IBM

def max_call_executives(n, start_times, end_times):     timeline = [0] * (24 * 60 + 1)         for i in range(n):         start = int(start_times[i][:2]) * 60 + int(start_times[i][2:])         end = int(end_times[i][:2]) * 60 + int(end_times[i][2:])         timeline[start] += 1         timeline[end] -= 1         max_executives = 0     current_executives = 0     for i in range(len(timeline)):         current_executives += timeline[i]         max_executives = max(max_executives, current_executives)         return max_executives Call Centre

import heapq def distance(x, y):     return x*x + y*y def nearest_houses(P, T, queries):     distances = []     heapq.heapify(distances)     for query in queries:         if query[0] == 1:             x, y = query[1], query[2]             heapq.heappush(distances, distance(x, y))         else:             nearest = heapq.nsmallest(T, distances)[-1]             print(nearest) Nearest House

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources English , 🇫🇷 100 rupees Contact:- @meterials_available

#include <iostream> #include <vector> using namespace std; const int MOD = 1e9 + 7; int F(int i, int k, int n, vector<int> &level, vector<int> &dp) {     if (i == n) return 1;     if (dp[i] != -1) return dp[i];     int ans = 0, odds = 0;     vector<int> hash(n + 10, 0);     for (int j = i; j < n; j++) {         if (++hash[level[j]] % 2 == 0) odds -= 1;         else odds += 1;         if (odds <= k) {             ans = (ans + F(j + 1, k, n, level, dp)) % MOD;         }     }     return dp[i] = ans; } int countValidPartitions(vector<int> level, int k) {     int n = level.size();     vector<int> dp(n, -1);     return F(0, k, n, level, dp); } DE Shaw

#include <iostream> #include <vector> #include <algorithm> #include <climits> using namespace std; int getMaxMedian(vector<int> lower_bound, vector<int> upper_bound, long int max_sum) {     int n = lower_bound.size();     long long curr_sum = 0;     for (int i = 0; i < n; ++i) {         curr_sum += lower_bound[i] + upper_bound[i];     }     int num_elements = 2 * n;     long long target_sum = curr_sum + max_sum;     sort(upper_bound.begin(), upper_bound.end());     int median_index = num_elements / 2;     int left = 1, right = INT_MAX;     while (left <= right) {         int mid = left + (right - left) / 2;         long long sum = 0;         for (int i = 0; i < n; ++i) {             if (upper_bound[i] <= mid) {                 sum += upper_bound[i];             } else {                 sum += mid;             }         }         if (sum <= target_sum) {             left = mid + 1;         } else {             right = mid - 1;         }     }     return right; } int main() {     int n;     cin >> n;     vector<int> lower_bound(n);     vector<int> upper_bound(n);     for (int i = 0; i < n; ++i) {         cin >> lower_bound[i];     }     for (int i = 0; i < n; ++i) {         cin >> upper_bound[i];     }     long int max_sum;     cin >> max_sum;     int max_median = getMaxMedian(lower_bound, upper_bound, max_sum);     cout << max_median << endl;     return 0; } DE Shaw

#include <bits/stdc++.h> using namespace std; #define ll long long int main() {     ll n;     cin >> n;     vector<ll> v(n);     for(ll i=0; i<n; i++)         cin >> v[i];     sort(v.begin(), v.end());     ll sum = 0;     for(ll i=0; i<n; i++) {         if(sum + v[i] < 0)             return cout << -1, 0;         sum += v[i];     }     if(sum % 2 == 0)         cout << -1;     else         cout << sum;     return 0; } fortunejob

#include <iostream> using namespace std; int main() {     int e, d;     cin >> e >> d;         int mE = 0;     int mN = 0;         for (int i = 1; i <= d; i++) {         int gE = e * i;         int gN = 0;                 while (gE % 10 == 0) {             gN++;             gE /= 10;         }                 if (gN > mN) {             mN = gN;             mE = e * i;         } else if (gN == mN) {             mE = max(mE, e * i);         }     }         cout << mE << endl;         return 0; } goodenergy

#include<bits/stdc++.h> using namespace std; bool solve(char c) {     c = tolower(c);     return !(c == 'a' c == 'e' c == 'i' c == 'o' c == 'u') && c >= 'a' && c <= 'z'; } int main() {     string s;     cin >> s;     int count = 0;     for(int i = 0; i < s.length(); i += 2) {         if(solve(s[i])) {             count++;         }     }     cout << count << endl;     return 0; } Airtel Shecode anabellle @allcoding1

import java.util.Scanner; public class Solution {     public static void main(String[] args) {         Scanner sc = new Scanner(System.in);         int energy = sc.nextInt();         int maxDrink = sc.nextInt();         int maxGoodEnergy = 0;         int maxGoodNumber = 0;         for (int i = 1; i <= maxDrink; i++) {             int goodEnergy = energy * i;             int goodNumber = 0;             while (goodEnergy % 10 == 0) {                 goodNumber++;                 goodEnergy /= 10;             }             if (goodNumber > maxGoodNumber) {                 maxGoodNumber = goodNumber;                 maxGoodEnergy = energy * i;             } else if (goodNumber == maxGoodNumber) {                 maxGoodEnergy = Math.max(maxGoodEnergy, energy * i);             }         }         System.out.println(maxGoodEnergy);     } } Airtel shecode @allcoding1

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources English , 🇫🇷 100 rupees Contact:- @meterials_available

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources English , 🇫🇷 100 rupees Contact:- @meterials_available

#include<bits/stdc++.h> #define ll long long using namespace std; ll solve(vector<int>a) {    set<int>s(a.begin(),a.end());    ll mex=0;     while (s.count(mex)) mex++;    ll ans=distance(s.lower_bound(mex),s.end());    if(ans==a.size()) return -2;    return ans; } int main() {     int n; cin>>n;     vector<int>arr(n);     for(int i=0;i<n;i++) cin>>arr[i];     cout<<solve(arr);     return 0; } Mex Number @allcoding1