Given a sorted array nums, remove duplicate elements in-place to retain only unique values. Return the total count 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 ?
Transform a Unix-style absolute path into its canonical form by resolving '.', '..', and combining slashes. Return the canonical path.
With what pattern can we solve this problem in linear time and linear space ?