Tip 1: Keep practicing the questions on a daily basis. Once you get into the flow, you will be able to solve any question. Try to maintain a daily streak.
Tip 2: Prepare for the machine coding and system design rounds by reading at least one article a day.
Tip 1: Mention only those skills in which you are confident.
Tip 2: You should have at least one good project in which you have in-depth knowledge.
I had my round at midday. The interview was scheduled with Interview-Vector, which is a third-party platform used to conduct interviews. The interviewer was friendly and very helpful. I was asked 2 coding questions in 60 minutes, which I solved. Initially, he asked me to give a basic introduction of myself.




I have practiced this problem so many times that I solved it easily using the BFS approach.



The distance is calculated as |i1 – i2| + |j1 – j2|, where i1, j1 are the coordinates of the current cell and i2, j2 are the coordinates of the nearest cell having value 1.
You can only move in four directions which are : Up, Down, Left and Right.
If N = 3, M = 4
and mat[ ][ ] = { 0, 0, 0, 1,
0, 0, 1, 1,
0, 1, 1, 0 }
then the output matrix will be
3 2 1 0
2 1 0 0
1 0 0 1
I first tried thinking about which algorithm would be used to solve this question. After that, it was easier to solve.
I was first asked to introduce myself and my past experience. The interviewer was helpful and assisted me in reaching the final solution.



A subarray is a slice from a contiguous array (i.e., occupy consecutive positions) and inherently maintains the order of elements.
This was a hard problem, but with the help of the interviewer and by identifying the correct data structure to solve it, I was able to solve it.



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
Take an empty list first and then start comparing each linked list using the divide and conquer algorithm.



For a given string “BaaB”
3 possible palindrome partitioning of the given string are:
{“B”, “a”, “a”, “B”}
{“B”, “aa”, “B”}
{“BaaB”}
Every substring of all the above partitions of “BaaB” is a palindrome.
Kadane's algorithm helped me solve this problem.
Tip 1: Be clear with the basics and fundamentals of the BTech syllabus.
Tip 2: Calmness and confidence must be there.

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