Automatic Data Processing (ADP)
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Top trending discussions
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...
Count the number of distinct islands in a 2D array of 0s and 1s.
Identify islands by performing depth-first search (DFS) on the grid
Use a set to store the shape of each island and check for duplicates
Consider translations to determine distinct islands
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
You are tasked with arranging 'N' words of varying lengths such that each line contains at most 'M' characters, with each word separated by a space. The challenge is to minimiz...
The goal is to minimize the total cost of arranging 'N' words on each line with a maximum character limit 'M'.
Calculate the cost of each line as the cube of extra space characters needed to reach 'M'.
Minimize the total cost by arranging words to fit within the character limit on each line.
Ensure each word appears fully on one line without breaking across lines.
Round duration - 60 minutes
Round difficulty - Easy
This was a System Design round.
Design a system similar to Red Bus for handling bookings and onboarding vendors and customers.
Implement a user-friendly interface for customers to search and book tickets
Create a vendor portal for vendors to manage their offerings and availability
Include payment gateway integration for secure transactions
Develop a robust backend system for managing bookings, cancellations, and refunds
Utilize a database to store user in...
Round duration - 50 minutes
Round difficulty - Easy
This was a System Design round
Round duration - 50 minutes
Round difficulty - Easy
This was an HR round.
Tip 1 : Practice as much as you can.
Tip 2 : Prepare for company, not in general.
Tip 3 : Your past work should be objective and your contribution should be very clear
Tip 1 : Keep only relevant things for the job you are applying.
Tip 2 : Minimal data with measurable contribution and effect.
posted on 25 Jan 2023
I applied via Approached by Company and was interviewed before Jan 2022. There were 3 interview rounds.
Arrays, Graphs majorly asked
Practice Leetcode
Design a traffic signal system
Identify the number of lanes and intersections
Determine the traffic flow and peak hours
Choose appropriate sensors and controllers
Implement a synchronization algorithm
Consider emergency vehicle prioritization
Include pedestrian crossing signals
Ensure compliance with local regulations
Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.
Hashmap uses hashing function to map keys to indices in an array
Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing
Java implementation: HashMap<String, Integer> map = new HashMap<>();
Printing patterns using code
Identify the pattern to be printed
Use loops to print the pattern
Adjust the loop variables to control the pattern
Use conditional statements to modify the pattern
Examples: printing stars, triangles, squares, etc.
Common point in linked list refers to the node where two or more linked lists intersect.
The common point can be found by traversing both linked lists and comparing the nodes.
The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.
Examples include finding the intersection point of two linked lists or finding the loop in a linked list.
I applied via Campus Placement
posted on 8 Apr 2021
I applied via Company Website and was interviewed in Dec 2020. There was 1 interview round.
Time complexity measures the amount of time an algorithm takes to complete based on input size.
Time complexity is expressed using Big O notation (e.g., O(n), O(log n)).
O(1) indicates constant time, e.g., accessing an array element.
O(n) indicates linear time, e.g., iterating through an array.
O(n^2) indicates quadratic time, e.g., nested loops through an array.
O(log n) indicates logarithmic time, e.g., binary search in a...
posted on 7 Sep 2021
I applied via Recruitment Consultant and was interviewed in Aug 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Dec 2021. There were 3 interview rounds.
Basic Aptitude like Quantitative , English and Logical Reasoning. Coding round had 4 questions - 2 SQL problems and 2 codes
based on 1 interview experience
based on 5 reviews
Rating in categories
Senior Member Technical
1.6k
salaries
| ₹9.2 L/yr - ₹21.3 L/yr |
Analyst
1.4k
salaries
| ₹5 L/yr - ₹11 L/yr |
Senior Process Associate
1.4k
salaries
| ₹3.3 L/yr - ₹7 L/yr |
Consultant
1.3k
salaries
| ₹19.2 L/yr - ₹35.8 L/yr |
Member Technical
926
salaries
| ₹4.7 L/yr - ₹10 L/yr |
Oracle
Amdocs
Carelon Global Solutions
24/7 Customer