SDE - Intern

Initialize count = 0
Loop i from 1 to 100:
   If i is divisible by 3 and the sum of the digits of i is even:
       count += i
Print count

You are given an integer 'n'. Your task is to perform a sequence of operations:

1)Reverse the digits of 'n'.
2)Square the reversed number.
3)From the squared result, extract only the even digits (0, 2, 4, 6, 8) and print them in the order they appear.

What is the difference between a process and a thread?

What happens if a high-priority process goes into an infinite loop?

Find the second-highest salary among the employees. (Practice)

What is the use of indexing in table rows?

Explain normalization and its types with examples. (Learn)

How does the OS manage memory?

You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can have negative numbers as well.

For example, the input [3, 4, -1, 1] should give output 2 because it is the smallest positive number that is missing in the input array.

You have been given a Binary Tree of distinct integers and two nodes ‘X’ and ‘Y’. You are supposed to return the LCA (Lowest Common Ancestor) of ‘X’ and ‘Y’.

The LCA of ‘X’ and ‘Y’ in the binary tree is the shared ancestor of ‘X’ and ‘Y’ that is located farthest from the root.

Note :

You may assume that given ‘X’ and ‘Y’ definitely exist in the given binary tree.

For example :

For the given binary tree

LCA of ‘X’ and ‘Y’ is highlighted in yellow colour.

Can you tell me about yourself?

What are your strengths and weaknesses?

Where do you see yourself in 5 years?

Tell me about a challenge you faced and how you handled it.

• Imagine you are working in a team, and your teammate is not contributing. What would you do?
• What would you do if you made a mistake in your code that caused a bug in production?
• Suppose you have two tasks: one urgent and one important — which one would you do first?