Two pointer, Bit Manipulation, Stack, Tree and Binary Tree, Recursion

Author: omprashantjain

8 Linked List/PascalTriangle.java … Pascal's Triangle using Linkedlist.java8 Linked List/PascalTriangle.java renamed to 1 Leetcode Easy Problems/Leetcode 118 Pascal's Triangle using Linkedlist.java 8 Linked List/PascalTriangle.java renamed to 1 Leetcode Easy Problems/Leetcode 118 Pascal's Triangle using Linkedlist.java

@@ -0,0 +1,28 @@
+import java.util.ArrayList;
+import java.util.List;
+
+class Solution {
+  public List<List<Integer>> generate(int numRows) {
+      List<List<Integer>> result = new ArrayList<>();
+      List<Integer> firstRow = new ArrayList<>();
+      firstRow.add(1);
+      result.add(firstRow);
+
+      for (int i = 1; i < numRows; i++) {
+          List<Integer> newRow = new ArrayList<>();
+          newRow.add(1);
+
+          // generating from previous row
+          List<Integer> previousRow = result.get(i - 1);
+          for (int j = 1; j < i; j++) {
+              int num = previousRow.get(j - 1) + previousRow.get(j);
+              newRow.add(num);
+          }
+
+          newRow.add(1);
+          result.add(newRow);
+      }
+
+      return result;
+  }
+}

1 Leetcode Easy Problems/Leetcode 118 Pascal's Triangle.java

@@ -0,0 +1,22 @@
+class Solution {
+  public int majorityElement(int[] nums) {
+      int majority = 0;
+
+      for (int i = 0; i < 32; i++) {
+          int bit = 1 << i;
+
+          int count = 0;
+          for (int num: nums) {
+              if ((num & bit) != 0) {
+                  count++;
+              }
+          }
+
+          if (count > nums.length / 2) {
+              majority |= bit;
+          }
+      }
+
+      return majority;
+  }
+}

…blems/Leetcode 118 Pascals Triangle.java …18 Pascals Triangle using Recursion.java1 Leetcode Easy Problems/Leetcode 118 Pascals Triangle.java renamed to 1 Leetcode Easy Problems/Leetcode 118 Pascals Triangle using Recursion.java 1 Leetcode Easy Problems/Leetcode 118 Pascals Triangle.java renamed to 1 Leetcode Easy Problems/Leetcode 118 Pascals Triangle using Recursion.java

@@ -0,0 +1,32 @@
+/**
+ * Definition for singly-linked list.
+ */
+
+class ListNode {
+  int val;
+  ListNode next;
+  ListNode() {}
+  ListNode(int val) { this.val = val; }
+  ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+}
+
+class Solution {
+  public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
+    ListNode temp = new ListNode();
+    ListNode dummy = temp;
+
+    while (list1 != null && list2 != null) {
+      if (list1.val <= list2.val) {
+        temp.next = list1;
+        list1 = list1.next;
+      } else {
+        temp.next = list2;
+        list2 = list2.next;
+      }
+      temp = temp.next;
+    }
+
+    temp.next = list1 != null ? list1 : list2;
+    return dummy.next;
+  }
+}