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 ?
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 ?
Given an absolute path starting with '/', simplify it by removing '.', '..', and extra slashes. Return the canonical path.
With what pattern can we solve this problem in linear time and linear space ?