Unique, ascending in C#

C# interview exercise on Collections & LINQ, difficulty 1 of 3. Solve it in the editor beside a worked example; 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. Progress is saved in your browser, and in your account if you sign in.

More Collections & LINQ in C#

• Filter and transform with LINQ
• Chunk into groups
• Flatten deeply with pattern matching
• Rotate right by k
• Transpose a jagged array
• Merge overlapping intervals
• Max sum of k consecutive

All C# exercises · Other languages and frameworks