allcoding1_official

Guys ❤️ ✅SALES 🧿telegram ( @allcoding1 channel) =30k rupees 🅾️ Instagram (https://instagram.com/allcoding_1?igshid=YmMyMTA2M2Y=) = 10k rupees If anybody want contact:-@Priya_MD Guys ❤️ 🙏Pls genuine person msg for me

Guys ❤️ Anybody want a telegram ( @allcoding channel) 30k rupees contact:-@Priya_MD

Python Anagrams Code Telegram - @allcoding1

C language Max occurring character Telegram -@allcoding1

Christmas Eve code in java : public class Example2 { // this will be the solution static int solutionCount = 0; public static void canCollect(int remainingAmount, int remainingHouses, int previousAmount) { if (remainingHouses == 0) return; if (remainingAmount < 0) return; if (remainingAmount == 0) { solutionCount++; return; } for (int i = 1; i < previousAmount; i++) { //deduct amount collected from this house-visit (i), deduct 1 from remaining houses, and set previousAmount to what you are collecting here canCollect(remainingAmount - i, remainingHouses - 1, i); } } // This is your solution function, although you'll need to change allcoding1 it enough to satisfy test-cases. public static int solutionFunction(int x, int y) { for (int i = 0; i <= x; i++) { canCollect(x - i, y-1, i); } return solutionCount; } //main is just to execute it here. Omit it in your submission public static void main(String args[]) { System.out.println(solutionFunction(5,5)); //3 } } Java Christmas Eve Telegram - @allcoding1

Playing with Number static int[] shiftArray(int input1, int[] input2, int input3) { int ar[]=new int[input2.length]; int j=0; for(int i=input3;i<input2.length;i++) { ar[j++]=input2[i]; } for(int i=0; i<input3;i++) { ar[j++]=input2[i]; } return ar; } Test cases input1=7; input2[]= {1,2,3,4,5,6,7}; input3=2; output: 3 4 5 6 7 1 2 Array Sort(nick checks) private static int getCount(int input1, int[] input2) { int ar[]=new int[input2.length]; for(int i =0;i<input2.length;i++) { ar[i]=input2[i]; } Arrays.sort(ar); int num=ar[0]; for(int i=0;i<input2.length;i++) { if(ar[i]!=num) return 0; num++; } return 1; } Test Case: input1:6 input2[]: {3,7,2,5,4,6} output: 1 Fancy Occurrence private static String fancyOcc(String input1, String input2) { String s=""; char com=input2.charAt(0); for(int i= 0; i<input1.length();i++) { char ch=input1.charAt(i); if(ch!=com) s=s+ch; } return s; } Test Case: input1:Welcome to metti input2:i output: Welcome to mett String Within String private static String isPermutation(String input1,String input2) { input1=input1.toLowerCase(); input2=input2.toLowerCase(); int arr1[] = new int[26]; int arr2[] = new int[26]; for(int i=0; i<input1.length();i++) { char ch = input1.charAt(i); arr1[ch-97]++; } for(int i=0;i<input2.length();i++) { char ch1 = input2.charAt(i); arr2[ch1-97]++; if(arr1[ch1-97]<arr2[ch1-97]) return "no"; } return "yes"; } Test Case: input1: abab input2: ab output: yes Palindrome private static int isPalindrome(String input1) { int j = input1.length(); for(int i=0;i<s.length()/2;i++) { char ch= input1.charAt(i); if(ch!= input1.charAt(j-1)) return 0; j--; } return 1; } Test Case: input1: level output: 1 Max occurring character private static String maxOccurance(String input1) { char[] c=new char[26]; String s=""; for(int i=0;i<input1.length();i++) { char ch= input1.charAt(i); c[ch-97]++; } int max=0; for(int i=1;i<26;i++) { if(c[max]<c[i]) max=i; } for(int i=0;i<26;i++) { if(c[i]==c[max]&&i!=max) return "0"; } return s+(char)(max+97); } Test cases: input1 : abcdd output : d Number Sum private static int sum(int input1, int[] input2) { int max=input2[0]; int min=input2[0]; for(int i=1;i<input2.length;i++) { if(max<input2[i]) max=input2[i]; if(min>input2[i]) min=input2[i]; } return max+min; } Test cases: input 1: 7 input 2: { 7,2,6,15,54,10,23} output : 56 Anagram private static String isAnagarm (String input1,String input2) { int n1 = input1.length(); int n2 = input2.length(); if (n1 != n2) return "no"; input1=input1.toUpperCase(); input2=input2.toUpperCase(); int a[]= new int[26]; int a2[]= new int[26]; for(int i=0;i<n1;i++) { char ch= input1.charAt(i); a[ch-65]++; } for(int i=0;i<n2;i++) { char ch= input2.charAt(i); a2[ch-65]++; } for (int i = 0; i < 26; i++) if (a[i] != a2[i]) return "no"; return "yes"; } Test cases: input1:build input : dubli output : yes Coin Counts private static int getcount(int input1) { int coin=0; while(input1!=0) { coin=coin+(input1*input1); input1--; } return coin; } Test cases: input1 : 2 output : 5 Electro Static private static int electroStatic(int[] input1, String input2, int input3) { int sum=0; for(int i = 0;i<input3;i++) { char ch = input2.charAt(i); switch(ch) { case 'P': sum=sum+input1[i]; break; case 'N': sum=sum-input1[i]; break; } } return sum*100; } Test cases: input1 : {4,3,5} input2 : PNP input3 : 3 output : 600 Reverse Array public static int[] reverseArray(int [] input1,int input2) { int [] ars=new int[input2]; int k=0; for(int i=input2-1;i>=0;i--) { ars[k]=input1[i]; k++; } return ars; } @allcoding1

C++ Nth character in Decrypted String Telegram -@allcoding1

struct Result pushZeroesEnd(int input1[], int input2){ Result* ans = new Result(); int k = 0, count = 0; for(int i = 0; i < input2; i++){ if(input1[i] == 0) count += 1; else ans->output1[k++] = input1[i]; } while(count--) ans->output1[k++] = 0; return *ans; }; Python & C++ Push zeros to end Telegram - @allcoding1

Duplicates Language C+17 , C+20 Telegram - @allcoding1

Missing Braces Python 3 Telegram👇 @allcoding1 @allcoding1 @allcoding1 @allcoding1 @allcoding1 @allcoding1 ⚠️ Share post in ur college and telegram Group's

Missing Braces Python 3 Accenture Answer's Telegram👇 @allcoding1 @allcoding1 @allcoding1 @allcoding1 @allcoding1 @allcoding1 ⚠️ Share post in ur college and telegram Group's

Both of the given options Virtusa exam Ans 9:30 AM @allcoding1 @allcoding1 @allcoding1 @allcoding1 ✅ Share with your friends and college group's

$1,200 Virtusa exam Ans 9:30 AM @allcoding1 @allcoding1 @allcoding1 @allcoding1 ✅ Share with your friends and college group's

The amount paid...85 Virtusa exam Ans 9:30 AM @allcoding1 @allcoding1 @allcoding1 @allcoding1 ✅ Share with your friends and college group's

75% Virtusa exam Ans 9:30 AM @allcoding1 @allcoding1 @allcoding1 @allcoding1 ✅ Share with your friends and college group's

6,9,5 Virtusa exam Ans 9:30 AM @allcoding1 @allcoding1 @allcoding1 @allcoding1 ✅ Share with your friends and college group's

Hello Virtusa exam Ans 9:30 AM @allcoding1 @allcoding1 @allcoding1 @allcoding1 ✅ Share with your friends and college group's