I was given 4 questions. The first 2 were easy peasy. The third one was an implementation-heavt problem involving traveling matrix elements in a certain way. The fourth question was not good and seemed very unfair, solved it but couldn't completely pass it as one of the test cases threw a time complexity error, which I did not have time to go back a rethink my strategy.
Implement fibonnacci series using recursion.
Implement Linked list from scratch and write code to identify whether the given two linked lists intersect or not.
5 DS questions spread over 2 phone rounds ML questions - Precision, Recall, Clustering algorithms Resume Assignment focused on finding document similarity
A medium-level leetcode question on array
what is your career goal?
what is your career goal?
Define Recall and Precision, describe diference between SGD and Adam
- How to manage overfitting - How to handle class imbalance - Name different optimizers (SGD, Adam) and mention some differences. - Explain Recall & Precision.
What is SVM? What if the dataset is not linearly separable?
Viewing 6351 - 6360 interview questions