Sollicitatievraag bij Salesforce

Find the two largest numbers in an array

Antwoorden op sollicitatievragen

Anoniem

4 feb 2016

def largest_2(arr) largest = nil largest2 = nil arr.each do |num| if largest == nil || num > largest largest2 = largest largest = num elsif largest2 == nil || num > largest2 largest2 = num end end [largest, largest2] end

2

Anoniem

15 feb 2016

public class TopTwo { public static void main(String args[]) { int[] arr = {3,6,4,1,5,2,10,20,30,25,29}; int l1 = 0; int l2 = 0; l1 = l2 = arr[0]; for (int i : arr) { if (i > l1) { l2 = l1; l1 = i; } if (i > l2 && i < l1) { l2 = i; } } System.out.println("l1 = " + l1 + ", l2 = " + l2); } }

1

Anoniem

14 mrt 2016

int[] getLagestNumbers(int[] nums) { int first = Integer.MIN_VALUE; int second = Integer.MIN_VALUE; if (nums.length == 0 || nums.length first) { second = first; first = nums[i]; } else if (nums[i] > second) { second = nums[i]; } } return new int[] { first, second }; }

Anoniem

14 mrt 2016

int[] getLagestNumbers(int[] nums) { int first = Integer.MIN_VALUE; int second = Integer.MIN_VALUE; if (nums.length == 0 || nums.length first) { second = first; first = nums[i]; } else if (nums[i] > second) { second = nums[i]; } } return new int[] { first, second }; }

Anoniem

15 mrt 2016

function getTwoHighestElements(array){ var max = array[0], secondMax = -Infinity; for (var i = 1; i < array.length; i++) { if(max < array[i]){ secondMax = max; max = array[i] } else if(secondMax < array[i]) secondMax = array[i]; } return [max, secondMax]; } //TEST CASES getTwoHighestElements([1,2,10,3,11]); getTwoHighestElements([1,2,100,56,3]);