| 83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)|[](src/RemoveDuplicatesFromSortedList.java)[](python/remove_duplicates_from_linked_list.py)||

| 86|[Partition List](https://leetcode.com/problems/partition-list)|[](src/PartitionList.java)||

| 88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)|[](src/MergeSortedArray.java)[](python/merge_sorted_array.py)||

| 89|[Gray Code](https://leetcode.com/problems/gray-code)|[](src/GrayCode.java)||

| 94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)|[](src/BinaryTreeInorderTraversal.java)[](python/binary_tree_inorder_traversal.py)||

| 100|[Same Tree](https://leetcode.com/problems/same-tree)|[](src/SameTree.java)[](python/same_tree.py)||

| 101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree)|[](src/SymmetricTree.java)[](python/symmetric_tree.py)||

importjava.util.ArrayList;

importjava.util.List;

publicclassGrayCode {

publicList<Integer>grayCode(intn) {

finalList<Integer>result =newArrayList<>(1 <<n);

result.add(0);

for (inti =0,factor =1 ;i <n ;i++,factor *=2) {

for (intj =factor -1 ;j >=0 ;j--) {

result.add(result.get(j) +factor);

}

}

returnresult;

}

}