Several machine learning concepts in the first interview such as Why decision tree is not better than a random forest, explain hypothesis testing, situation specific designs. In the second interview asked to find sub-strings from a string which are valid dictionary words.
I was asked about data structures and algorithms. I was also asked to implement hash function.
Find the longest palindrome in a string
1.Cycle in a liked list 2.Largest consecutive sub string
The coding questions were some which are available in Geeksforgeeks from the DS and algorithms part.
My project.
Given two sorted lists write and algorithm to combine them into a new sorted list.
Difference between Hashmap and LinkedHashMap
Given n strings, how will form a big string with them with all the characters in alphabetical order?
Maximum square of 1's in a matrix of 1's and 0's
Viewing 1521 - 1530 interview questions