| 706 |[Design HashMap](https://leetcode.com/problems/design-hashmap/) |[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_706.java) | | Easy | Design

| 705 |[Design HashSet](https://leetcode.com/problems/design-hashset/) |[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_705.java) | | Easy | Design

| 704 |[Binary Search](https://leetcode.com/problems/binary-search/) |[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_704.java) |[:tv:](https://youtu.be/eHVe_uyXeWg) | Easy | Binary Search

| 703|[Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)|[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_703.java)|| Easy|

| 703 |[Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) |[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_703.java) | | Easy | PriorityQueue, Design

| 701 |[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) |[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_701.java) | | Medium | DFS, recursion

| 700 |[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) |[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_700.java) | | Easy | recusion, dfs

| 699 |[Falling Squares](https://leetcode.com/problems/falling-squares/) |[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_699.java) || Hard | Segment Tree

packagecom.fishercoder.solutions.firstthousand;

importjava.util.ArrayList;

importjava.util.Collections;

importjava.util.List;

importjava.util.PriorityQueue;

publicclass_703 {

publicstaticclassSolution1 {

publicstaticclassKthLargest {

PriorityQueue<Integer>heap;

PriorityQueue<Integer>minHeap;

intmaxK;

publicKthLargest(intk,int[]nums) {

heap =newPriorityQueue<>(Collections.reverseOrder());

minHeap =newPriorityQueue<>();

for (intnum :nums) {

heap.offer(num);

minHeap.offer(num);

if (minHeap.size() >k) {

minHeap.poll();

}

}

maxK =k;

}

publicintadd(intval) {

List<Integer>tmp =newArrayList<>();

intresult =0;

inttmpK =maxK;

heap.offer(val);

while (tmpK-- >0) {

result =heap.poll();

tmp.add(result);

if (minHeap.size() <maxK ||minHeap.peek() <val) {

minHeap.offer(val);

if (minHeap.size() >maxK) {

minHeap.poll();

}

}

for (intnum :tmp) {

heap.offer(num);

}

returnresult;

returnminHeap.peek();

}

}

}

importstaticorg.junit.jupiter.api.Assertions.assertEquals;

publicclass_703Test {

private_703.Solution1.KthLargestsolution1;

privatestaticint[]A;

private_703.Solution1.KthLargestsolution1;

privatestaticint[]A;

publicvoidtest1() {

solution1 =new_703.Solution1.KthLargest(3,newint[]{4,5,8,2});

assertEquals(4,solution1.add(3));

assertEquals(5,solution1.add(5));

assertEquals(5,solution1.add(10));

assertEquals(8,solution1.add(9));

assertEquals(8,solution1.add(4));

}

publicvoidtest1() {

solution1 =new_703.Solution1.KthLargest(3,newint[]{4,5,8,2});

assertEquals(4,solution1.add(3));

assertEquals(5,solution1.add(5));

assertEquals(5,solution1.add(10));

assertEquals(8,solution1.add(9));

assertEquals(8,solution1.add(4));

}

}