Tip 1 : Know about DSA in depth, especially about Linked Lists, Hashmaps
Tip 2 : Know about your projects or previous Interns will be best for you.
Tip 1: Have Prev Interns mentioned
Tip 2: Tell about your projects in detail
It was a coding round with the Technical Manager and he asked about my Past Experiences and also 3 DSA Questions.



The given linked lists may or may not be null.
If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL
The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL
Simply the approach given in codestudio platform for that and explained 2 approaches and he told me to write all linked list code also and I also wrote that also, another question was of Hashmap and another was of Array
This round was with CTO and he asked about my Past Experiences and also about my projects.
At the end, he gave a DSA Problem and I solved within time.


You are given ‘N’ = 3, the matrix formed such that sum of rows, columns, and two diagonals are equal is
[[8, 3, 4],
[1, 5, 9]
[6, 7, 2]]

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?