Automatic Data Processing (ADP) Mts1 Interview Questions and Answers

1 hour 30 minutes, questions were based on coding, aptitude

Q1. Interviewer asked two coding questions.
Add your answer

Linked list one easy question

Can't disclose NDA it was regarding class diagram

Q1. What is your favourite company
Ans. 
My favorite company is Google.
• Innovative technology

• Diverse range of products and services

• Strong focus on user experience
Answered by AI
Add your answer
Q2. How can you explain the path of ip to url
Ans. 
IP address is converted to URL through DNS resolution process involving multiple steps.
• IP address is obtained from the domain name system (DNS) server when a user enters a URL in a web browser.

• The DNS server looks up the IP address associated with the URL in its database.

• The DNS server then returns the IP address to the user's device, allowing it to establish a connection to the server hosting the website.

• For example, ...read more
Answered by AI
Add your answer

Q1. Why this company
Ans. 
I chose this company because of its innovative projects, strong company culture, and opportunities for growth.
• Innovative projects: I am excited about the cutting-edge technology being developed at Mts.

• Strong company culture: I value a supportive and collaborative work environment.

• Opportunities for growth: I see potential for career advancement and skill development here.
Answered by AI
Add your answer
Q2. What is the thing you wanna improve
Ans. 
I want to improve my problem-solving skills by learning new programming languages and technologies.
• Learn a new programming language like Python or Java

• Explore new technologies like cloud computing or machine learning

• Practice solving coding challenges on platforms like LeetCode or HackerRank
Answered by AI
Add your answer

Q1. What is c+,c++ what is java
Ans. 
C+ and C++ are programming languages used for system and application development, while Java is a high-level programming language known for its portability and versatility.
• C+ and C++ are low-level programming languages used for system programming and application development.

• C++ is an extension of the C programming language with added features like classes and objects.

• Java is a high-level programming language known for ...read more
Answered by AI
Add your answer
Q2. What is python, what is html
Ans. 
Python is a high-level programming language known for its simplicity and readability. HTML is a markup language used for creating web pages.
• Python is a versatile language used for web development, data analysis, artificial intelligence, and more

• HTML stands for HyperText Markup Language and is used to create the structure of web pages

• Python code is executed line by line, while HTML is interpreted by web browsers to disp
Answered by AI
Add your answer

Writing assignment - mix of domain and role based

Product demo - understand the product and a basic presentation

Q1. Tell me about yourself
Ans. 
Experienced marketing professional with a strong background in digital marketing and brand management.
• Over 5 years of experience in marketing roles

• Specialize in digital marketing strategies and social media management

• Successfully launched several marketing campaigns resulting in increased brand awareness and sales

• Strong analytical skills to track and measure campaign performance
Answered by AI
Add your answer

All Logical questions plus coding

Q1. Whats your Relevant exp
Add your answer
Q2. Whats your Job role with previous
Add your answer

Technical round- Hackerank Problem

Q1. Coding medium and easy problems for Leetcode,
Add your answer
Q2. More of a scenario based questions like whatyou will do if you have a confict with your developer
Add your answer
Q3. How will you lead your team
Add your answer

Q1. Java, API, Testing related, Selenium, Scenario based question
Add your answer

Round duration - 140 minutes
Round difficulty - Hard

2 Separate online rounds were hosted on HackerRank . Online Aptitude Round consisted of 45 questions. Online Coding Round consisted of 3 questions.

Q1. String Classifier
You have to classify a string as “GOOD”, “BAD” or “MIXED”.  A string is composed of lowercase alphabets and ‘?’. A ‘?’ is to be replaced by any of the lowercase alphabets. Now you hav...read more
Ans. 
Applied a simple brute force solution and classified according to the rules.
Answered by CodingNinjas
Add your answer
Q2. Maximum Sum
You are given an array “ARR” of N integers. You are required to perform an operation on the array each time until it becomes empty. The operation is to select an element from the array(let’s sa...read more
Ans. Recursion
The key point to notice here is that in the given problem that we don’t need to delete anything from the array while selecting arr[i] from the array. We just only care about whether we select any number arr[i] from the array then we cant select the arr[i]+1 and arr[i]-1 from the array to maximize the sum in the next steps. So we will find the maximum number max in the array and create a new auxiliary array of ...read more
Answered by CodingNinjas
View 2 more amswers
Q3. Rearrange the array
You are given an array/list 'NUM' of integers. You are supposed to rearrange the elements of the given 'NUM' so that after rearranging the given array/list there are no ...read more
Ans. Greedy with Priority Queue
The key idea is to put the highest frequency element first (a greedy approach). We will be using the priority queue to pick the elements with the highest frequency. So first, we will store the frequency of each element. And then we will store all the numbers with their frequencies into the priority queue in the highest frequency priority manner. After that, we pop one by one element from the p...read more
Answered by CodingNinjas
Add your answer

Round duration - 40 minutes
Round difficulty - Hard

The interview started of with questions about the online test, general questions on “tell me about yourself”
Then he asked me a relative velocity problem from physics section to warm things up.
It was Followed by discussion on topics taught in college, Questions on OS and DBMS.

Q1. Ways to reach nth stair
You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair. Each time you can either climb one step or two steps. You are suppo...read more
Ans. Brute Force
One basic approach is to explore all possible steps which can be climbed with either taking one step or two steps. So at every step, we have two options to climb the stairs either we can climb with one step, or we can climb with two steps. So the number of ways  can be recursively defined as :
countDistinctWayToClimbStair ( currStep, N ) = countDistinctWayToClimbStair ( currStep+1, N ) + countDistinctWay...read more
Answered by CodingNinjas
View 3 more amswers
Q2. Level Order traversal of binary tree
You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.
For example:
For the given binary tree
The ...read more
Ans. Breadth First Search
In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...read more
Answered by CodingNinjas
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

The interviewer asked about my project – the idea of the project, the challenges I faced etc. She also asked some OS concepts like CPU scheduling, multi-queue scheduling, mutex, deadlocks.

Q1. Left view of binary tree
Given a binary tree. Print the Left View of the Tree.
Example :
If the input tree is as depicted in the picture: 
The Left View of the tree will be:  2 35 2 
Input format :
...read more
Ans. Recursive Approach
This problem can be solved through recursion.We will maintain max_level variable which will keep track of maxLevel and will pass current level in recursion as argument. Whenever we see a node whose current level is more than maxLevel then we will print that node as that will be first node for that current level. Also update maxLevel with current level.
Space Complexity: O(n)Explanation:
O(N), where ‘N’...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Top view of binary tree
Given a binary tree. Print the Top View of Binary Tree. Print the nodes from left to right order.
Example:
Input:
Output: 2 35 2 10 2
Input format :
The first line contains...read more
Ans. DFS
Before looking at the approach, let's define a couple of terms; the level of a node and the distance of a node. The level of a node means the depth of the node with respect to the root node. So, the level of the root node will be 0, its children's would be 1, and so on. To generalize, if the level of a node is ‘x’, then the level of its children would be ‘x + 1’. 
 
The distance of a node is a measure of how...read more
Answered by CodingNinjas
View 1 more amswer
Q3. System Design
Design a system where i can store incoming stream of chars in sorted manner and to answer a query whether a char is present or not
Ans. 
Tip 1: Strong grasp on Heaps
Tip 2: Ask questions if you are not sure
Tip 3: Design a basic HLD with use case scenarios.
Answered by CodingNinjas
Add your answer
Q4. Mutex Puzzles
She then Asked me Various Mutex related puzzles like “IF you have adobe acrobat and you want to allow only 1 instance of it to run at a time, how will you achieve this wrt to OS involved.”
I an...read more
Add your answer