Added 1 solution & modified 1 solution

Author: varunu28

Easy/Middle of the linked list.java

@@ -7,25 +7,13 @@
  * }
  */
 class Solution {
-    public ListNode middleNode(ListNode head) {
-        int l = getLengthOfLinkedList(head);
-        int mid = l/2;
-        
-        while (mid > 0) {
-            head = head.next;
-            mid--;
-        }
-        
-        return head;
-    }
-    
-    private int getLengthOfLinkedList(ListNode head) {
-        int c = 0;
-        while(head != null) {
-            head = head.next;
-            c++;
-        }
-        
-        return c;
+  public ListNode middleNode(ListNode head) {
+    ListNode slow = head;
+    ListNode fast = head;
+    while (fast != null && fast.next != null) {
+      slow = slow.next;
+      fast = fast.next.next;
     }
+    return slow;
+  }
 }

Easy/Minimum Subsequence in Non-Increasing Order.java

@@ -0,0 +1,23 @@
+class Solution {
+  public List<Integer> minSubsequence(int[] nums) {
+    PriorityQueue<Integer> pq = new PriorityQueue<>(new Comparator<Integer>(){
+      public int compare(Integer o1, Integer o2) {
+        return o2 - o1;
+      }
+    });
+    int totalSum = 0;
+    for (int num : nums) {
+      pq.add(num);
+      totalSum += num;
+    }
+    List<Integer> list = new ArrayList<>();
+    int currSum = 0;
+    while (currSum <= totalSum) {
+      int num = pq.poll();
+      currSum += num;
+      totalSum -= num;
+      list.add(num);
+    }
+    return list;
+  }
+}