diff --git a/find-median-from-data-stream/sora0319.java b/find-median-from-data-stream/sora0319.java
new file mode 100644
index 000000000..6046626c9
--- /dev/null
+++ b/find-median-from-data-stream/sora0319.java
@@ -0,0 +1,27 @@
+public class MedianFinder {
+    private PriorityQueue<Integer> maxHeap;
+    private PriorityQueue<Integer> minHeap;
+
+    public MedianFinder() {
+        maxHeap = new PriorityQueue<>(Collections.reverseOrder());
+        minHeap = new PriorityQueue<>();
+    }
+
+    public void addNum(int num) {
+        maxHeap.offer(num);
+        minHeap.offer(maxHeap.poll());
+
+        if (minHeap.size() > maxHeap.size()) {
+            maxHeap.offer(minHeap.poll());
+        }
+    }
+
+    public double findMedian() {
+        if (maxHeap.size() > minHeap.size()) {
+            return maxHeap.peek();
+        } else {
+            return (maxHeap.peek() + minHeap.peek()) / 2.0;
+        }
+    }
+}
+
diff --git a/insert-interval/sora0319.java b/insert-interval/sora0319.java
new file mode 100644
index 000000000..77cf2411b
--- /dev/null
+++ b/insert-interval/sora0319.java
@@ -0,0 +1,32 @@
+public class Solution {
+    public int[][] insert(int[][] intervals, int[] newInterval) {
+        List<int[]> list = new ArrayList<>();
+
+        int order = 0;
+        while (order < intervals.length && intervals[order][0] < newInterval[0]) {
+            list.add(intervals[order]);
+            order++;
+        }
+        list.add(newInterval);
+        while (order < intervals.length) {
+            list.add(intervals[order]);
+            order++;
+        }
+
+        List<int[]> output = new ArrayList<>();
+        output.add(list.get(0));
+
+        for (int i = 1; i < list.size(); i++) {
+            int[] last = output.get(output.size() - 1);
+            int[] current = list.get(i);
+            if (last[1] < current[0]) {
+                output.add(current);
+            } else {
+                last[1] = Math.max(last[1], current[1]);
+            }
+        }
+
+        return output.toArray(new int[output.size()][]);
+    }
+}
+
diff --git a/kth-smallest-element-in-a-bst/sora0319.java b/kth-smallest-element-in-a-bst/sora0319.java
new file mode 100644
index 000000000..88c49db81
--- /dev/null
+++ b/kth-smallest-element-in-a-bst/sora0319.java
@@ -0,0 +1,21 @@
+public class Solution {
+    private int count = 0;
+    private int answer = -1;
+
+    public int kthSmallest(TreeNode root, int k) {
+        ordering(root, k);
+        return answer;
+    }
+
+    private void ordering(TreeNode node, int k) {
+        if (node == null) return;
+        ordering(node.left, k);
+        count++;
+        if (count == k) {
+            answer = node.val;
+            return;
+        }
+        ordering(node.right, k);
+    }
+}
+
diff --git a/lowest-common-ancestor-of-a-binary-search-tree/sora0319.java b/lowest-common-ancestor-of-a-binary-search-tree/sora0319.java
new file mode 100644
index 000000000..e8c72b75a
--- /dev/null
+++ b/lowest-common-ancestor-of-a-binary-search-tree/sora0319.java
@@ -0,0 +1,16 @@
+public class Solution {
+    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+        TreeNode node = root;
+        while (node != null) {
+            if (p.val < node.val && q.val < node.val) {
+                node = node.left;
+            } else if (node.val < p.val && node.val < q.val) {
+                node = node.right;
+            } else {
+                return node;
+            }
+        }
+        return null;
+    }
+}
+
diff --git a/meeting-rooms/sora0319.java b/meeting-rooms/sora0319.java
new file mode 100644
index 000000000..822a453fd
--- /dev/null
+++ b/meeting-rooms/sora0319.java
@@ -0,0 +1,14 @@
+import java.util.*;
+
+public class Solution {
+    public boolean canAttendMeetings(int[][] intervals) {
+        Arrays.sort(intervals, (a, b) -> Integer.compare(a[0], b[0]));
+
+        for (int i = 0; i < intervals.length - 1; i++) {
+            if (intervals[i][1] > intervals[i + 1][0]) {
+                return false;
+            }
+        }
+        return true;
+    }
+}