allcoding1

who has interest on trading or stock market📈 join this channel👇 @trading_10101

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer 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 , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (100 rupees) Contact:- @meterials_available

GenC PWD Hiring 2023 & 2024 Batch Apply link 👇 https://app.joinsuperset.com/join/#/signup/student/jobprofiles/07a89094-b25f-4041-b191-5bd8eb09a5aa

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer 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 , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses @ 70 rupees Contact:- @meterials_available

Ciena is hiring for Software Engineering DevOps New Grad Expected Salary : 10-20 LPA Batch : 2024/2023 passouts eligible Apply here : https://careers.ciena.com/us/en/job/CIENUSR025123ENUS/Software-Engineering-DevOps-New-Grad Telegram:- @allcoding1

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer 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 , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (100 rupees) Contact:- @meterials_available

#include <iostream> #include <vector> #include <numeric> using namespace std; double solve(const vector<int>& cnts) { vector<double> den = {0.20, 0.40, 1, 2, 5, 10}; double tot = 0.0; for (size_t i = 0; i < cnts.size(); ++i) { tot += cnts[i] * den[i]; } return tot; } int main() { vector<int> cnts; int input; while (cin >> input) { cnts.push_back(input); } cout << solve(cnts) << endl; return 0; }

#include <bits/stdc++.h> int getMinimumStress(int graph_nodes, int graph_edges, vector<pair<int, int>>& edges, vector<int>& weights, int source, int destination) { Graph graph(graph_nodes + 1); for (int i = 0; i < graph_edges; ++i) { int u = edges[i].first; int v = edges[i].second; int w = weights[i]; graph[u].push_back({v, w}); graph[v].push_back({u, w}); } priority_queue<pii, vector<pii>, greater<pii>> pq; vector<int> min_stress(graph_nodes + 1, INT_MAX ); pq.push({0, source}); min_stress[source] = 0; while (!pq.empty()) { int curr_stress = pq.top().first; int u = pq.top().second; pq.pop(); if (u == destination) { return curr_stress; } if (curr_stress > min_stress[u]) { continue; } for (const auto& neighbor : graph[u]) { int v = neighbor.first; int weight = neighbor.second; int next_stress = max(curr_stress, weight); if (next_stress < min_stress[v]) { min_stress[v] = next_stress; pq.push({next_stress, v}); } } } return -1; }

#include <iostream> #include <vector> #include <cmath> #include <string> #include <algorithm> using namespace std; int main() {     vector<string> k = {"1234567890", "qwertyuiop", "asdfghjkl", "zxcvbnm"};     string w;     getline(cin, w);     transform(w.begin(), w.end(), w.begin(), ::tolower);     vector<string> words;     string temp;     for (char c : w)     {         if (c == ' ')         {             if (!temp.empty())             {                 words.push_back(temp);                 temp.clear();             }         }         else         {             temp += c;         }     }     if (!temp.empty())     {         words.push_back(temp);     }     int t = 0;     for (string v : words)     {         int l = v.length();         vector<int> r(l, -1);         vector<int> p(l, -1);         for (int i = 0; i < l; ++i)         {             bool f = false;             for (int j = 0; j < k.size(); ++j)             {                 int c = k[j].find(v[i]);                 if (c != string::npos)                 {                     r[i] = j;                     p[i] = c;                     f = true;                     break;                 }             }             if (!f)             {                 break;             }         }         int c = 0;         for (int i = 1; i < l; ++i)         {             if (r[i] == r[i - 1] && abs(p[i] - p[i - 1]) <= 1)             {                 c += 1;             }             else             {                 if (c > 0)                 {                     if (r[i - 1] == -1)                     {                         t += 2;                     }                     else                     {                         t += 1;                     }                     c = 0;                 }             }         }         if (c > 0)         {             if (r[l - 1] == -1)             {                 t += 2;             }             else             {                 t += 1;             }         }     }     cout << t << endl;     return 0; }

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer 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 , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (100 rupees) Contact:- @meterials_available

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer 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 , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (100 rupees) Contact:- @meterials_available

Palindrome

Good sequence

import java.util.*; public class Maib {     private static int reverseNumber(int num) {         int reversed = 0;         while (num != 0) {             reversed = reversed * 10 + num % 10;             num /= 10;         }         return reversed;     }     private static int largestPossibleNumber(int num) {         char[] digits = String.valueOf(num).toCharArray();         Arrays.sort(digits);         StringBuilder largestNumStr = new StringBuilder(new String(digits)).reverse();         return Integer.parseInt(largestNumStr.toString());     }     private static List<Integer> splitIntoDigits(int num) {         List<Integer> digits = new ArrayList<>();         while (num != 0) {             digits.add(num % 10);             num /= 10;         }         Collections.reverse(digits);         return digits;     }     public static String processAndEncodeArray(int[] arr) {         for (int i = 0; i < arr.length; i++) {             arr[i] = reverseNumber(arr[i]);         }                 for (int i = 0; i < arr.length; i++) {             arr[i] = largestPossibleNumber(arr[i]);         }                 List<Integer> allDigits = new ArrayList<>();         for (int num : arr) {             allDigits.addAll(splitIntoDigits(num));         }                 Set<Integer> uniqueDigits = new LinkedHashSet<>(allDigits);         List<Integer> uniqueDigitList = new ArrayList<>(uniqueDigits);                 // Step 5: Generate the encoded string         StringBuilder encodedString = new StringBuilder();         for (int digit : uniqueDigitList) {             if (digit == 0) {                 encodedString.append('$');             } else if (digit % 2 == 0) {                 encodedString.append('*');             } else {                 encodedString.append('#');             }         }                 return encodedString.toString();     }     public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);         int n = scanner.nextInt();         int[] arr = new int[n];         for (int i = 0; i < n; i++) {             arr[i] = scanner.nextInt();         }        String result = processAndEncodeArray(arr);         System.out.println(result);     } }

class Result {     public static void goodSequence(BufferedReader bufferedReader) throws IOException {         StringTokenizer st = new StringTokenizer(bufferedReader.readLine());         int T = Integer.parseInt(st.nextToken());         for (int t = 0; t < T; t++) {             st = new StringTokenizer(bufferedReader.readLine(), ",");             int N = Integer.parseInt(st.nextToken());             int M = Integer.parseInt(st.nextToken());             st = new StringTokenizer(bufferedReader.readLine(), ",");             int[] sequence = new int[N];             for (int i = 0; i < N; i++) {                 sequence[i] = Integer.parseInt(st.nextToken());             }             String result = solveTestCase(N, M, sequence);             System.out.println(result);         }     }     private static String solveTestCase(int N, int M, int[] sequence) {                 int countDivisible = 0;         for (int x : sequence) {             if (x % M == 0) {                 countDivisible++;             }         }         if (countDivisible == 0) {             return "0/1";         }         long totalSubsequences = (1L << N) - 1;         long goodSubsequences = (1L << countDivisible) - 1;         long P = goodSubsequences;         long Q = totalSubsequences;         long commonDivisor = gcd(P, Q);         P /= commonDivisor;         Q /= commonDivisor;         return P + "/" + Q;     }     private static long gcd(long a, long b) {         while (b != 0) {             long temp = b;             b = a % b;             a = temp;         }         return a;     } }

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer 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 , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (100 rupees) Contact:- @meterials_available

Only today night