Merge pull request #161 from waesabi/PascalTriangle

Pascal triangle

Author: seeditsolution

.idea/.gitignore

@@ -0,0 +1,41 @@
+package com.sanket.Array;
+
+import java.util.Scanner;
+
+/*
+    Problem Link - https://practice.geeksforgeeks.org/problems/find-missing-and-repeating/0
+    Status - Accepted
+ */
+public class FindMissingAndRepeating {
+
+    public static void main (String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        int t = scanner.nextInt();
+        while (t-- != 0) {
+            int n = scanner.nextInt();
+            int[] arr = new int[n];
+            for (int i = 0; i < n; i++) {
+                arr[i] = scanner.nextInt();
+            }
+            int duplicate = -1;
+            for (int i = 0; i < n; i++) {
+                int current = Math.abs(arr[i]) - 1;
+                if (arr[current] < 0) {
+                    duplicate = current + 1;
+                }
+                else {
+                    arr[current] = - arr[current];
+                }
+            }
+
+            int missing = -1;
+            for (int i = 0; i < n; i++) {
+                if (arr[i] > 0) {
+                    missing = i + 1;
+                    break;
+                }
+            }
+            System.out.println(duplicate + " " + missing);
+        }
+    }
+}

.idea/javaprogram.iml

@@ -0,0 +1,41 @@
+package com.sanket.Array;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/*
+    Problem Link - https://leetcode.com/problems/pascals-triangle/
+    Status - Accepted
+ */
+public class PascalTriangle {
+
+    public static void main(String[] args) {
+        int num = 3;
+        generate(num);
+    }
+
+    public static List<List<Integer>> generate(int numRows) {
+        List<List<Integer>> lists = new ArrayList<>();
+        if (numRows < 1) { return lists; }
+        List<Integer> first = new ArrayList<>();
+        first.add(1);
+        lists.add(first);
+        int i = 1;
+        while (i < numRows) {
+            List<Integer> integers = new ArrayList<>();
+            for (int j = 0; j <= i; j++) {
+                if (j == 0 || j == i) {
+                    integers.add(1);
+                }
+                else {
+                    List<Integer> prev = lists.get(i - 1);
+                    int total = prev.get(j - 1) + prev.get(j);
+                    integers.add(total);
+                }
+            }
+            lists.add(integers);
+            i++;
+        }
+        return lists;
+    }
+}

.idea/misc.xml

@@ -0,0 +1,33 @@
+package com.sanket.Array;
+/*
+    Problem Link - https://leetcode.com/problems/sort-colors/
+    Status - Accepted
+ */
+public class SortColors {
+
+    public void sortColors(int[] nums) {
+        int size = nums.length;
+        int low = 0, high = size - 1;
+        int i = low;
+        while (i <= high) {
+            if (nums[i] == 2) {
+                swap(nums, i, high);
+                high--;
+            }
+            else if (nums[i] == 0) {
+                swap(nums, i, low);
+                low++;
+                i++;
+            }
+            else {
+                i++;
+            }
+        }
+    }
+
+    public static void swap(int[] arr, int i, int j) {
+        int temp = arr[j];
+        arr[j] = arr[i];
+        arr[i] = temp;
+    }
+}