- Move zeroes (Easy) - good practice of partition step of quick sort, which effectively does the same
- Sort an array (Medium) - Task to verify correctness of your algorithm (TLE is fine for basic algorithm, unless there are no failed simple test cases)
- Kth Largest Element in an Array (Medium) - quickselect algorithm implementation
- Sort Colors (Medium) - Allegedly a problem to practice Hoare partition scheme (not verified)