What's the thinking on faster implementations? I'd thought up https://play.rust-lang.org/?version=stable&mode=debug&edition=2024&gist=4f5915d9b227cda194ef040f67495e10 (and verified it on Leetcode too: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/submissions/1881557096), and then found that there's an even simpler solution on LeetCode: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/solutions/3602439/pythonjavacsimple-solutionsorting-withou-xa2w/, and even an optimization: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/solutions/720152/on-time-o1-space-by-coder206-0zhz/ Should we provide these? I feel like the [optimized solution without (conventional) sorting](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/solutions/720152/on-time-o1-space-by-coder206-0zhz/) is quite elegant and worth mentioning.
What's the thinking on faster implementations?
I'd thought up https://play.rust-lang.org/?version=stable&mode=debug&edition=2024&gist=4f5915d9b227cda194ef040f67495e10 (and verified it on Leetcode too: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/submissions/1881557096), and then found that there's an even simpler solution on LeetCode: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/solutions/3602439/pythonjavacsimple-solutionsorting-withou-xa2w/, and even an optimization: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/solutions/720152/on-time-o1-space-by-coder206-0zhz/
Should we provide these? I feel like the optimized solution without (conventional) sorting is quite elegant and worth mentioning.