allcoding1

#include <iostream> #include <string> #include <vector> using namespace std; int numDecodings(string msg) {     int MOD = 1000000007;     int n = msg.size();         vector<long long> dp(n + 1, 0);     dp[0] = 1;         if (msg[0] == '0')         dp[1] = 0;     else if (msg[0] == '*')         dp[1] = 9;     else         dp[1] = 1;         for (int i = 2; i <= n; ++i) {         if (msg[i - 1] == '0') {                         if (msg[i - 2] == '1' || msg[i - 2] == '2')                 dp[i] += dp[i - 2];             else if (msg[i - 2] == '*')                 dp[i] += 2 * dp[i - 2];         } else if (msg[i - 1] >= '1' && msg[i - 1] <= '9') {                   dp[i] += dp[i - 1];                         if (msg[i - 2] == '1' || (msg[i - 2] == '2' && msg[i - 1] <= '6'))                 dp[i] += dp[i - 2];             else if (msg[i - 2] == '*') {                                 if (msg[i - 1] <= '6')                     dp[i] += 2 * dp[i - 2];                 else                     dp[i] += dp[i - 2];             }         } else if (msg[i - 1] == '*') {             dp[i] += 9 * dp[i - 1];                         if (msg[i - 2] == '1')                 dp[i] += 9 * dp[i - 2];             else if (msg[i - 2] == '2')                 dp[i] += 6 * dp[i - 2];             else if (msg[i - 2] == '*')                 dp[i] += 15 * dp[i - 2];         }                 dp[i] %= MOD;     }         return dp[n]; } Number of ways decode

import re a = int(input().strip()) b = set() c = r'\b[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\.[A-Z|a-z]{2,}\b' for _ in range(a):     line = input().strip()     b.update(re.findall(c, line)) print(';'.join(sorted(b)))

int solve(int k, vector<int>& s) {     sort(s.rbegin(), s.rend());     int c = 0;     for (int i = 0; i < s.size(); i++) {         if (i < k && s[i] > 0) {             c++;         } else if (s[i] == s[i - 1] && s[i] > 0) {             c++;         } else {             break;         }     }     return c; } Competitive Gaming Accenture exam Telegram:- @allcoding1

#include <iostream> #include <vector> #include <algorithm> using namespace std; int findLIS(vector<int>& s) {     vector<int> tails;     for (int x : s) {         auto it = lower_bound(tails.begin(), tails.end(), x);         if (it == tails.end()) {             tails.push_back(x);         } else {             *it = x;         }     }     return tails.size(); }   Swiggy LIS

#include <bits/stdc++.h> using namespace std; int jumps(int flagHeight, int bigJump) {     return flagHeight / bigJump+flagheight% bigJump; }.  Swiggy Jump to The Flag

long getMaxPrisonHole(int n, int m, vector x, vector y) {     vector xb(n+1, true);     vector yb(m+1, true);         for(int i : x) {         xb[i] = false;     }         for(int i : y) {         yb[i] = false;     }         long cx = 0, xm = LONG_MIN, cy = 0, ym = LONG_MIN;         for(int i = 0; i < xb.size(); i++) {         if(xb[i]) {             cx = 0;         } else {             cx++;             xm = max(cx, xm);         }     }         for(int i = 0; i < yb.size(); i++) {         if(yb[i]) {             cy = 0;         } else {             cy++;             ym = max(cy, ym);         }     }         return (xm+1) * (ym+1); }  Swiggy Prison Break

public static int selectStock(int saving, int[] currentValue, int[] futureValue) {         int n = currentValue.length;         int[][] dp = new int[n + 1][saving + 1];         for (int i = 1; i <= n; i++) {             for (int j = 0; j <= saving; j++) {                 dp[i][j] = dp[i - 1][j];                 if (j >= currentValue[i - 1]) {                     dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - currentValue[i - 1]] + futureValue[i - 1] - currentValue[i - 1]);                 }             }         }         return dp[n][saving];     }.  Swiggy Selecting  Stocks

📌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 , 🇫🇷 All courses (100 rupees) Contact:- @meterials_available

Advanced SubArray Problem

Elections code

int winning_party(int voters, int votes[]) {     unordered_map vote_counts;         for (int i = 0; i < voters; ++i) {         vote_counts[votes[i]]++;     }         for (auto it = vote_counts.begin(); it != vote_counts.end(); ++it) {         if (it->second > voters / 2) {             return it->first;         }     }         return -1; } Elections

def is_prime(n): if n <= 1: return False if n <= 3: return True if n % 2 == 0 or n % 3 == 0: return False i = 5 while i * i <= n: if n % i == 0 or n % (i + 2) == 0: return False i += 6 return True def next_prime(N): if N <= 1: return 2 prime = N + 1 while True: if is_prime(prime): return prime prime += 1 # Test the function N = 4 print(next_prime(N)) # Output: 5

encoded_value = "" for digit in str(input1): encoded_value += str(int(digit) ** 2) return int(encoded_value) Minimum array sum