allcoding1_official

// Java program to find next greater // number with same set of digits. import java.util.Arrays; public class nextGreater { // Utility function to swap two digit static void swap(char ar[], int i, int j) { char temp = ar[i]; ar[i] = ar[j]; ar[j] = temp; } // Given a number as a char array number[], // this function finds the next greater number. // It modifies the same array to store the result static void findNext(char ar[], int n) { int i; // I) Start from the right most digit // and find the first digit that is smaller // than the digit next to it. for (i = n - 1; i > 0; i--) { if (ar[i] > ar[i - 1]) { break; } } // If no such digit is found, then all // digits are in descending order means // there cannot be a greater number with // same set of digits if (i == 0) { System.out.println("Not possible"); } else { int x = ar[i - 1], min = i; // II) Find the smallest digit on right // side of (i-1)'th digit that is greater // than number[i-1] for (int j = i + 1; j < n; j++) { if (ar[j] > x && ar[j] < ar[min]) { min = j; } } // III) Swap the above found smallest // digit with number[i-1] swap(ar, i - 1, min); // IV) Sort the digits after (i-1) // in ascending order Arrays.sort(ar, i, n); System.out.print("Next number with same" + " set of digits is "); for (i = 0; i < n; i++) System.out.print(ar[i]); } } public static void main(String[] args) { char digits[] = { '5','3','4','9','7','6' }; int n = digits.length; findNext(digits, n); } } Java Find next greater Telegram - @allcoding1

#include<bits/stdc++.h> using namespace std; struct node { int data; node *left, *right; }; bool identicalTree(node* root1, node* root2){ if(root1 && root2) { if(root1->data == root2->data && identicalTree(root1->left, root2->left) && identicalTree(root1->right, root2->right)) return true; return false; } else if(!root1 && !root2) return true; return false; } node* create(int data){ node* tmp = new node(); tmp->data = data; tmp->left = tmp->right = NULL; return tmp; } int main() { node* root1 = create(2); root1->left = create(1); root1->right = create(3); node* root2 = create(2); root2->left = create(1); root2->right = create(3); cout<<(identicalTree(root1, root2) ? "1" : "0"); } C++ Count subtrees with digit sum K Telegram - @allcoding1

C++ Trees identical code Telegram - @allcoding1

🎯Capgemini Drive 2022 | For Financial Reporting Degree : Any Bachelor Degree Batch : 2019, 2020, 2021, 2022 CTC : ₹ 6 LPA* Apply now:- https://www.allcoding1.com/2022/07/capgemini-drive-2022-for-financial.html Telegram:-@allcoding1

🎯 ColorTokens Off Campus Drive | B.E/B.Tech/M.E/M.Tech | Rs 7 LPA Job Role : Member Technical Staff/QA Engineer Qualification : B.E/B. Tech/M.E/M.Tech Experience : Freshers Batch : 2021 & 2022 batch Salary : Rs 7 LPA Apply:- 🔔 ColorTokens Off Campus Drive 2022 | B.E/B.Tech/M.E/M.Tech | Rs 7 LPA * Job Role : Member Technical Staff/QA Engineer * Qualification : B.E/B. Tech/M.E/M.Tech * Experience : Freshers * Batch : 2021 & 2022 batch * Salary : Rs 7 LPA Apply:- https://www.allcoding1.com/2022/07/colortokens-off-campus-drive.html Telegram:-@allcoding1

Amazon is Hiring Role: Cloud Support Associate Education: Bachelor’s Degree in Engineering Branch: CSE/IT/ECE/EEE Experience: 0-1 years of experience Direct Apply Link:- https://www.allcoding1.com/2022/07/amazon-is-hiring.html Job Location: Hyderabad Telegram:- @allcoding1

INFOSYS Training final IBM exam @Infosys_Ans

int(input()) print(len(set(input()))) python3 Hcl unique characters code Telegram:-@allcoding1

Java Reverse String Telegram - @allcoding1

import java.io.BufferedReader; import java.io.File; import java.io.FileReader; import java.util.Arrays; public class MainClass { public static void main(String[] args) throws Exception { File file = new File(ClassLoader.getSystemResource("input.txt").getFile()); BufferedReader reader = new BufferedReader(new FileReader(file)); // creating original list String sizeOri = reader.readLine(); int intOri = Integer.parseInt(sizeOri); String oriList[] = new String[intOri]; int i = 0; while (intOri > 0) { String line = reader.readLine(); oriList[i] = line; intOri--; i++; } // creating original price list String sizeOriPrice = reader.readLine(); int intOriPrice = Integer.parseInt(sizeOriPrice); double oriListPrice[] = new double[intOriPrice]; i = 0; while (intOriPrice > 0) { String line = reader.readLine(); oriListPrice[i] = Double.parseDouble(line); intOriPrice--; i++; } // creating user list String sizeUser = reader.readLine(); int intUser = Integer.parseInt(sizeUser); String listUser[] = new String[intUser]; i = 0; while (intUser > 0) { String line = reader.readLine(); listUser[i] = line; intUser--; i++; } // allcoding1 creating user price list String sizeUserPrice = reader.readLine(); int intUserPrice = Integer.parseInt(sizeUserPrice); double userListPrice[] = new double[intUserPrice]; i = 0; while (intUserPrice > 0) { String line = reader.readLine(); userListPrice[i] = Double.parseDouble(line); intUserPrice--; i++; } int output = verifyItems(oriList, oriListPrice, listUser, userListPrice); System.out.println(output); } public static int verifyItems(String[] oriList, double[] oriListPrice, String[] listUser, double[] userListPrice) { int changed = 0; for (int i = 0; i < listUser.length; i++) { if (userListPrice[i] != oriListPrice[Arrays.asList(oriList).indexOf(listUser[i])]) { changed += 1; } } return changed; } } Modify prices code in java Epam exam

import java.io.BufferedReader; import java.io.File; import java.io.FileReader; import java.util.Arrays; public class MainClass { public static void main(String[] args) throws Exception { File file = new File(ClassLoader.getSystemResource("input.txt").getFile()); BufferedReader reader = new BufferedReader(new FileReader(file)); // creating original list String sizeOri = reader.readLine(); int intOri = Integer.parseInt(sizeOri); String oriList[] = new String[intOri]; int i = 0; while (intOri > 0) { String line = reader.readLine(); oriList[i] = line; intOri--; i++; } // creating original price list String sizeOriPrice = reader.readLine(); int intOriPrice = Integer.parseInt(sizeOriPrice); double oriListPrice[] = new double[intOriPrice]; i = 0; while (intOriPrice > 0) { String line = reader.readLine(); oriListPrice[i] = Double.parseDouble(line); intOriPrice--; i++; } // creating user list String sizeUser = reader.readLine(); int intUser = Integer.parseInt(sizeUser); String listUser[] = new String[intUser]; i = 0; while (intUser > 0) { String line = reader.readLine(); listUser[i] = line; intUser--; i++; } // creating user price list String sizeUserPrice = reader.readLine(); int intUserPrice = Integer.parseInt(sizeUserPrice); double userListPrice[] = new double[intUserPrice]; i = 0; while (intUserPrice > 0) { String line = reader.readLine(); userListPrice[i] = Double.parseDouble(line); intUserPrice--; i++; } int output = verifyItems(oriList, oriListPrice, listUser, userListPrice); System.out.println(output); } public static int verifyItems(String[] oriList, double[] oriListPrice, String[] listUser, double[] userListPrice) { int changed = 0; for (int i = 0; i < listUser.length; i++) { if (userListPrice[i] != oriListPrice[Arrays.asList(oriList).indexOf(listUser[i])]) { changed += 1; } } return changed; } } Modify prices code in java Epam exam

Array sort code in java 8 All test case pass Telegram:-@allcoding1

Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree. class Solution { public: int d=INT_MAX; void f(TreeNode* root) { if(root==NULL) return; if(root->left!=NULL) { d=min((root->val-root->left->val),d); f(root->left); } if(root->right!=NULL) { d=min((root->val-root->right->val),d); f(root->left); } } int getMinimumDifference(TreeNode* root) { f(root); return abs(d); } }; Telegram:-@allcoding1

Seventeen Again Language C++ telegram:-@allcoding1

🎯 Revature Recruitment 2022 : Hiring Freshers as Software Engineer With 6 LPA Designation : Entry Level Software Engineer Batch : 2019/2020/2021/2022 Eligibility : BE/B.Tech/ ME/ M.Tech/MCA/MSc Salary : Rs 4-6 LPA Apply Now:- https://www.allcoding1.com/2022/07/revature-recruitment-2022-hiring.html Telegram:- @allcoding1

import java.io.BufferedReader; import java.io.File; import java.io.FileReader; import java.util.Arrays; public class MainClass { public static void main(String[] args) throws Exception { File file = new File(ClassLoader.getSystemResource("input.txt").getFile()); BufferedReader reader = new BufferedReader(new FileReader(file)); // creating original list String sizeOri = reader.readLine(); int intOri = Integer.parseInt(sizeOri); String oriList[] = new String[intOri]; int i = 0; while (intOri > 0) { String line = reader.readLine(); oriList[i] = line; intOri--; i++; } // creating original price list String sizeOriPrice = reader.readLine(); int intOriPrice = Integer.parseInt(sizeOriPrice); double oriListPrice[] = new double[intOriPrice]; i = 0; while (intOriPrice > 0) { String line = reader.readLine(); oriListPrice[i] = Double.parseDouble(line); intOriPrice--; i++; } // creating user list String sizeUser = reader.readLine(); int intUser = Integer.parseInt(sizeUser); String listUser[] = new String[intUser]; i = 0; while (intUser > 0) { String line = reader.readLine(); listUser[i] = line; intUser--; i++; } // creating user price list String sizeUserPrice = reader.readLine(); int intUserPrice = Integer.parseInt(sizeUserPrice); double userListPrice[] = new double[intUserPrice]; i = 0; while (intUserPrice > 0) { String line = reader.readLine(); userListPrice[i] = Double.parseDouble(line); intUserPrice--; i++; } // calling logic for checking allcoding1 int output = verifyItems(oriList, oriListPrice, listUser, userListPrice); System.out.println(output); } public static int verifyItems(String[] oriList, double[] oriListPrice, String[] listUser, double[] userListPrice) { int changed = 0; for (int i = 0; i < listUser.length; i++) { if (userListPrice[i] != oriListPrice[Arrays.asList(oriList).indexOf(listUser[i])]) { changed += 1; } } return changed; } } Modify prices code in java Telegram:-@allcoding1

Uncrossablr pleasentries code in java Telegram:-@allcoding1

Gardens design code in java Telegram:-@allcoding1