Digital

You have been given an array/list 'ARR' consisting of 'N' integers. Your task is to find the majority element in the array. If there is no majority element present, print -1.

Note:

A majority element is an element that occurs more than floor('N' / 2) times in the array.

You are given two strings 'str1' and 'str1'.

You have to tell whether these strings form an anagram pair or not.

The strings form an anagram pair if the letters of one string can be rearranged to form another string.

Pre-requisites:

Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams. 

Other examples include:

'triangle' and 'integral'
'listen' and 'silent'

Note:

Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct. 

1. Introduce yourself.
2. What did you learn during your internship?
3. Draw a balanced binary tree. Then he gave a case where I had to determine whether it was a balanced binary tree or not.
4. DFS vs BFS. (Learn)
5. Difference between Selection Sort and Bubble Sort.
6. Selection Sort: Step-by-step approach with an example on paper.
7. Method Overloading vs Method Overriding. (Learn)
8. What is the cloud? Where is the data stored, and how is it stored? (Learn)
9. How is the backup of stored data done?
10. Horizontal Scaling vs Vertical Scaling in Cloud. (Learn)
11. Agile in AI.
12. Waterfall Model in Software Engineering and Its Drawbacks. (Learn)
13. What is encryption and decryption? State a real-world example.
14. What is the output of the encryption stage? He gave a hint: “text-based output.”
    Ans: Cipher text.   
15. Asked some questions related to my publication.

You have been given a Binary Tree of 'N'

nodes, where the nodes have integer values.

Your task is to return the ln-Order, Pre-Order, and Post-Order traversals of the given binary tree.

For example :

For the given binary tree:

The Inorder traversal will be [5, 3, 2, 1, 7, 4, 6].
The Preorder traversal will be [1, 3, 5, 2, 4, 7, 6].
The Postorder traversal will be [5, 2, 3, 7, 6, 4, 1].

You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignore the symbols and whitespaces.

Note :

String 'S' is NOT case sensitive.

Example :

Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.

• Why do you want to join TCS?
• What are your strengths and weaknesses?