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

Round duration - 107 minutes
Round difficulty - Medium

The test was active on (Oct 1, 2020) from 7:00 PM to 09:00 PM. The duration of the test is 107 minutes.
The candidate should have completed the test by 9:45 PM.

The camera and microphone was on all the time. There was time alotted for each section. After completing one section you cannot switch to the previous section. If you go off the camera you will get a warning.
The test contained several sections and all questions were MCQs. The sections were Coding ability, Computer Science theory, Advanced data structures like AVL Tree, Verbal and Quantitative ability, etc

Q1. 
Preorder Traversal to BST Problem Statement
Given an array or list PREORDER representing the preorder traversal of a Binary Search Tree (BST) with N nodes, construct the BST which matches the given preord...read more
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

The Round started at 10:15 am and ended at 10:45 am approx. We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer both camera and microphone was on. The interviewer was really supportive and hepled me in thinking different approches of a problem.

Q1. 
Check if a Number is Binary
Determine if a given string of integers bin represents a valid binary number. Return 'true' if the string represents a valid binary number, otherwise return 'false'. A binary n...read more
Add your answer
Q2. 
Rearrange The Array Problem Statement
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
Example:
Inpu...read more
Add your answer
Q3. 
Number and Digits Problem Statement
You are provided with a positive integer N. Your task is to identify all numbers such that the sum of the number and its digits equals N.
Example:
Input:
N = 21
Out...read more
Add your answer
Q4. 
Reverse a String Problem Statement
Given a string STR containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
Input:
The input starts with a single i...read more
Add your answer
Q5. What will be the result when adding two binary numbers in a 64-bit and a 32-bit operating system?
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It took place at 11:30am(approx) and last for about 30 minutes
We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer. Both camera and microphone was on.

Round duration - 30 minutes
Round difficulty - Easy

It took place around 1:30pm and last for 30 minutes. We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer. Both camera and microphone was on.

Q1. Quality base question
Add your answer

Q1. Salary discussion happen in hr round
Add your answer
Q2. Notice period discussion
Add your answer

Q1. Tell me about your background
Ans. 
I have a diverse background in marketing, with experience in both traditional and digital marketing strategies.
• Bachelor's degree in Marketing from XYZ University

• 5 years of experience in marketing roles at various companies

• Proficient in creating and implementing marketing campaigns

• Skilled in market research and analysis

• Experience with social media marketing and email campaigns
Answered by AI
Add your answer
Q2. Why are you looking for a new role
Add your answer

Q1. Describe a recent marketing campaign you worked on
Add your answer

Simple question in c and c++ with free technical question without option

Q1. Linked list in javascrip
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Linked list is a linear data structure.

• Each node contains data and a reference to the next node.

• Insertion and deletion operations are efficient in linked lists.

• Example: Singly linked list, Doubly linked list, Circular linked list.
Answered by AI
Add your answer

Q1. Team management
Add your answer

Q1. QBR, diversity, shrinkage
Add your answer

Reverse of 32 bit unsigned integer