Using Java to design and implement the class PascalTriangle that will generate a Pascal Triangle from a given number of rows. Represent each row in a triangle as a list and the entire triangle as a list of these lists. Please implement the class ArrayList for these lists.  Please do not use the binomial coeffiient formula { C(n,k)= n! / (k!*(n-k)!) to create the triangle. The triangle has to be generate using in this way: each row of the triangle begins and ends with 1, value at (x,y) equals to sum of value at (x-1, y-1) & (x-1,y), whereas x is the row number and y is the columm.

Question in java Arraylist Please help fast

Please use the template provided below and make sure the output matches exactly.   import java.util.Scanner;import java.util.ArrayList; public class PhotoLineups {    // TODO: Write method to create and output all permutations of the list of names.   public static void printAllPermutations(ArrayList<String> permList, ArrayList<String> nameList) {      }    public static void main(String[] args) {      Scanner scnr = new Scanner(System.in);      ArrayList<String> nameList = new ArrayList<String>();      ArrayList<String> permList = new ArrayList<String>();      String name;            // TODO: Read in a list of names; stop when -1 is read. Then call recursive method.   }}

This codes not complie it can you fix the code can complie it?   import java.util.ArrayList; public class Heap { void heapify(ArrayList hT, int i) { int size = hT.size(); int largest = i; int l = 2 * i + 1; int r = 2 * i + 2; if (l &lt; size &amp;&amp; hT.get(l) &gt; hT.get(largest)) largest = l; if (r &lt; size &amp;&amp; hT.get(r) &gt; hT.get(largest)) largest = r; if (largest != i) { int temp = hT.get(largest); hT.set(largest, hT.get(i)); hT.set(i, temp); heapify(hT, largest); } } void insert(ArrayList hT, int newNum) {     int size = hT.size();     if (size == 0) {     hT.add(newNum);     } else {     hT.add(newNum);     for (int i = size / 2 - 1; i &gt;= 0; i--) {     heapify(hT, i);     }     }     }     void deleteNode(ArrayList hT, int num) {         int size = hT.size();         int i;         for (i = 0; i &lt; size; i++) {         if (num == hT.get(i))         break;         }                 int temp = hT.get(i);         hT.set(i,…

Java

java In this assignment you will swap a position in an array list with another. swap() gets 3 arguments, an Arraylist, a position, and another position to swap with. Example   swap(["one","two","three"],0,2)   returns:["three","two","one"]   public static ArrayList<String> swap(ArrayList<String> list,int pos1,int pos2)    public static void main(String[] args) {    Scanner in = new Scanner(System.in);    int size = in.nextInt();    int pos1 = in.nextInt();    int pos2 = in.nextInt();    ArrayList<String> list = new ArrayList<>();    for(int i=0; i < size; i++) {      list.add(in.next());    }     System.out.println(swap(list, pos1, pos2));   }  }

Please help with the following in JAVA: Question 1 Could you minimize the total number of operations done for the previous problem? Previous Question > Given an integer list nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array. Code public static void main(String[] args) {ArrayList<Integer> mylist = new ArrayList<Integer>();Scanner sc = new Scanner(System.in);System.out.println("Enter the list with last a add : ");while (sc.hasNextInt()) {//TAKING INPUT UNTILL THE USER ENTERS ANY CHARACTER OTHER THAN INTint i = sc.nextInt();mylist.add(i);}int count=0;for(int i=0;i<mylist.size();i++){if(mylist.get(i)==0){count++; //COUNTING NUMBER OF ZEROES}}while(count!=0){for(int i=0;i<mylist.size()-1;i++){if(mylist.get(i)==0){Collections.swap(mylist, i, i+1);}}count--;}for(int i=0;i<mylist.size();i++){System.out.print(mylist.get(i)+ " "); //PRINTING THE…

You are given a non-negative number in the form of list elements.    For example, the number 123 would be provided as [1, 2, 3]. Add one    to the number and return the output in the form of a new list.   import java.util.ArrayList;public class AddOneToArrayList{public static ArrayList<Integer> solution(ArrayList<Integer> list){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}

Java

Exercise 2: Consider the following class: public class Sequence { private ArrayList values; public Sequence() { values = new ArrayList(); } public void add(int n) { values.add(n); } public String toString() { return values.toString(); } } Add a method public Sequence merge(Sequence other) that merges two sequences, alternating ele- ments from both sequences. If one sequence is shorter than the other, then alternate as long as you can and then append the remaining elements from the longer sequence. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then a.merge(b) returns the sequence 1 9 4 7 9 4 16 9 11 without modifying a or b.