updates

Array Sequences/Array Sequences Interview Questions/Array Sequence Interview Questions - SOLUTIONS/Find the Missing Element - SOLUTION.ipynb

@@ -22,7 +22,7 @@
     "\n",
     "## Solution\n",
     "\n",
-    "The naive solution is go through every element in the second array and check whether it appears in the first array. Note that there may be duplicate elements in the arrays so we should pay special attention to it. The complexity of this approach is O(N^2), since we would need two for loops.\n",
+    "The naive solution is go through every element in the first array and check whether it appears in the second array. Note that there may be duplicate elements in the arrays so we should pay special attention to it. The complexity of this approach is O(N^2), since we would need two for loops.\n",
     "\n",
     "A more efficient solution is to sort the first array, so while checking whether an element in the first array appears in the second, we can do binary search (we'll learn about binary search in more detail in a future section). But we should still be careful about duplicate elements. The complexity is O(NlogN). \n",
     "\n",

README.md

@@ -3,7 +3,5 @@
 
 This is the ultimate course in preparing you for your technical interviews and landing the job of your dreams!
 
-Get the entire course, including full video content, solution walkthroughs, discussion forums, instructor support, 
-and much more for only $20 by using the [discount link](https://www.udemy.com/python-for-data-structures-algorithms-and-interviews/?couponCode=github_discount)!
-
+nbviewer link: https://nbviewer.jupyter.org/github/jmportilla/Python-for-Algorithms--Data-Structures--and-Interviews/tree/master/Algorithm%20Analysis%20and%20Big%20O/