allcoding1_official

Guys ❤️ TCS NQT Answers are available Instagram Once check it https://instagram.com/allcoding_1?igshid=YmMyMTA2M2Y= https://instagram.com/allcoding_1?igshid=YmMyMTA2M2Y= Telegram:-@allcoding1

C Telegram:-@allcoding1

None follow Telegram:-@allcoding1

D Telegram:-@allcoding1

B Telegram:-@allcoding1

Guys ❤️ Answers are available Instagram https://instagram.com/allcoding_1?igshid=YmMyMTA2M2Y= https://instagram.com/allcoding_1?igshid=YmMyMTA2M2Y= Telegram:-@allcoding1

Telegram:-@allcoding1

B Telegram:-@allcoding1

TCS NQT Verbal Q)I advised him Ans) d Q) 2020 was Ans) no error Q) neither of the four sons Ans) neither or nor Q)The adverse impacts Ans) C and d Q) With the spread Ans) QR Q) pranay Ans) has been working Telegram - @allcoding1

TCS NQT 9 am Answers 1- X-5 2-14 3-8 4-50 5-91.2 6-735 7-166.66% 9-12000 10-4200 11-1900,2100 14-3 17-22 min Telegram:-@allcoding1

🎯 Accenture Associate Software Engineer Hiring | 4.5 LPA Job Title : Associate Software Engineer Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc Batch : 2022 / 2021 Salary : Rs 4.5 LPA Apply Now:- https://www.allcoding1.com/2022/07/accenture-associate-software-engineer.html Telegram:-@allcoding1

A Telegram:-@allcoding1

Polymorphism Telegram:-@allcoding1

Encapsulation Telegram:-@allcoding1

For Telegram:-@allcoding1

🎯 Accenture Associate Software Engineer Hiring | 4.5 LPA Job Title : Associate Software Engineer Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc Batch : 2022 / 2021 Salary : Rs 4.5 LPA Apply Now:- https://www.allcoding1.com/2022/07/accenture-associate-software-engineer.html Telegram:-@allcoding1

#include <bits/stdc++.h> #define n 3 using namespace std; int findLongestFromACell(int i, int j, int mat[n][n], int dp[n][n]) { if (i < 0 i >= n j < 0 || j >= n) return 0; if (dp[i][j] != -1) return dp[i][j]; int x = INT_MIN, y = INT_MIN, z = INT_MIN, w = INT_MIN; if (j < n - 1 && ((mat[i][j] + 1) == mat[i][j + 1])) x = 1 + findLongestFromACell(i, j + 1, mat, dp); if (j > 0 && (mat[i][j] + 1 == mat[i][j - 1])) y = 1 + findLongestFromACell(i, j - 1, mat, dp); if (i > 0 && (mat[i][j] + 1 == mat[i - 1][j])) z = 1 + findLongestFromACell(i - 1, j, mat, dp); if (i < n - 1 && (mat[i][j] + 1 == mat[i + 1][j])) w = 1 + findLongestFromACell(i + 1, j, mat, dp); return dp[i][j] = max({x, y, z, w, 1}); } int LongestPath(int mat[n][n]) { int result = 1; int dp[n][n]; memset(dp, -1, sizeof dp); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (dp[i][j] == -1) findLongestFromACell(i, j, mat, dp); result = max(result, dp[i][j]); } } return result; } int main() { int mat[n][n] = {{1, 2, 9}, {5, 3, 8}, {4, 6, 7}}; cout << "Length of the longest path is " << LongestPath(mat); return 0; } Telegram:-@allcoding1

#include <bits/stdc++.h> #define n 3 using namespace std; int findLongestFromACell(int i, int j, int mat[n][n], int dp[n][n]) { if (i < 0 i >= n j < 0 || j >= n) return 0; if (dp[i][j] != -1) return dp[i][j]; int x = INT_MIN, y = INT_MIN, z = INT_MIN, w = INT_MIN; if (j < n - 1 && ((mat[i][j] + 1) == mat[i][j + 1])) x = 1 + findLongestFromACell(i, j + 1, mat, dp); if (j > 0 && (mat[i][j] + 1 == mat[i][j - 1])) y = 1 + findLongestFromACell(i, j - 1, mat, dp); if (i > 0 && (mat[i][j] + 1 == mat[i - 1][j])) z = 1 + findLongestFromACell(i - 1, j, mat, dp); if (i < n - 1 && (mat[i][j] + 1 == mat[i + 1][j])) w = 1 + findLongestFromACell(i + 1, j, mat, dp); return dp[i][j] = max({x, y, z, w, 1}); } int LongestPath(int mat[n][n]) { int result = 1; int dp[n][n]; memset(dp, -1, sizeof dp); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (dp[i][j] == -1) findLongestFromACell(i, j, mat, dp); result = max(result, dp[i][j]); } } return result; } int main() { int mat[n][n] = {{1, 2, 9}, {5, 3, 8}, {4, 6, 7}}; cout << "Length of the longest path is " << LongestPath(mat); return 0; } Telegram:-@allcoding1

// 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