Tip 1 : Prepare DSA for atleast 5-6 months on a regular basis before internship/placement opportunity.
Tip 2 : Having prior teaching experience is a plus point but not necessary.
Tip 3 : Improve your problem solving skills by solving same problem in different ways.
Tip 1: 2-3 Projects.
Tip 2: Any kind of achievements mentioned will be a part of discussion in interview (either Academic achievement or any contest rank or anything else).
Timing: Evening
Environment: Pretty chill environment
Focus: This interview round was majorly focused on resume discussion and Algorithms. The Interviewer asked me two DSA based problems and expected me to write the code and discuss the space and time complexity.
1. There will be no leading zeros in any string in the list ‘BINARYNUMS’.
Consider N = 5 and the list ‘binaryNums’= [“0”, “01”, “010”, “100”, “101”]. This list consists of the binary representation of numbers [0, 1, 2, 4, 5]. Clearly, the missing number is 3 and its binary representation will be “11”. So you should return string “11”.
In the beginning, I explained the approach where I'll be taking each number from 1 to N and checking for its availability.
The Interviewer asked me to optimise the solution.
Then I gave solution with summation approach. Missing number: ((N * (N+1)) / 2) - (Sum of N-1 numbers).
If the input tree is as depicted in the picture:
The Left View of the tree will be: 2 35 2
Step 1: Define a function called leftView() that accepts the root of the Binary Tree as an argument.
Step 2: Initialize a list called result to store the left view of the Binary Tree.
Step 3: If the root is None, return an empty list.
Step 4: Define a function called dfs() that accepts the root of the Binary Tree, the current level, and the list result as arguments.
Step 5: Inside the dfs() function, check if the current level is greater than or equal to the length of the result list. If it is, then append the current node's value to the result list.
Step 6: After performing Step 5, Recursively call the dfs() function for the left child of the current node, passing the level as the current level plus 1.
Step 7: After performing Step 6, Recursively call the dfs() function for the right child of the current node, passing the level as the current level plus 1.
Step 8: Call the dfs() function with the root of the Binary Tree, the level as 0, and the result list as arguments.
Step 9: Return the result list.
Timing: Evening
Environment: Pretty chill environment
Focus: This interview round was majorly focused on resume discussion and behavioural questions.
Interviewer also I asked question regarding of my prior projects (that were mentioned in my resume). Then I was asked to describe my previous internship experiences.
Can you describe a project you worked on that required you to work outside your comfort zone?
Tip 1: Make sure to use examples of the projects that were mentioned in the resume.
Tip 2: Describe in detail what made your project to move outside your comfort zone.
Tip 3: Also tell how you overcome the problem and finally finished your project.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?