Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

lti code-python @Coding_000

LTI CODE PYTHON @Coding_000

a = input() b = "aeiouAEIOU" c = "" for i in a:     if i in b:         continue     else:         c+=i print(len(c)) LTI code Python3-@Coding_000

#include<stdio.h> int main() {     int n,i,dis,c=0;     scanf("%d %d",&n,&dis);     int order[n];     for(i=0;i<n;i++)     {         scanf("%d",&order[i]);         if(order[i]>0 && dis%order[i]==0)             c++;     }     printf("%d",c); } E-commerce code-c language @Coding_000

a=input() b= input() m,n=len(a),len(b) vow="aeiou" DP= [[0 for i in range(n + 1)]for j in range(m + 1)] i, j = 0, 0 for i in range(m + 1):     for j in range(n + 1):         if (i == 0 or j == 0):             DP[i][j] = 0         elif ((a[i - 1] == b[j - 1]) and a[i - 1] in vow):             DP[i][j] = DP[i - 1][j - 1] + 1         else:             DP[i][j] = max(DP[i - 1][j],DP[i][j - 1]) print(DP[m][n]) Vowels program

LTI Help Available If you also want to crack your current placements Limited Slots available Book your slots ASAP Scroll above and check the work 💯 Clearence Note: It's paid

function numberOfConnections(gridOfNodes) {     var countOfOnes = [];     var countOfOnes = new Array();     let n = gridOfNodes.length;     let m = gridOfNodes[0].length;     for (let i = 0; i < = n - 1; i++)     {         let val = 0;         for (let j = 0; j < = m - 1; j++)             if (gridOfNodes[i][j] == 1)                 val++;         if (val != 0)             countOfOnes.push(val);     }     let connections = 0;     if (countOfOnes.length >= 2)         for (let i = 0; i <= countOfOnes.length - 2; i++)             connections += countOfOnes[i] * countOfOnes[i + 1];     return connections; } Grid climbing -capgemini Language JavaScript @Coding_000

function findSubsequence(arr) {     var a = [-1];     var list = [];     const letters = new Set();     let maxInteger = 0;     for (let i = 0; i < = arr.length - 1; i++)     {         if (letters.has(arr[i]))         {             if (maxInteger <= arr[i])             {                 maxInteger = arr[i];                 list.push(arr[i]);             }             else             {                 return a;             }         }         else         {             letters.add(arr[i]);         }     }     return list; } Subsequence Removal Language JavaScript @Coding_000

Guys anybody free now just msg me once @ILOVEU_000

📢📢📢📢📢📢📢📢📢📢📢📢📢📢 Guys share the screenshot of the channel in all large and small group ↗️ Also share with your friends 🤝 @Coding_000 If more people join the channel will provide any coding solution for free here in the channel 💥💥💥 @Coding_000 Share ↗️ Share ↗️ Share ↗️ @Coding_000  Free ♐️ Free ♐️ Free ♐️ post your coding  questions here👇👇 https://t.me/+TF1M5QbSkTEwNjA1 https://t.me/+TF1M5QbSkTEwNjA1 ✅Share✅Share✅Share ✅share✅

📢📢📢📢📢📢📢📢📢📢📢📢📢📢 Guys share the screenshot of the channel in all large and small group ↗️ Also share with your friends 🤝 @Coding_000 If more people join the channel will provide any coding solution for free here in the channel 💥💥💥 @Coding_000 Share ↗️ Share ↗️ Share ↗️ @Coding_000  Free ♐️ Free ♐️ Free ♐️ post your coding  questions here👇👇 https://t.me/+TF1M5QbSkTEwNjA1 https://t.me/+TF1M5QbSkTEwNjA1 ✅Share✅Share✅Share ✅share✅

Binary to factorials Python 3 @Coding_000

📢📢📢📢📢📢📢📢📢📢📢📢📢📢📢 Guys share the screenshot of the channel in all large and small group ↗️ Also share with your friends 🤝 @Coding_000 If more people join the channel will provide any coding solution for free here in the channel 💥💥💥 @Coding_000 Share ↗️ Share ↗️ Share ↗️ @Coding_000 Free ♐️ Free ♐️ Free ♐️ post your questions here👇👇 https://t.me/+TF1M5QbSkTEwNjA1 https://t.me/+TF1M5QbSkTEwNjA1 ✅Share✅Share✅Share ✅share✅

childrens day -c++ @Coding_000

HaPpY EngineerS DAY😁

public class Solution {     int M = 1000000007;     public int numDecodings(String s) {         long first = 1, second = s.charAt(0) == '*' ? 9 : s.charAt(0) == '0' ? 0 : 1;         for (int i = 1; i < s.length(); i++) {             long temp = second;             if (s.charAt(i) == '*') {                 second = 9 * second;                 if (s.charAt(i - 1) == '1')                     second = (second + 9 * first) % M;                 else if (s.charAt(i - 1) == '2')                     second = (second + 6 * first) % M;                 else if (s.charAt(i - 1) == '*')                     second = (second + 15 * first) % M;             } else {                 second = s.charAt(i) != '0' ? second : 0;                 if (s.charAt(i - 1) == '1')                     second = (second + first) % M;                 else if (s.charAt(i - 1) == '2' && s.charAt(i) <= '6')                     second = (second + first) % M;                 else if (s.charAt(i - 1) == '*')                     second = (second + (s.charAt(i) <= '6' ? 2 : 1) * first) % M;             }             first = temp;         }         return (int) second;     } } Java Spy Agent Sam Code

COGNIZANT & HEXAWARE EXAM SOLUTION GROUP: https://t.me/+TF1M5QbSkTEwNjA1 https://t.me/+TF1M5QbSkTEwNjA1

Top 100 Java Interview Questions & Answers: @Coding_000

largest subarray-python @Coding_000