SWE Intern

Iterate over possible increments for x starting from 0.

For each x, compute a' = a + x.

Check the remainder r = b % a'.

If r == 0, then x + y = x (since y = 0) — this is optimal.

Otherwise, calculate y = a' - (b % a') to make b + y divisible by a'.

Keep track of the minimum value of x + y and the corresponding pair (x, y).

Return the pair with the smallest sum x + y.

Initialize a stack to keep track of elements for which we haven't found the next greater element yet.

Traverse the array from right to left (reverse order).

For each element:

While the stack is not empty and the top of the stack is less than or equal to the current element, pop from the stack.

If the stack is empty after popping, the next greater element is -1.

If not empty, the top of the stack is the next greater element.

Push the current element onto the stack.

Store the result in an output array, and reverse it if needed (based on how you store results).

Initialize distances:

Create a distance array dist[] of size n, initialized with infinity (INF) for all nodes, except the source node which is set to 0.

Use a priority queue (min-heap):

Push the source node into the heap with distance 0.

Process the queue:

While the priority queue is not empty:

Pop the node with the smallest distance.

For each neighbor of this node:

If dist[u] + weight < dist[v], update dist[v] and push (dist[v], v) into the heap.

Repeat until all reachable nodes are visited.

Return the dist[] array containing the shortest distances from the source.

Initialize an empty set.

Traverse the array:

If the element is already in the set, return it (first repetitive element).

If not, add it to the set.

If no element repeats, return -1.

Tip 1: Use DISTINCT: Select distinct salaries to eliminate duplicates.
Tip 2: Use LIMIT or ROW_NUMBER(): For SQL, use LIMIT with ORDER BY for a simple approach, or use ROW_NUMBER() to rank salaries and select the second highest.
Tip 3: Handle NULLs: Ensure that if no second distinct salary exists, return NULL.

Tip 1: Use the LIKE operator: WHERE name LIKE 'S%' to filter names starting with 'S'.
Tip 2: Ensure case insensitivity: use UPPER(name) or LOWER(name) to handle different cases.
Tip 3: Optimize the query: If there's a large dataset, ensure proper indexing on the name column for faster querying.

About Background: Be concise and respectful: Briefly mention parents' occupations and values you've learned from them. Stay relevant: Connect your family background to traits like responsibility, work ethic, or motivation. Stay positive: Highlight support and encouragement without oversharing personal challenges.

About selection process: Be clear and structured: Briefly list the rounds (e.g., aptitude, technical, HR) in order. Highlight your preparation: Mention how you approached each round confidently. Stay honest and concise: Focus on key challenges and how you overcame them without over-explaining.

About leadership skills: Give a real example: Share a situation where you led a team or took initiative. Highlight key traits: Emphasize communication, decision-making, and teamwork. Show impact: Mention the positive outcome or what the team achieved under your leadership.