Undergraduate TA for CMSC132 (Advanced Java & Data Structures) @ the University of Maryland, College Park. Learn more about me: txwang.me
The question is as follows:
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
For example, given n = 3, a solution set is:
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
0, 1, 2, ..., n
Given nums = [0, 1, 3] return 2.
[0, 1, 3]