Given a sorted integer array nums, remove duplicates in-place so that each unique value appears only once. Return the number of unique values in nums.
With what pattern can we solve this problem in linear time and constant space ?
Given scores of athletes in an array score, assign 'Gold Medal' to the top score, 'Silver Medal' to the second, 'Bronze Medal' to the third, and numeric ranks to the rest. Return the rank.
With what pattern can we solve this problem in loglinear time and linear space ?
Given an absolute path for a Unix-style file system, simplify the absolute path to its canonical path by removing '.', '..', and extra slashes. Return the canonical path.
With what pattern can we solve this problem in linear time and linear space ?