↳
Use recursion
↳
No well defined. Is the problem to find the shortest path to the right side or bottom or shortest path to the a particular location or to connect the most locations or what? Minder
↳
given rectangle set (overlapped or not), calculate the overlapped areas. e.g., rect{ point upperleft; width, height; } Minder
↳
Mean-Square error is an error metric for measuring image or video quality it is popular video and image quality metric because the analysis and mathematics is easier with this L2-Norm metric. Most video and image quality experts will agree that MSE is not a very good measure of perceptual video and image quality. Minder
↳
The mathematical reasoning behind the MSE is as follows: For any real applications, noise in the readings or the labels is inevitable. We generally assume this noise follows Gaussian distribution and this holds perfectly well for most of the real applications. Considering 'e' follows gaussian distribution in y=f(x) + e and calculating the MLE, we get MSE which is also L2 distance. Note: Assuming some other noise distribution may lead to other MLE estimate which will not be MSE. Minder
↳
MSE is used for understanding the weight of the errors in any model. This helps us understand model accuracy in a way that is helpful when choosing different types of models. Check out more answers on InterviewQuery.com Minder
↳
Smoothing an image can be done by convolving with a kernel: 1- a matrix of ones- simple averaging. 2- convolving with a gaussian matrix which simply means the center pixel has more weight in averaging. Salt an pepper noise: with max - min or median filters. Minder
↳
What is meant by virtual memory? virtual memory is a memory management technique that provides an "idealized abstraction of the storage resources that are actually available on a given machine" which "creates the illusion to users of a very large (main) memory". Time complexity of insertion in Linked List vs. Array? Linked list: O(1) Array: O(n) Memory storage - heap vs stack? Stack: linear data structure, high-speed access, no fragmentation, local variables only, variables can't be resized. Heap: hierarchical data structure, slow access time(compared to stack), memory can become fragmented, global variables, variables can be resized. Minder
↳
Can you use the OpenCV library?
↳
Since I had previous experience in object detection I discussed some of the techniques such as YOLO, RCNN, Fast RCNN, and Faster RCNN and how do they differ from each other. Minder
↳
I would always start with the simplest and fairly obvious answer; I would put the message to least significant bit layer of the image. The receiving end would only read the least significant bit layer of the image accordingly to decode the message. The least significant bit is invisible to the human eye. Test yourself by painting a rectangle with two reds next to each other of values (255,0,0) and (254,0,0). See if you can tell the difference. Minder
↳
sort strings - Check length - Compare strings - nlogn solution Efficient solution Keep a counter of each character for string 1 and a counter of each character string 2 If string lengths are different - false and if count 1 and count 2 of the character is same - they are anagrams. - Computation O(n) time. Minder
↳
I presented the google colab link
↳
assuming we want to find the median of integers x,y,z and assume every box have the min exit and the max exit. we need to use 3 boxes: b1,b2,b3. the median= b3( b2( z , b1(x,y)->max )->min , b1(x,y)->min )->max if you draw it, it will make sense. Minder