SDE - 1

You are given an Integer array ‘ARR’ and an Integer ‘K’.

Your task is to find the ‘K’ most frequent elements in ‘ARR’. Return the elements in any order.

For Example:

You are given ‘ARR’ = {1, 2, 2, 3, 3} and ‘K’ = 2. 

The answer will {2, 3} as 2 and 3 are the elements occurring most times.

You are given a positive integer 'N'. Your task is to return all the prime numbers less than or equal to the 'N'.

Note:

1) A prime number is a number that has only two factors: 1 and the number itself.

2) 1 is not a prime number.

You are given a preorder traversal of a binary search tree. Your task is to find the postorder from the preorder.

Return the root of the BST constructed from the given preorder. The driver code will then use this root to print the post-order traversal.

For example:

You are given preOrder = [10, 5, 1, 7, 40, 50], the binary search tree from the given preorder traversal is 

Hence the answer is [1, 7, 5, 50, 40, 10].

You are given a string ‘str’ of size ‘N’. Your task is to remove consecutive duplicates from this string recursively.

For example:

If the input string is ‘str’ = ”aazbbby”, then your output will be “azby”.
Note that we are just removing adjacent duplicates.

Why should I hire you?
What are your strengths and weaknesses?
Why do you want to work at our company?
What is the difference between confidence and overconfidence?