From e4143ac4153677b2de5c82423941fed6b9f720b3 Mon Sep 17 00:00:00 2001 From: Muhammad Ashfaq Date: Mon, 7 Sep 2020 20:33:51 +0800 Subject: [PATCH 1/2] Update README.md --- README.md | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/README.md b/README.md index 71dea9b5..8d80912c 100644 --- a/README.md +++ b/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/ From d75a9e4a5c946ddfec90df6cf56bfccb3b0ed7f1 Mon Sep 17 00:00:00 2001 From: Muhammad Ashfaq Date: Sat, 12 Sep 2020 10:30:46 +0800 Subject: [PATCH 2/2] Update Find the Missing Element - SOLUTION.ipynb All the elements of second array are already in first array. So, checking for the elements of second array in first array will result in nothing. --- .../Find the Missing Element - SOLUTION.ipynb | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Array Sequences/Array Sequences Interview Questions/Array Sequence Interview Questions - SOLUTIONS/Find the Missing Element - SOLUTION.ipynb b/Array Sequences/Array Sequences Interview Questions/Array Sequence Interview Questions - SOLUTIONS/Find the Missing Element - SOLUTION.ipynb index 0b216746..b11b70db 100644 --- a/Array Sequences/Array Sequences Interview Questions/Array Sequence Interview Questions - SOLUTIONS/Find the Missing Element - SOLUTION.ipynb +++ b/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",