insertElementAtBottom

Author: bibhuti9

Practice Problems/linked list/allOperatio.js

@@ -0,0 +1,220 @@
+class Node {
+    // constructor
+    constructor(element) {
+        this.element = element;
+        this.next = null
+    }
+}
+// linkedlist class
+class LinkedList {
+    constructor() {
+        this.head = null;
+        this.size = 0;
+    }
+
+    // adds an element at the end
+    // of list
+    add(element) {
+        var node = new Node(element);
+        var current;
+
+        if (this.head == null)
+            this.head = node;
+        else {
+            current = this.head;
+            while (current.next) {
+                current = current.next;
+            }
+            current.next = node;
+        }
+        this.size++;
+    }
+
+    // insert element at the position index
+    // of the list
+    insertAt(element, index) {
+        if (index < 0 || index > this.size)
+            return console.log("Please enter a valid index.");
+        else {
+            // creates a new node
+            var node = new Node(element);
+            var curr, prev;
+
+            curr = this.head;
+
+            // add the element to the
+            // first index
+            if (index == 0) {
+                node.next = this.head;
+                this.head = node;
+            } else {
+                curr = this.head;
+                var it = 0;
+
+                // iterate over the list to find
+                // the position to insert
+                while (it < index) {
+                    it++;
+                    prev = curr;
+                    curr = curr.next;
+                }
+
+                // adding an element
+                node.next = curr;
+                prev.next = node;
+            }
+            this.size++;
+        }
+    }
+
+    // removes an element from the
+    // specified location
+    removeFrom(index) {
+        if (index < 0 || index >= this.size)
+            return console.log("Please Enter a valid index");
+        else {
+            var curr, prev, it = 0;
+            curr = this.head;
+            prev = curr;
+
+            // deleting first element
+            if (index === 0) {
+                this.head = curr.next;
+            } else {
+                // iterate over the list to the
+                // position to removce an element
+                while (it < index) {
+                    it++;
+                    prev = curr;
+                    curr = curr.next;
+                }
+
+                // remove the element
+                prev.next = curr.next;
+            }
+            this.size--;
+
+            // return the remove element
+            return curr.element;
+        }
+    }
+
+    // removes a given element from the
+    // list
+    removeElement(element) {
+        var current = this.head;
+        var prev = null;
+
+        // iterate over the list
+        while (current != null) {
+            // comparing element with current
+            // element if found then remove the
+            // and return true
+            if (current.element === element) {
+                if (prev == null) {
+                    this.head = current.next;
+                } else {
+                    prev.next = current.next;
+                }
+                this.size--;
+                return current.element;
+            }
+            prev = current;
+            current = current.next;
+        }
+        return -1;
+    }
+
+
+    // finds the index of element
+    indexOf(element) {
+        var count = 0;
+        var current = this.head;
+
+        // iterate over the list
+        while (current != null) {
+            // compare each element of the list
+            // with given element
+            if (current.element === element)
+                return count;
+            count++;
+            current = current.next;
+        }
+
+        // not found
+        return -1;
+    }
+
+    // checks the list for empty
+    isEmpty() {
+        return this.size == 0;
+    }
+
+    // gives the size of the list
+    size_of_list() {
+        console.log(this.size);
+    }
+
+
+    // prints the list items
+    printList() {
+        var curr = this.head;
+        var str = "";
+        while (curr) {
+            str += curr.element + " ";
+            curr = curr.next;
+        }
+        console.log(str);
+    }
+
+}
+
+// creating an object for the
+// Linkedlist class
+var ll = new LinkedList();
+
+// testing isEmpty on an empty list
+// returns true
+console.log(ll.isEmpty());
+
+// adding element to the list
+ll.add(10);
+
+// prints 10
+ll.printList();
+
+// returns 1
+console.log(ll.size_of_list());
+
+// adding more elements to the list
+ll.add(20);
+ll.add(30);
+ll.add(40);
+ll.add(50);
+
+// returns 10 20 30 40 50
+ll.printList();
+
+// prints 50 from the list
+console.log("is element removed ?" + ll.removeElement(50));
+
+// prints 10 20 30 40
+ll.printList();
+
+// returns 3
+console.log("Index of 40 " + ll.indexOf(40));
+
+// insert 60 at second position
+// ll contains 10 20 60 30 40
+ll.insertAt(60, 2);
+
+ll.printList();
+
+// returns false
+console.log("is List Empty ? " + ll.isEmpty());
+
+// remove 3rd element from the list
+console.log(ll.removeFrom(3));
+
+// prints 10 20 60 40
+ll.printList();

Practice Problems/linked list/linked_link_operation.js

@@ -0,0 +1,53 @@
+class Node {
+    constructor(element) {
+        this.value = element;
+        this.next = null;
+    }
+}
+
+class LinkedList {
+
+    constructor() {
+        this.head = null;
+        this.size = 0;
+    }
+
+    // add
+    add(element) {
+        var node = new Node(element);
+        if (this.head === null) {
+            this.head = node;
+        } else {
+            var current = this.head;
+            while (current.next != null) {
+                current = current.next;
+            }
+            current.next = node;
+        }
+        this.size++;
+    }
+
+    // removeElement
+    removeElement(element) {
+
+    }
+
+    indexOf(element) {
+        var count = 0;
+        var current = this.head;
+        while (current != null) {
+            if (current.value === element) {
+                return count;
+            }
+            count++;
+            current = current.next;
+        }
+        return -1;
+    }
+
+}
+
+var ll = new LinkedList();
+ll.add(10);
+ll.add(20);
+console.log(Array.isArray(ll));

Practice Problems/stack/allOperation.js

@@ -0,0 +1,22 @@
+class Stack {
+    constructor() {
+        this.item = [];
+    }
+    add(element) {
+        this.item.push(element);
+    }
+    remove() {
+        this.item.pop();
+    }
+    printStack() {
+        return this.item;
+    }
+}
+
+var stack = new Stack();
+stack.add(10);
+stack.add(30);
+stack.add(60);
+console.log(stack.printStack());
+stack.remove();
+console.log(stack.printStack());

Practice Problems/stack/insertElementAtBottom.js

@@ -0,0 +1,16 @@
+function insertElementAtBotton(stack, count, size, desiredElement) {
+
+    if (count === size) {
+        stack.push(desiredElement);
+        return;
+    }
+    var num = stack[stack.length - 1];
+    stack.pop();
+    console.log(stack);
+    insertElementAtBotton(stack, count + 1, size, desiredElement);
+    stack.push(num);
+    console.log(stack);
+}
+
+var stack = [1, 2, 3, 4];
+insertElementAtBotton(stack, 0, stack.length, 9);

Practice Problems/stack/removeMiddleElement.js

@@ -0,0 +1,16 @@
+function removeMiddle(stack, count, size) {
+    if (count === Math.floor(stack.length / 2) + 1) {
+        stack.pop();
+        return;
+    }
+
+    var num = stack[stack.length - 1];
+    stack.pop();
+    removeMiddle(stack, count + 1, size);
+    stack.push(num);
+    if (stack.length + 1 == size) {
+        console.log(stack);
+    }
+}
+var stack = [1, 2, 3, 4];
+removeMiddle(stack, 0, stack.length);

Practice Problems/tralling_zero.js

@@ -0,0 +1,11 @@
+/* This question is not solved */
+
+
+function trailling_zero(arr) {
+    var start = 0;
+    for (let i = 1; i < arr.length; i++) {
+
+    }
+    console.log(arr);
+}
+trailling_zero([0, 1, 0, 0, 1, 1, 0, 1]);