1)- programmingl find the max no from the given set of elements in an array (without using max function)
2)- Find the minimum absolute difference between the set of elements of an array.

Question

1)- programmingl find the max no from the given set of elements in an array (without using max function)
2)- Find the minimum absolute difference between the set of elements of an array.

Anonymous · Accepted Answer

For 1 you need not sort it, sorting is O(NlogN), you can just traverse once keeping track of max number and replacing it when u find something larger than that. This would be O(N).

Prithiv · Answer

2nd wont work if there is a negative value. My solution

n = input()
val = 100**100
arr = map(int, raw_input().split())
arr.sort()
for i in range(n - 1):
    val = min(val, abs(arr[i] - arr[i+1]))
print val

Anonymous · Answer

l={1,4,5,7,6,4,3}

max=0

for i in l:
 if i > max:
  max=i
  
print(max)

Anonymous · Answer

1) sort in descending order and print the first element
2) sort in ascending order and report the difference between the first two

Meta

Meta Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches