Unique, ascending in C#
C# interview exercise on Collections & LINQ, difficulty 1 of 3. Solve it in the editor beside a worked example, or cold in Interview mode with the example hidden; the tests run the moment you do.
Write UniqueSorted(nums) that returns the distinct values of nums in ascending order, as a new list. The caller's list must not change: List.Sort() sorts in place, LINQ does not.
Each exercise pairs a worked example with a twin problem to solve in a real editor; the tests run the moment you do. Interview mode hides the example: solve it from memory, without the hint or the solution, and it counts as solved cold. Progress is saved in your browser, and in your account if you sign in.