Question: How can i solve this with O(n) time? Write a function LessT han100(A) where A is a sorted list of integers. The function should return
How can i solve this with O(n) time?
Write a function LessT han100(A) where A is a sorted list of integers. The function should return True if A has two elements such that their difference is less than 100 and F alse otherwise.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
