Email-Joshi, Vikram (Contractor X C f M Gmail 15m left ALL 0 1 2 HackerRank Question-Distinct X + hackerrank.com/test/ei
Posted: Thu May 05, 2022 12:47 pm
- Email Joshi Vikram Contractor X C F M Gmail 15m Left All 0 1 2 Hackerrank Question Distinct X Hackerrank Com Test Ei 1 (80.59 KiB) Viewed 80 times
solve in java 8
- Email Joshi Vikram Contractor X C F M Gmail 15m Left All 0 1 2 Hackerrank Question Distinct X Hackerrank Com Test Ei 2 (75.87 KiB) Viewed 80 times
i want is possible code
i dont have full question screenshot its mentioned on hackerrank you will get there full question please provide solution
Email-Joshi, Vikram (Contractor X C f M Gmail 15m left ALL 0 1 2 HackerRank Question-Distinct X + hackerrank.com/test/eifsidn6q35/questions/6h5sacnq513 * ☐ YouTube Maps Info 3 BETA Can't read the text? Switch theme 22 V 23 5. Distinct Digit Numbers 24 ✓ 25 26 Given a range of integers, determine how many numbers have no repeating digits. 27 28 29 Example 36 30 ✓ n=80 31 m=120 32 Line: 27 Col: 16 Submit Test Results Custom Input Run Code Run Tests The lower and upper bounds are inclusive, so there are 120-79-41 values in the range. Numbers without repeating characters are normal weight and green. Others are bold and red. The two columns to the right are the valid number counts per row (green) and invalid number counts (bold/red). Compiled successfully. 10/11 test cases passed Use print or log statements to debug why your hidden test cases are failing. Hidden test cases are used to evaluate if your code can handle different scenarios, including corner cases. 80 81 82 83 84 85 86 87 90 91 92 93 94 95 96 97 Test case 10 Compiler Message 100 101 102 103 104 105 106 107 Time limit exceeded Allowed time limit: 4 secs Test case 0 110 111 112 113 114 115 116 117 Your code did not execute in time. Please optimize your code. For more details on runtime environment, click the "info" button 120 Test case 1 Your Output (stdout) Test case 2 A OL "" H ENG IN 40) D 5 Java 8 Autocomplete Ready for (int i=0;i<item.size(); i++) { A[x]=item.get(i); } x++; for (int i=0;i<arr.size(); i++) { int 1=A[0]; int r=A[1][1]; 12 X O 17:16 31-03-2022
Mail-Dubey, Suryansh (Contract X ← → 58m left ALL ✪ 2 3 5 HackerRank Question - Is Possib x + hackerrank.com/test/eifsidn6q35/questions/np712m6m BETA Can't read the text? Switch theme 5. Is Possible Consider a pair of integers, (a, b). The following operations can be performed on (a, b) in any order, zero or more times. • (a, b)(a + b, b) . • (a, b) (a, a + b) Return a string that denotes whether or not (a, b) can be converted to (c. d) by performing the operation zero or more times. Example (a, b) = (1, 1) (c,d)=(5,2) Perform the operation (1, 1+ 1) to get (1, 2), perform the operation (1+2, 2) to get (3, 2), and perform the operation (3+2, 2) to get (5,2). Alternatively, the first operation could be (1+1, 1) to get (2, 1) and so on. The diagram below demonstrates the example ● Info O 31 32 33 @ 12 C# A Autocomplete Disabled O 20000 public static string isPossible(int a, int b, int c, int d) { return gcd(a,b)==gcd (c,d) ? "Yes" : "No"; 34 } 35 36 public static long gcd (long p, long q) 37 { 38 return q==0 ? p: gcd (q,p%q); 39 } 40 Test Results Custom Input Run Code Run Tests Compiled successfully. 9/10 test cases passed Use print or log statements to debug why your hidden test cases are failing. Hidden test cases are used to evaluate if your code can handle different scenarios, including corner cases. Test case 0 Your Output (stdout) 1 Yes Test case 1 Test case 2 X 0: ? : Line: 16 Col: 1 Submit 3