We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Algorithms
- Search
- Pairs
- Discussions
Pairs
Pairs
Sort by
recency
|
1231 Discussions
|
Please Login in order to post a comment
Haskell. Didn't feel like a 50 point problem, but I'll take it /shrug
Java
Collections.sort(arr); int count=0; for(int i=0;ik){ break; } } } return count;