Associate Software Developer

You are given an array/list 'ARR' consisting of N integers, which contains elements only in the range 0 to N - 1. Some of the elements may be repeated in 'ARR'. Your task is to find all such duplicate elements.

Note:

1. All the elements are in the range 0 to N - 1.
2. The elements may not be in sorted order.
3. You can return the duplicate elements in any order.
4. If there are no duplicates present then return an empty array.

You are given a string 'STR'. You have to convert the first alphabet of each word in a string to UPPER CASE.

For example:

If the given string 'STR' = ”I am a student of the third year” so you have to transform this string to ”I Am A Student Of The Third Year"

Note:

'STR' will contains only space and alphabets both uppercase and lowercase. The words will be separated by space.

Describe any one of your project on the whitespace.[ I started making a flowchart of my project which I did recently. Try to explain the project like you are explaining to a child so that even if he doesn’t know anything he can understand it otherwise he will not be interested]

He asked me to design a model to get the top 20 relevant pages from 10,000 pages on the web.

Given an adjacency list representation of a directed graph with ‘n’ vertices and ‘m’ edges. Your task is to return a list consisting of Breadth-First Traversal (BFS) starting from vertex 0.

In this traversal, one can move from vertex 'u' to vertex 'v' only if there is an edge from 'u' to 'v'. The BFS traversal should include all nodes directly or indirectly connected to vertex 0.

Note:

The traversal should proceed from left to right according to the input adjacency list.

Example:

Adjacency list: { {1,2,3},{4}, {5}, {},{},{}}

The interpretation of this adjacency list is as follows:
Vertex 0 has directed edges towards vertices 1, 2, and 3.
Vertex 1 has a directed edge towards vertex 4.
Vertex 2 has a directed edge towards vertex 5.
Vertices 3, 4, and 5 have no outgoing edges.

We can also see this in the diagram below.

BFS traversal: 0 1 2 3 4 5

You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.

You can assume that the value of N will always be greater than 1. So, the answer will always exist.

As I had machine learning and deep learning as my area of interest. So he asked me questions related to it like what is deep learning and how it is different from machine learning.

Explain a Deep Learning algorithm

What is the difference between Abstraction and encapsulation? Explain with an example.

What is an abstract class and what is an Interface? When do we use an abstract class?
What is polymorphism? How many types of polymorphism are there in java?
What is multithreading in java?
What is the difference between an array and a linked list data structure? Discuss the advantages and disadvantages of both.
What is inheritance? Why do we need inheritance?

Suppose you are doing a project in a team and there is a conflict between you and your teammate. What will you do?
Suppose there are members of your team who are not as good as you. What will you do?
Suppose you are unable to meet your deadline for a project. What will u do?
What is your view regarding a good teacher and a bad teacher?
What was your role in your team project?
Tell me about your strength and weakness?
Where do you see yourself five years later?
What is your area of interest?
Suppose you are given work which you u don’t like, What will you do in this situation?

What are the struggles of living in a small town?

Tell me about your hobbies?

How are you spending your time in this lockdown period?
How is this lockdown going for you?
What is your view regarding the present COVID situation?
What do you feel should be qualities in a team lead?
Do you have any questions for me?[for this I asked -How is the work culture at SAP?]
How was your previous round of experience? How was the interview?