Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
Simply put, your solution is not O(n). Your two for statement are equivalent to O(n(n - 1)/2). For the first loop of your first for statement, you check n-1 elements. For the second loop of your first for statement, you check n-2 elements. And so on...
For an algorithm to be O(n), your second for statement must be bounded by a constant, such as
for j in range(10000)
.yeah man... recursion!
This comment is hidden because it contains spoiler information about the solution