(onsite interview roun 5): Edit distance There is a big file, it contain lots of words. given the first word and second word, check wether the words are in the path of edit distance e.g. File input: 'aaaa' 'aaab' 'abab' 'acdb' 'almn' 'abbb' Word1: 'aaaa' Word2: 'abbb' Output: True Explaination: Yes. There is an edit distance path from 'aaaa' to 'abbb' 'aaaa' -> 'aaab' -> 'abab' -> 'abbb'
Given a SQL database with an Integer field, retrieve the sum of said field for all records.
Do you have any questions for me?
Was asked to implement a K-means clustering algorithm, with the major skeleton of the code provided.
Job experience last job talked about me
Have you worked on GANs? Describe how they can be utilized to augment a dataset of documents?
Do you have Transportation, sir?
How much you want to make?
'''Question 1: Given a sorted but rotated array, and a target, find the location of the target in the array. If the target is not in the array, returns -1 1) INPUT: [3,6,7,1,2], target = 1 OUTPUT: 3 2) INPUT: [3,6,7,1,2], target = 9 OUTPUT: -1 '''
Do you have experience in machine work?
Viewing 1431 - 1440 interview questions