**Question 1:**\nhttps://leetcode.com/problems/product-of-array-except-self/, but with no restriction on use of `division`.\n\n**Question 2:**\nGiven ```dividend``` and ```divisor```, return ```quotient``` and ```remainder```.  Using ```division``` or ```mod``` operator is not allowed. Do it in better than linear time.\n\n**Example:**\n```\nInput: dividend = 13, divisor = 4\nOutput: 3, 1\n```\n\nFollow up questions: recursive vs iterative solutions.\n\n(I couldn\'t find the same problem on LC. The closest one is: https://leetcode.com/problems/divide-two-integers/. But, since ```multiplication``` is allowed - the solution is different).

Question 1:\nhttps://leetcode.com/problems/product-of-array-except-self/, but with no restriction on use of division.\n\nQuestion 2:\nGiven dividend and divisor