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 ?
You are given a score array representing athletes' scores. Rank them such that the highest gets 'Gold Medal', second 'Silver Medal', third 'Bronze Medal', and the rest get their positions. 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 ?