Remove duplicates in a sorted array nums so each unique value appears only once, keeping their order. Return the number of unique values in nums.
With what pattern can we solve this problem in linear time and constant space ?
Given an array score, assign ranks to athletes such that the highest score gets 'Gold Medal', second highest 'Silver Medal', third 'Bronze Medal', and others receive numeric ranks. Return the rank.
With what pattern can we solve this problem in loglinear time and linear space ?
Convert a Unix-style absolute path into its simplest form by handling '.', '..', and multiple slashes. Return the canonical path.
With what pattern can we solve this problem in linear time and linear space ?