Oct 29, 2019 · Jul 12, 2020 · Jul 12, 2020 · Jul 12, 2020
diff --git a/src/main/java/com/ctci/linkedlists/RemoveDuplicates.java b/src/main/java/com/ctci/linkedlists/RemoveDuplicates.java
 */
 public class RemoveDuplicates {

    public static final String WITHOUT_DUPS = "Without dups: ";
    public static final String WITH_DUPS = "\nWith dups: ";

    /**
     * Removes duplicates in an unsorted linked list by using additional memory
     * and two references.
        System.out.print("With dups: ");
        l1.print();
        removeDuplicatesFromUnsortedList(l1);
        System.out.print("Without dups: ");
        System.out.print(WITHOUT_DUPS);
        l1.print();

        Node l2 = new Node(1);
        l2.next.next.next = new Node(3);
        l2.next.next.next.next = new Node(4);
        l2.next.next.next.next.next = new Node(5);
        System.out.print("\nWith dups: ");
        System.out.print(WITH_DUPS);
        l2.print();
        removeDuplicatesFromUnsortedList(l2);
        System.out.print("Without dups: ");
        System.out.print(WITHOUT_DUPS);
        l2.print();

        Node l3 = new Node(1);
        l3.next.next.next = new Node(3);
        l3.next.next.next.next = new Node(4);
        l3.next.next.next.next.next = new Node(5);
        System.out.print("\nWith dups: ");
        System.out.print(WITH_DUPS);
        l3.print();
        removeDuplicatesFromUnsortedList(l3);
        System.out.print("Without dups: ");
        System.out.print(WITHOUT_DUPS);
        l3.print();

        Node l4 = new Node(1);
        System.out.print("\nWith dups: ");
        System.out.print(WITH_DUPS);
        l4.print();
        removeDuplicatesFromUnsortedList(l4);
        System.out.print("Without dups: ");

        System.out.print(WITHOUT_DUPS);
        l4.print();

        Node l5 = null;
        System.out.print("\nWith dups: ");
        System.out.print(WITH_DUPS);
        l5.print();
        removeDuplicatesFromUnsortedList(l5);
        System.out.print("Without dups: ");
        System.out.print(WITHOUT_DUPS);
        l5.print();
    }
 }
diff --git a/src/main/java/com/ctci/stacksandqueues/StackOfPlates.java b/src/main/java/com/ctci/stacksandqueues/StackOfPlates.java
    }

    private static Stack<Integer> getLastStack() {
        if (stackList.size() == 0 || isFull(stackList.get(stackList.size() - 1))) {
        if (stackList.isEmpty() || isFull(stackList.get(stackList.size() - 1))) {
            stackList.add(new Stack<>());
        }
        return stackList.get(stackList.size() - 1);
Original file line number	Diff line number	Diff line change
Expand Up		@@ -9,6 +9,9 @@
		*/
		public class RemoveDuplicates {

		public static final String WITHOUT_DUPS = "Without dups: ";
Copy link Owner rampatraJul 12, 2020 Choose a reason for hiding this comment The reason will be displayed to describe this comment to others.Learn more. Can be`private`?
		public static final String WITH_DUPS = "\nWith dups: ";

		/**
		* Removes duplicates in an unsorted linked list by using additional memory
		* and two references.
Expand DownExpand Up		@@ -44,7 +47,7 @@ public static void main(String[] args) {
		System.out.print("With dups: ");
		l1.print();
		removeDuplicatesFromUnsortedList(l1);
		System.out.print("Without dups: ");
		System.out.print(WITHOUT_DUPS);
		l1.print();

		Node l2 = new Node(1);
Expand All		@@ -53,10 +56,10 @@ public static void main(String[] args) {
		l2.next.next.next = new Node(3);
		l2.next.next.next.next = new Node(4);
		l2.next.next.next.next.next = new Node(5);
		System.out.print("\nWith dups: ");
		System.out.print(WITH_DUPS);
Copy link Owner rampatraJul 12, 2020 Choose a reason for hiding this comment The reason will be displayed to describe this comment to others.Learn more. `\n` is omitted.
		l2.print();
		removeDuplicatesFromUnsortedList(l2);
		System.out.print("Without dups: ");
		System.out.print(WITHOUT_DUPS);
		l2.print();

		Node l3 = new Node(1);
Expand All		@@ -65,24 +68,25 @@ public static void main(String[] args) {
		l3.next.next.next = new Node(3);
		l3.next.next.next.next = new Node(4);
		l3.next.next.next.next.next = new Node(5);
		System.out.print("\nWith dups: ");
		System.out.print(WITH_DUPS);
		l3.print();
		removeDuplicatesFromUnsortedList(l3);
		System.out.print("Without dups: ");
		System.out.print(WITHOUT_DUPS);
		l3.print();

		Node l4 = new Node(1);
		System.out.print("\nWith dups: ");
		System.out.print(WITH_DUPS);
		l4.print();
		removeDuplicatesFromUnsortedList(l4);
		System.out.print("Without dups: ");

		System.out.print(WITHOUT_DUPS);
		l4.print();

		Node l5 = null;
		System.out.print("\nWith dups: ");
		System.out.print(WITH_DUPS);
		l5.print();
		removeDuplicatesFromUnsortedList(l5);
		System.out.print("Without dups: ");
		System.out.print(WITHOUT_DUPS);
		l5.print();
		}
		}
Original file line number	Diff line number	Diff line change
Expand Up		@@ -38,7 +38,7 @@ private static int pop() {
		}

		private static Stack<Integer> getLastStack() {
		if (stackList.size() == 0 \|\| isFull(stackList.get(stackList.size() - 1))) {
		if (stackList.isEmpty() \|\| isFull(stackList.get(stackList.size() - 1))) {
Copy link Owner rampatraJul 12, 2020 Choose a reason for hiding this comment The reason will be displayed to describe this comment to others.Learn more. 👍
		stackList.add(new Stack<>());
		}
		return stackList.get(stackList.size() - 1);
Expand Down