Software Engineer

Tip 1: Read the questions carefully.
Tip 2: Study the Linux commands.

Tip 1: Read the questions carefully.
Tip 2: Study the Software Development Life Cycle.

Tip 1: Study the operating system in detail.
Tip 2: Read and understand the question.

Used the modified breadth-first search algorithm as follows:

Step 1: Create a queue to perform the BFS traversal of the tree.

Step 2: Create a flag variable, initially set to false, to keep track of the traversal direction (left to right or right to left).

Step 3: Create an empty list of lists called result to store the zigzag level order traversal.

Step 4: Add the root node to the queue. Start the BFS traversal loop while the queue is not empty.

Step 5: Create a level list to store the values of nodes at the current level.

Step 6: Get the size of the queue (levelSize) before traversing the current level.

Step 7: Iterate levelSize number of times: Remove the first node from the queue.

Step 8: If the flag variable is false, append the node's value to the level list (left to right order). Otherwise, insert the node's value at the beginning of the level list (right to left order).

Step 9: Add the node's left and right children to the queue if they exist.

Step 10: Append the level list to the result list. Toggle the flag variable to switch the traversal direction.

Step 11: Return the result list.

Followed the backtracking algorithm to solve this problem as follows:

Step 1: Create a dictionary to map each digit to its corresponding letters.

Step 2: Define a recursive backtracking function, generate_combinations, that takes the following parameters:

• digits: The remaining digits to process.
• current: The current combination of letters generated so far.
• result: The list to store the final combinations.

Step 3: In the generate_combinations function, if digits is empty, append current to result and return.

Step 4: Get the first digit from digits and retrieve the corresponding letters from the dictionary.

Step 5: For each letter in the list of letters, append the letter to current.

Step 6: Make a recursive call to generate_combinations with the remaining digits and the updated current.

Step 7: Remove the last letter from current to backtrack and try the next letter.

Step 8: Start the backtracking process by calling the generate_combinations function with.

I started the group discussion, which earned me bonus points. Then, I discussed that both are equally responsible for the spread of Corona, but I believe people are most responsible for its spread because if they had followed government protocols, it would not have spread as much.

Tip 1: Read the constructors in any programming language.
Tip 2: It's better to explain the answer with examples.

Tip 1: Read all the models available in Computer Networks.
Tip 2: Listen to the question carefully. Ask again if you don't understand.

Step 1: I solved it using the traversal method.

Step 2: The interviewer asked me if I could optimize it.

Step 3: Then, I solved it using the min-heaps method.

Tip 1: Have knowledge of classifying Linux commands.
Tip 2: Answer confidently.

Tip 1: Study Kubernetes briefly.
Tip 2: Answer confidently.

Tip 1: Have a brief knowledge of all databases.
Tip 2: Answer confidently.

Tip 1: Speak good English.
Tip 2: Answer confidently.

Tip 1: Don't answer questions about your further study plans, even if you have them.
Tip 2: Answer confidently.

Tip 1: Speak the truth, no matter if you have other offers as well.
Tip 2: Speak good English.

Tip 1: It's better to ask any questions at that time.
Tip 2: Read answers to HR questions on the internet.