Merge branch 'main' into patch-1

SYLLABUS.md

@@ -16,7 +16,8 @@
     - [Introduction](https://youtu.be/4EP8YzcN0hQ)
     - [How it works](https://youtu.be/4EP8YzcN0hQ?t=93)
     - [Setup Installation](https://youtu.be/4EP8YzcN0hQ?t=1486)
-    - [Input and Output in Java](https://youtu.be/TAtrPoaJ7gc)
+- [First Java Program](https://youtu.be/TAtrPoaJ7gc)  
+    - [Input and Output in Java](https://youtu.be/TAtrPoaJ7gc?t=2086)
     - [Conditionals & Loops in Java](https://youtu.be/ldYLYRNaucM?t=88)
         - [if-else](https://youtu.be/ldYLYRNaucM?t=88)
         - [loops](https://youtu.be/ldYLYRNaucM?t=440)
@@ -127,12 +128,12 @@
     - [Reversal of LinkedList](https://youtu.be/70tx7KcMROc)
     - [Linked List + Recursion](https://youtu.be/70tx7KcMROc)
 - Stacks & Queues
-    - Introduction
-    - Interview problems
-    - Push efficient
-    - Pop efficient
+    - [Introduction](https://youtu.be/rHQI4mrJ3cg)
+    - [Push efficient](https://youtu.be/rHQI4mrJ3cg)
+    - [Pop efficient](https://youtu.be/rHQI4mrJ3cg)
+    - [Circular Queue](https://youtu.be/rHQI4mrJ3cg)
     - Queue using Stack and Vice versa
-    - Circular Queue
+    - Interview problems
 - Trees
     - Introduction
     - Binary Trees

assignments/15-linkedlist.md

@@ -10,9 +10,12 @@
 - [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) `leetcode`
 - [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) `leetcode` `Samsung`
 - [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)`leetcode`
+- [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) `leetcode`
+- [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) `leetcode`
 
 ## Medium
 - [Design Twitter](https://leetcode.com/problems/design-twitter/) `leetcode`
+- [ Design Linked List](https://leetcode.com/problems/design-linked-list/) `leetcode`
 - [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) `leetcode`
 - [Reorder List](https://leetcode.com/problems/reorder-list/) `leetcode`
 - [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) `leetcode` `HSBC`
@@ -29,6 +32,19 @@
 - [Partition list](https://leetcode.com/problems/partition-list/) `leetcode`
 - [Find first node of loop in a linked list](https://www.geeksforgeeks.org/find-first-node-of-loop-in-a-linked-list/) `GFG`
 - [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)`leetcode`
+- [Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/) `leetcode`
+- [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)`leetcode`
+- [ Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/)`leetcode` 
+- [ Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/)`leetcode`
+- [Sort List](https://leetcode.com/problems/sort-list/)`leetcode`
+- [ Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)`leetcode`
+- [Design Browser History](https://leetcode.com/problems/design-browser-history/)`leetcode`
+- [Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)`leetcode`
+- [Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)`leetcode`
+- [ Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)`leetcode`
+- [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/)`leetcode`
+- [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/)`leetcode`
+- [ Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/)`leetcode`
 
 ## Hard
 - [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) `leetcode`

lectures/19-stacks-n-queues/code/code.iml

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

lectures/19-stacks-n-queues/code/src/com/kunal/CircularQueue.java

@@ -0,0 +1,69 @@
+package com.kunal;
+
+public class CircularQueue {
+    protected int[] data;
+    private static final int DEFAULT_SIZE = 10;
+
+    protected int end = 0;
+    protected int front = 0;
+    private int size = 0;
+
+    public CircularQueue(){
+        this(DEFAULT_SIZE);
+    }
+
+    public CircularQueue(int size) {
+        this.data = new int[size];
+    }
+
+    public boolean isFull() {
+        return size == data.length; // ptr is at last index
+    }
+
+    public boolean isEmpty() {
+        return size == 0;
+    }
+
+    public boolean insert(int item) {
+        if (isFull()) {
+            return false;
+        }
+        data[end++] = item;
+        end = end % data.length;
+        size++;
+        return true;
+    }
+
+    public int remove() throws Exception {
+        if (isEmpty()) {
+            throw new Exception("Queue is empty");
+        }
+
+        int removed = data[front++];
+        front = front % data.length;
+        size--;
+        return removed;
+    }
+
+    public int front() throws Exception{
+        if (isEmpty()) {
+            throw new Exception("Queue is empty");
+        }
+        return data[front];
+    }
+
+    public void display() {
+        if (isEmpty()) {
+            System.out.println("Empty");
+            return;
+        }
+        int i = front;
+        do {
+            System.out.print(data[i] + " -> ");
+            i++;
+            i %= data.length;
+        } while (i != end);
+        System.out.println("END");
+    }
+
+}

lectures/19-stacks-n-queues/code/src/com/kunal/CustomQueue.java

@@ -0,0 +1,63 @@
+package com.kunal;
+
+public class CustomQueue {
+    private int[] data;
+
+    private static final int DEFAULT_SIZE = 10;
+
+    int end = 0;
+
+    public CustomQueue(){
+        this(DEFAULT_SIZE);
+    }
+
+    public CustomQueue(int size) {
+        this.data = new int[size];
+    }
+
+    public boolean isFull() {
+        return end == data.length; // ptr is at last index
+    }
+
+    public boolean isEmpty() {
+        return end == 0;
+    }
+
+    public boolean insert(int item) {
+        if (isFull()) {
+            return false;
+        }
+        data[end++] = item;
+        return true;
+    }
+
+    public int remove() throws Exception {
+        if (isEmpty()) {
+            throw new Exception("Queue is empty");
+        }
+
+        int removed = data[0];
+
+        // shift the elements to left
+        for (int i = 1; i < end; i++) {
+            data[i-1] = data[i];
+        }
+        end--;
+        return removed;
+    }
+
+    public int front() throws Exception{
+        if (isEmpty()) {
+            throw new Exception("Queue is empty");
+        }
+        return data[0];
+    }
+
+    public void display() {
+        for (int i = 0; i < end; i++) {
+            System.out.print(data[i] + " <- ");
+        }
+        System.out.println("END");
+    }
+
+}