| 209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)|[](src/MinimumSizeSubarraySum.java)||

| 210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii)|[](src/CourseScheduleII.java)||

| 211|[Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure)|[](src/DesignAddAndSearchWordsDataStructure.java)||

| 213|[House Robber II](https://leetcode.com/problems/house-robber-ii)|||

| 213|[House Robber II](https://leetcode.com/problems/house-robber-ii)|[](src/HouseRobberII.java)||

| 215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array)|[](src/KthLargestElementInAnArray.java)||

| 216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii)|||

| 217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate)|[](src/ContainsDuplicate.java)[](python/contains_duplicate.py)||

publicclassHouseRobberII {

publicintrob(int[]array) {

if (array.length ==1)returnarray[0];

if (array.length ==2)returnMath.max(array[0],array[1]);

returnMath.max(

rob(array,0,array.length -2),

rob(array,1,array.length -1)

);

}

publicintrob(int[]array,intstart,intend) {

inta =array[start],b =Math.max(array[start],array[start +1]),c =Math.max(a,b);

for (inti =start +2 ;i <=end ;i++) {

c =Math.max(array[i] +a,b);

a =b;

b =c;

}

returnc;

}

}