|89|[Gray Code](https://leetcode.com/problems/gray-code/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_89.java)|O(n) |O(1)||Medium|Bit Manipulation

|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_88.java)|O(max(m,n))|O(1)||Easy|

|87|[Scramble String](https://leetcode.com/problems/scramble-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_87.java)|O(?) |O(?)||Hard| Recursion

|86|[Partition List](https://leetcode.com/problems/partition-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_86.java)|O(n)|O(1)||Medium|

|86|[Partition List](https://leetcode.com/problems/partition-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_86.java)|O(n) |O(1)||Medium| Linked List

|85|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_85.java)|O(m*n) |O(n)||Hard|DP

|84|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_84.java)|O(n) |O(n)||Hard|Array, Stack

|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_83.java)|O(n) |O(1)||Easy| Linked List

publicclass_86 {

publicstaticclassSolution1 {

publicListNodepartition(ListNodehead,intx) {

if (head ==null ||head.next ==null) {

returnhead;

if (head ==null ||head.next ==null) {

returnhead;

}

ListNodeleft =newListNode(0);

ListNoderight =newListNode(0);

ListNodeless =left;

ListNodegreater =right;

while (head !=null) {

if (head.val <x) {

less.next =head;

less =less.next;

}else {

greater.next =head;

greater =greater.next;

}

ListNodeleft =newListNode(0);

ListNoderight =newListNode(0);

ListNodeless =left;

ListNodegreater =right;

while (head !=null) {

if (head.val <x) {

less.next =head;

less =less.next;

}else {

greater.next =head;

greater =greater.next;

}

head =head.next;

}

greater.next =null;

less.next =right.next;

returnleft.next;

head =head.next;

}

greater.next =null;

less.next =right.next;

returnleft.next;

}

}