introduce oneself to

Talk about the projects you are good at

Talk about it LSTM

TFIDF, LDA, Is there any manual reproduction

XGB LGB Its advantages and reasons

Text clustering ,KMeans, How to select the initial center point , How to determine K value .

Algorithm questions :

1 The median of two ordered sequences , Algorithm complexity O(log(m+n)) Not finished

2 Print spiral matrix

3 Strictly incrementing arrays A [1,3,4,5,6,8], After circulation B [5,6,8,1,3,4], given x , Output in B Subscript ,

4 given 100 100 million , Calculate the largest 100 The number of times each number appears

5 given 100 100 million articles , For a new article , Find the most similar articles .( The choice of words can be considered TFIDF)