fa
Feedback
HYDERABAD BANGLORE REAL-ESTATE ||STOCKS || INVESTMENTS || PLOTS || RENTS

HYDERABAD BANGLORE REAL-ESTATE ||STOCKS || INVESTMENTS || PLOTS || RENTS

رفتن به کانال در Telegram
1 831
مشترکین
اطلاعاتی وجود ندارد24 ساعت
اطلاعاتی وجود ندارد7 روز
اطلاعاتی وجود ندارد30 روز
آرشیو پست ها
Python code Python3 program to check whether two # strings are Permutations of each other # function to check whether two strings # are Permutation of each other */ def arePermutation(str1, str2): # Get lenghts of both strings n1 = len(str1) n2 = len(str2) # If length of both strings is not same, # then they cannot be Permutation if (n1 != n2): return False # Sort both strings a = sorted(str1) str1 = " ".join(a) b = sorted(str2) str2 = " ".join(b) # Compare sorted strings for i in range(0, n1, 1): if (str1[i] != str2[i]): return False return True # Driver Code if name == '__main__': str1 = "test" str2 = "ttew" if (arePermutation(str1, str2)): print("Yes") else: print("No") @placementupdatess

Return nth prime number @placementupdatess #include <stdio.h> #include<math.h> int main () {   int rangenumber, c = 0, num = 2, i, letest = 0;   printf ("Enter Nth Number\n");   scanf ("%d", &rangenumber);   while (c != rangenumber)     {       int count = 0;       for (i = 2; i <= sqrt (num); i++) {   if (num % i == 0)     {       count++;       break;     } }       if (count == 0) {   c++;   letest = num; }       num = num + 1;     }   printf ("%dth prime number is %d ",rangenumber,letest);   return 0; } @placementupdatess

🔔 Zebra Technologies Off Campus Drive 2021: Freshers | Automation Test Engineer | BE / B.Tech/ M.Tech | Bangalore * Job Role : Automation Test Engineer * Job Location : Bangalore * Experience : Freshers (2018 – 2020 Batch) * Salary : Best In Industry https://aktupapers.in/Fresher-Jobs/Zebra-Technologies-Off-Campus-Hiring-2021-EXP-0-2-years.html

# real estate business startup # #write you code here boolean[][] matrix = new boolean[n][m]; for(int i = 0; i < n; i ++) { for(int j = 0; j < m; j++) { if(clients[i][0]<= houses[j][0] && clients[i][1] >= houses[j][1] ) matrix[i][j] = true; } } int [] matchR = new int [m]; Arrays.fill(matchR, -1); int result = 0; for(int u = 0 ; u< n; u++) { boolean[] isSeen = new boolean[m]; if(findHouse(matrix, u, isSeen, matchR)) { result++; } } return result; } static boolean findHouse(boolean[][] matrix, int clientU, boolean[] isSeen, int[] matchR ) { int length = isSeen.length; for(int v = 0; v < length; v ++) { if(matrix[clientU][v] == true && !isSeen[v]) { isSeen[v] = true; if(matchR[v] < 0 || findHouse(matrix, matchR[v], isSeen, matchR)) { matchR[v] = clientU; return true; } } } return false; }

Inheritance Code Solution class Vehicle{ private int regd; private String m; public void setm(String m) { this.m = m; } // initialize regd public void setregd(int regd) { this.regd = regd; } // access m public String getm() { return this.m; } // access regd public int getregd() { return this.regd; } } class Car extends Vehicle { private String name; private String color; public Car(String name,String color) { super(); this.name=name; this.color=color; } public String getName() { return this.name; } public String getColor() { return this.color; } }

Some of the ongoing contest with job opportunities 1.codeX by scaler (today at 8pm) Recruiter: It's partner companies Register: https://tinyurl.com/8cvr5r8c 2. Codechef April long challenge(ongoing) Recruiter: Amazon and Games craft Last date:12th April Register: https://tinyurl.com/292hy5k2 3.Code Gladiators by TechGig (ongoing) Recruiter:Ui path and cognizant Register: https://tinyurl.com/yzu2o8fj

Selva SK: zoho coding answers 1. hello-c 2. 23 3. 64 4. 13 5. 21 @placementupdatess 6. 5#Rahul 7. e 8. 000 9. 1093 10. equal 11. 27 12. 300 13. 42 14. 9 15. 11,11

Aptitude ans 1.62 2.93747 3.173 4.10 5.72 6.427 7.32 8.10 9.12 10.24 @placementupdatess