Pick an exercise and write the solution in Python, JavaScript, C++, Java or Go. The lab executes your code step by step, animates the data structure as it changes, explains any mistake in plain language, and measures the complexity you actually achieved.
Return the index of target in the sorted array nums, or -1 if it is not present.
Return the indices of the two numbers in nums that add up to target. Exactly one answer exists.
Return the maximum profit from one buy and one later sell. Return 0 if no profit is possible.
Return the largest area formed between two lines in height. Area is width times the shorter line.
Return true when t is a rearrangement of s, using each character the same number of times.
Sort nums ascending in place and return it. The animation shows every comparison and every swap.