Loading...
Engaged employer
What does this code do? How would you make it more efficient? Question was finding max distance between same values in a list. Inefficient code was O(n^2).
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalised job recommendations and updates by starting your searches.
Get actionable career advice tailored to you by joining more bowls.
Check out your Company Bowl for anonymous work chats.