Update again

Author: Zanger67

README.md

@@ -0,0 +1,34 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    private List<Integer> output;
+    private void helper(TreeNode curr) {
+        if (curr == null) 
+            return;
+        
+        output.add(curr.val);
+        helper(curr.left);
+        helper(curr.right);
+    }
+    public List<Integer> getAllElements(TreeNode root1, TreeNode root2) {
+        output = new ArrayList<>();
+        helper(root1);
+        helper(root2);
+        Collections.sort(output);
+        
+        return output;
+    }
+}

my-submissions/m1305 v1 O(nlogn) merge then sort.java

@@ -0,0 +1,60 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    private void helper(TreeNode curr, Stack<Integer> stk) {
+        if (curr == null) {
+            return;
+        }
+
+        if (curr.right != null) {
+            helper(curr.right, stk);
+        }
+
+        stk.add(curr.val);
+
+        if (curr.left != null) {
+            helper(curr.left, stk);
+        }
+    }
+    
+    public List<Integer> getAllElements(TreeNode root1, TreeNode root2) {
+        Stack<Integer> one = new Stack<>();
+        Stack<Integer> two = new Stack<>();
+
+        helper(root1, one);
+        helper(root2, two);
+
+        List<Integer> output = new LinkedList<>();
+
+        while (!one.isEmpty() && !two.isEmpty()) {
+            if (one.peek() < two.peek()) {
+                output.add(one.pop());
+            } else {
+                output.add(two.pop());
+            }
+        }
+
+        while (!one.isEmpty()) {
+            output.add(one.pop());
+        }
+
+        while (!two.isEmpty()) {
+            output.add(two.pop());
+        }
+        
+        return output;
+    }
+}

my-submissions/m1305 v2 O(m+n) linear time.java

@@ -0,0 +1,3 @@
+int countVowelStrings(int n) {
+    return (n + 4) * (n + 3) * (n + 2) * (n + 1) / 24;
+}

my-submissions/m1641.c

@@ -0,0 +1,6 @@
+class Solution {
+public:
+    int countVowelStrings(int n) {
+        return (n + 4) * (n + 3) * (n + 2) * (n + 1) / 24;
+    }
+};

my-submissions/m1641.cpp

@@ -0,0 +1,9 @@
+// This is just stars and bars lol
+// n stars, 4 bars
+// n + 4 choose 4
+
+class Solution {
+    public int countVowelStrings(int n) {
+        return (n + 4) * (n + 3) * (n + 2) * (n + 1) / 24;
+    }
+}

my-submissions/m1641.java

@@ -0,0 +1,32 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     struct ListNode *next;
+ * };
+ */
+
+
+struct ListNode* mergeInBetween(struct ListNode* list1, int a, int b, struct ListNode* list2){
+
+    struct ListNode* aMinusOne = list1;
+
+    for (int i = 0; i < a - 1; i++) {
+        aMinusOne = aMinusOne->next;
+    }
+
+    struct ListNode* bPlusOne = aMinusOne;
+
+    for (int i = a - 1; i <= b; i++) {
+        bPlusOne = bPlusOne->next;
+    }
+
+    aMinusOne->next = list2;
+
+    while (aMinusOne->next) {
+        aMinusOne = aMinusOne->next;
+    }
+
+    aMinusOne->next = bPlusOne;
+    return list1;
+}

my-submissions/m1669.c

@@ -0,0 +1,7 @@
+int maximumXOR(int* nums, int numsSize) {
+    int output = 0;
+    for (int i = 0; i < numsSize; i++) {
+        output |= nums[i];
+    }
+    return output;
+}

my-submissions/m2317.c

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int maximumXOR(vector<int>& nums) {
+        int output = 0;
+
+        for (int num : nums) {
+            output |= num;
+        }
+
+        return output;
+    }
+};

my-submissions/m2317.cpp

@@ -0,0 +1,10 @@
+class Solution {
+    public int maximumXOR(int[] nums) {
+        int output = 0;
+        for (int num : nums) {
+            output |= num;
+        }
+
+        return output;
+    }
+}