|167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_167.java)| O(logn)|O(1)| Easy|

|166|[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_166.java) | O(1) |O(1) | Medium| HashMap

|165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_165.java)| O(n)|O(1)| Easy|

|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MaximumGap.java)| O(n)|O(n)| Hard|

|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_164.java)| O(n)|O(n)| Hard|

|163|[Missing Ranges](https://leetcode.com/problems/missing-ranges/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MissingRanges.java)| O(n)|O(1)||

|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_162.java)| O(1)|O(logn)/O(n)| Binary Search|

|161|[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/OneEditDistance.java)| O(n)|O(1)||

publicclassMaximumGap {

publicclass_164 {

publicintmaximumGap(int[]nums) {

if (nums.length <2)return0;

packagecom.fishercoder;

importcom.fishercoder.solutions.MaximumGap;

importcom.fishercoder.solutions._164;

importorg.junit.Before;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.Assert.assertEquals;

publicclassMaximumGapTest {

privatestaticMaximumGaptest;

publicclass_164Test {

privatestatic_164test;

privatestaticintexpected;

privatestaticintactual;

privatestaticint[]nums;

publicstaticvoidsetup(){

test =newMaximumGap();

test =new_164();

}