The best explanation of an algorithm so far out of the videos I have seen. First of all, she knows what she is talking about and clarifying each detail to make sense for us.
Is it a requirement to do the solution in a single function? What if we do 2 functions: 1. function that returns the product of everything in an array 2. another function that generates a list without i. i.e., (list = original_list[:i] + original_list[i+1:]):. We pass that list through the first function and get the product of every element and append the result to the final list
nice explanation although to avoid complexity better to go left to right first rather than reversing it. I find your solutions efficient with good examples.
Better would have been to first use a loop to find multiplication of whole list and store it in variable x Then apply second for loop on same list by dividing each variable with x and change its value Space will be O(1) in this case as proposed to O(N) in yours
I enjoyed your work so much. I've been trying to search for video that really teaches the ideas in this vid. 🧑⚕️Your video totally reminds me of the vids from this smart med student Dr Ethan. Ethan's demonstrations are actually knowledgable and he actually helped me a lot on my studies! He is an educational Doctor in Nottingham and he talks about medical school. Go watch his RU-vid out and give the health enthusiast a like over here! 👉 #DrEthanEducational
