After Pre-placement talk,
Round 1
It was an online Assessment of 2 hrs on Hacker Earth consisting of 60 questions(55 Mcqs, 2 python programming and 3 SQL)
Mcqs were majorly out of Data structures, Machine Learning, Deep Learning, Statistics, Aptitude, Logical reasoning and verbal ability.
Round 2
It was the SpeechEx Assessment on the Mettl platform. Questions were of basic Grammar and we were mainly to test a candidate’s verbal abilities questions were like”What is success to you in life? Elaborate” etc.
Round 3
It was a 30-minute interview round and was mostly resume-based [for me].
A few questions that the interviewer asked me after the introduction were:
- ML algorithms like k-nearest neighbour, K means clustering, Linear Regression (Explanation and differences majorly)
- Dijkstra’s algorithm and the problem associated with it (doesn’t work for negative edge weights so we use the Bellman-Ford algorithm).
- Which of the Dijkstra and Bellman-Ford algorithms is more Greedy?
- Pseudo code for Dijkstras algorithm
- Working on Bubble/Selection and Quick Sort.
- Code for Merge Sorting.
- Write a function that returns 2 when we pass the value as 3 and returns 3 when we pass the value as 2 without using any conditional statements. (I made use of Array indexes: arr[2] = 3 and arr[3] = 2. However, returning 5 – value works too)
- Difference between WHERE and HAVING clause in SQL.
- What is the Coalesce statement in Sql?
- Given a number. Find the smallest number of the same length that can be formed using its digits.
- Any questions for me?