SDE - Intern

1. Start from the root node.
2. Recursively check the left and right subtrees.
3. If the current node is either p or q, return that node.
4. If both left and right subtrees return non-null values, the current node is the LCA.
5. If only one subtree returns a non-null value, propagate that value upwards.
6. Return the node where both subtrees return a result or the valid subtree node.

1. Sort the intervals based on their start times.
2. Use a min-heap (priority queue) to track the end times of the meetings.
3. Iterate over the sorted intervals:
1. If the current meeting starts after the earliest meeting ends, reuse the same room (remove the earliest end time from the heap).
2. Otherwise, allocate a new room (add the current meeting's end time to the heap).
4. The size of the heap at the end represents the minimum number of conference rooms required.

1. Convert each integer in the array to a string for easier comparison.
2. Sort the string array based on a custom comparator. The comparator should compare concatenated results: for two strings a and b, check which is larger between a+b and b+a.
3. If the largest number after sorting is 0, return "0" as the result.
4. Concatenate the sorted strings to form the largest possible number and return it.

Tip 1: Don't assume any schema column and confirm with the interviewer what the column names
Tip 2: Understand what the interviewer is asking, whether it's id of an employee having the second-highest salary or the salary value
Tip 3: Don't use limit and offset to get the second highest salary rather use nested query to get max and then find max salary less than max

1. Handle base cases for arrays of length 1 and 2.
2. Use dynamic programming to compute the maximum amount:
1. Initialize dp[0] and dp[1].
2. Iterate through the array, updating dp[i] with the maximum of not robbing or robbing the current house plus dp[i-2].
3. Return dp[N-1].

Tip 1: The best way to prepare for the above questions is to understand how the CPU works and handles multiple tasks at the same time.

Tip 2: While answering these types of questions, the interviewer expects you to use real-life use cases and examples.

Tip 3: Don't overuse or misuse terms. For example, multitasking and multithreading are two different concepts; don't use them interchangeably.

Tip 1: Cover Indexing in depth, then only you would be able to answer all the questions.
Tip 2: Try to learn the implementation of Indexing as well
Tip 3: While answering this question, mention both advantages and disadvantages(in case of overuse of indexing)

Tip 1: You should be fully prepared for questions coming out of your resume.
Tip 2: Use the STAR pattern to answer these questions.
Tip 3: Explain both Business Use case and technical aspects of your project

Tip 1: Don't claim to have worked with technologies you haven't used.

Tip 2: Try to include frameworks and version control tools as well.

Tip 3: It will make a good impression on the interviewer if you can explain in which project or internship you used those technologies.

1. Initialize variables to track potential majority candidates and their counts.
2. Iterate through the array to find potential majority candidates and update their counts.
3. Reiterate through the array to count occurrences of each candidate and compare with the threshold.
4. Return the element that meets the majority criteria.