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).
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalized job recommendations and updates by starting your searches.