Tip 1 : practice minimum 25 medium level problems and 5 hard level problems in each topic (leetcode or any platform you prefer). I have given main focus to array, linkedlist, stacks, queue, sorting, dynamic programming, trees, graphs
Tip 2 : cover all the basics of ML and DL topics which could help to clear basic MCQ rounds
Tip 3 : Do at least 2 projects which could make your profile strong
Tip 1 : Highlight the project which you are confident to explain from end to end
Tip 2 : Try to avoid jargons and make the resume as simple as possible. Highlight your achievements. Make sure whatever you have mentioned is true and whatever you have mentioned in resume, you should be prepared to answer it
Timing: 8 PM - 9 PM
MCQ round covers the basics of machine learning concept and deep learning basics
About ReLU activation layer
Tip 1: Read all basics of DL(back propagation, activation layer, dropout rate,etc)
Tip 2: Practice MCQ online - in all these concepts - analytics vidhya sites would be helpful
Difference between Bagging and Boosting
Tip 1: Read all ML algorithms in depth
Timing: 5PM-6PM
Shared the docs - we need to edit the code in it - interviewer will post the question in that as well
Two coding questions - one on Linked List(easy) and other on trees(medium)



Assume that the Indexing for the linked list always starts from 0.
If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
The following images depict how the deletion has been performed.


Ask clarifying questions
Try to resolve the edge cases issues
Optimize till the interviewer was happy with the approach



The diameter of a binary tree is the length of the longest path between any two end nodes in a tree.
The number of edges between two nodes represents the length of the path between them.
Input: Consider the given binary tree:

Output: 6
Explanation:
Nodes in the diameter are highlighted. The length of the diameter, i.e., the path length, is 6.
Try to understand the problem and ask for possible edge cases if you have any, so that you could handle it
I used depth first search approach to solve it and interviewer was happy
Timing: 6.40PM- 8.00PM
Discussion about projects
How do you relate image classification and binary classification?
Tip 1: Read about classification problem statements and image classification in detail along with performance measures
How BERT understands the text data?
Tip 1: Read BERT architecture in detail along with LSTM, RNN, Transformers etc. There could be cross questions in each of the topics
Indepth project discussion
Tip 1: Have a complete end to end understanding of your project and have answer for each term you mention in your project

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?