You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.
There are n different online courses numbered from 1 to n...
There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.
There are some spherical balloons taped onto a flat wall that represents the XY-plane...
Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different task.