nandni

nandni25/dsa1

@@ -0,0 +1,33 @@
+import java.util.*;
+import java.io.*;
+
+class Node {
+    Node left;
+    Node right;
+    int data;
+
+    Node(int data) {
+        this.data = data;
+        left = null;
+        right = null;
+    }
+}
+
+class Solution {
+
+
+    public static void inOrder(Node root) {
+Deque<Node> stack = new ArrayDeque<Node>();
+    while(!stack.isEmpty() || root!=null){
+        if(root!=null){
+            stack.push(root);
+            root = root.left;
+        }else{
+            root = stack.pop();
+            System.out.print(root.data+" ");
+            root = root.right;
+        }
+    }
+    }
+
+	public static Node insert(Node root, int data) {

nandni25/dsa2

@@ -0,0 +1,51 @@
+import java.io.*;
+import java.math.*;
+import java.security.*;
+import java.text.*;
+import java.util.*;
+import java.util.concurrent.*;
+import java.util.regex.*;
+
+public class Solution {
+
+    // Complete the reverseArray function below.
+    static int[] reverseArray(int[] a) {
+
+
+    }
+
+    private static final Scanner scanner = new Scanner(System.in);
+
+    public static void main(String[] args) throws IOException {
+        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
+
+        int arrCount = scanner.nextInt();
+        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+        int[] arr = new int[arrCount];
+
+        String[] arrItems = scanner.nextLine().split(" ");
+        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+        for (int i = 0; i < arrCount; i++) {
+            int arrItem = Integer.parseInt(arrItems[i]);
+            arr[i] = arrItem;
+        }
+
+        int[] res = reverseArray(arr);
+
+        for (int i = 0; i < res.length; i++) {
+            bufferedWriter.write(String.valueOf(res[i]));
+
+            if (i != res.length - 1) {
+                bufferedWriter.write(" ");
+            }
+        }
+
+        bufferedWriter.newLine();
+
+        bufferedWriter.close();
+
+        scanner.close();
+    }
+}

nandni25/dsa3

@@ -0,0 +1,4 @@
+def print_list(head):
+    if head is not None:
+        print(head.data)
+        print_list(head.next)

nandni25/dsa4

@@ -0,0 +1,14 @@
+public class Solution {
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        int n = scan.nextInt();
+        int d = scan.nextInt();
+        int[] array = new int[n];
+        for(int i=0; i<n;i++) {
+            array[(i+n-d)%n] = scan.nextInt();
+        }
+        for(int i=0; i<n;i++) {
+            System.out.print(array[i] + " ");
+        }      
+    }
+}

nandni25/dsa5

@@ -0,0 +1,25 @@
+Node* InsertNth(Node *head, int data, int position)
+{
+    Node *newNode = (Node*)malloc(sizeof(Node));
+    newNode->data = data;
+
+    if (head == NULL) {
+        return newNode;
+    }
+
+    if (position == 0) {
+       newNode->next = head;
+       return newNode;
+    }
+
+    Node *currentNode = head;
+    while (position - 1 > 0) {
+        currentNode = currentNode->next;
+        position--;
+    }
+
+    newNode->next = currentNode->next;
+    currentNode->next = newNode;
+
+    return head;
+ }

nandni25/readme.n

@@ -0,0 +1,2 @@
+nandni asati 19bce10445
+btech cse core