| 319 |[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_319.java) | |Medium| Brainteaser

| 318|[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_318.java)||Medium|

| 317|[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_317.java)||Hard|

| 316 |[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_316.java) | |Medium| Stack, Recursion, Greedy

| 316 |[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_316.java) | |Hard| Stack, Recursion, Greedy

| 315 |[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_315.java) | |Hard| Tree

| 314 |[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_314.java) | |Medium| HashMap, BFS

| 313|[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_313.java)||Medium|

returnboats;

}

}

publicstaticclassSolution2 {

publicintnumRescueBoats(int[]people,intlimit) {

Arrays.sort(people);

intend =people.length -1;

intstart =0;

intboatcount =0;

while (end >=start) {

if (people[end] ==limit) {

end--;

boatcount++;

}elseif (people[end] +people[start] <=limit) {

start++;

end--;

boatcount++;

}else {

end--;

boatcount++;

}

}

returnboatcount;

}

}

}