[Solved] Find duplicate number in array and print the last duplicate number only [closed]

[ad_1] Simple way is iterate and compare it. like below, I hope it may solve your problem int[] a = {1,2,2,3,4,3,5,5,7}; String b = “”; int count=0; for(int i = 0; i<a.length;i++){ for(int j=0; j<a.length;j++){ if(a[i]==a[j]){ count++; } } if(count>1){ count=0; b = String.valueOf(a[i]); }else{ count = 0; } } System.out.println(“last duplicate value : ” … Read more

[Solved] Custom radix columns (+special characters) [closed]

[ad_1] How about using the basic base 10 to any base conversion, modified for custom digits: func numberToCustomRadix(_ number: Int, alphabet: String) -> String { let base = alphabet.count var number = number var result = “” repeat { let idx = alphabet.index(alphabet.startIndex, offsetBy: number % base) result = [alphabet[idx]] + result number /= base … Read more

[Solved] Java language – show number 1-100

[ad_1] Your logic to print is fine, all you need to do is to wrap the code into a for loop and excute it from 1 to 100, e.g.: for(int zmienna = 0 ; zmienna <= 100 ; zmienna++){ if (zmienna % 5 == 0 && zmienna % 3 == 0) System.out.println(“FizzBizz”); else if (zmienna … Read more

[Solved] C# get pair closest to value [closed]

[ad_1] You want something like this: public static Pair FindClosest(IEnumerable<Pair> list, int value) { Pair closest = null; if (list != null && list.Count() > 0) { foreach (var pair in list) { if (value <= pair.Max) { closest = pair; break; } } if (closest == null) { closest = list.Last(); } } return … Read more

[Solved] How can I solve this String length problem?

[ad_1] Have you tried calculating the length within the function rather than in the console log? This ensures that all of the logic is first completed within the function before it is returned in the console log. Your function expects the string name, but you are passing name.length function getNameLength(name){ return name.length; } console.log(getNameLength(‘John’)); console.log(getNameLength(‘Argentina!’)); … Read more

[Solved] convert Decimal to signed 2’s compliment and vice versa in vanilla javascript

[ad_1] Check this out may it will help you. (function(){ var ConvertBase = function (num) { return { from : function (baseFrom) { return { to : function (baseTo) { return parseInt(num, baseFrom).toString(baseTo); } }; } }; }; // binary to decimal ConvertBase.bin2dec = function (num) { return ConvertBase(num).from(2).to(10); }; // binary to hexadecimal ConvertBase.bin2hex … Read more

[Solved] Finding consecutive letters in a list [closed]

[ad_1] def consecutiveLetters(word): currentMaxCount = 1 maxChar=”” tempCount = 1 for i in range(0, len(word) – 2): if(word[i] == word[i+1]): tempCount += 1 if tempCount > currentMaxCount: currentMaxCount = tempCount maxChar = word[i] else: currentMaxCount = 1 return [maxChar,tempCount] result = consecutiveLetters(“TATAAAAAAATGACA”) print(“The max consecutive letter is “, result[0] , ” that appears “, result[1], … Read more