i
Workday
Filter interviews by
A ridesharing service connecting drivers with passengers for convenient and affordable transportation.
Allow users to request rides through a mobile app
Match drivers with passengers based on location and destination
Provide estimated arrival times and fare estimates
Implement a rating system for drivers and passengers
Offer options for shared rides to reduce costs
Top trending discussions
I appeared for an interview in Jul 2019.
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Rotational shifts refer to working in different shifts at different times. Web service flow is the sequence of steps involved in a web service request. Checking ports on Unix or Solaris machine involves using the netstat command.
Rotational shifts involve working in different shifts at different times, such as day shift, night shift, and swing shift.
Web service flow involves a sequence of steps, such as sending a reques...
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
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 appeared for an interview before Dec 2020.
Round duration - 45 minutes
Round difficulty - Medium
At first, there were few questions regarding projects mentioned in resume. Later , few questions were asked from binary tree and binary search tree and in last a puzzle was asked. It lasted around 45 minutes. The interviewer was supporting type.
Convert a given binary search tree (BST) with 'N' nodes into a Greater Tree. In this transformation, each node's data is modified to the sum of the original node's data plus...
Convert a given BST into a Greater Tree by updating each node's data to the sum of original data and all greater nodes' data.
Traverse the BST in reverse inorder (right, root, left) to update nodes' data.
Keep track of the sum of greater nodes' data while traversing.
Update each node's data by adding the sum of greater nodes' data to the original data.
Example: Input BST: 4 1 6 0 2 5 7 -1 -1 -1 3 -1 -1 -1 -1. Output Greate...
Tip 1 : Practice basic as well as advanced questions on Binary Search Tree and Binary Tree
Tip 2 : Practice on aptitude part also
Tip 3 : If you do not have any project on software development, then think of implementing whatever project you have through coding
Tip 1 : Have some projects on resume whether it is related to software development or not
Tip 2 : One page resume is best and do not put false things on resume
I applied via Campus Placement and was interviewed before Jun 2020. There were 4 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 120minutes
Round difficulty - Easy
It was an online MCQ's + coding round consisting of 20 MCQ’s and 1 coding problem.
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at double the speed of the other.
If there is a loop, the two pointers will eventually meet at the same node.
Example: 1 -> 2 -> 3 -> 4 -> 5 -> 2 (loop back to 2), the two pointers will meet at node 2.
Round duration - 50 minutes
Round difficulty - Easy
The interview started at 8:30 pm in cc of Delhi Technological University itself and it was quite late. There was only a single interviewer and he asked me one coding question related to overflow of integers.
To check for integer overflow when multiplying two integers, use the properties of integer overflow and check if the result is within the valid range of the integer type.
Check if the signs of the two integers are the same to avoid overflow in case of multiplication.
Use the properties of integer overflow to detect if the result exceeds the maximum or minimum value of the integer type.
Consider using a larger data type or...
Round duration - 15 minutes
Round difficulty - Easy
It was quite late . There was only one interviewer and I was asked about my family , education and future plannings and few questions related joining locations and documents etc.
Focus on data structures and algorithms part more. Tell the interviewer , starting from the brute force approach to the most optimal solution as this will give a good impression to the interviewer.
Application resume tips for other job seekersTo be honest, the problem-solving ability is the only thing that most companies care about. So you can manipulate your resume according to that. Mention your competitive programming handles in your resume and also other coding ranks or achievements which you have achieved.
Final outcome of the interviewSelectedI applied via Naukri.com and was interviewed in Nov 2020. There were 3 interview rounds.
Weigh 3 groups of 3 balls each, then weigh 2 heaviest balls from the heaviest group to find the heaviest ball.
Divide the 9 balls into 3 groups of 3 balls each.
Weigh the first 2 groups against each other.
If one group is heavier, weigh 2 balls from that group against each other to find the heaviest ball.
If both groups weigh the same, weigh the third group to find the heaviest group.
Weigh 2 heaviest balls from the heavies
based on 1 interview
Interview experience
Salesforce Developer
12
salaries
| ₹18 L/yr - ₹45 L/yr |
Software Engineer
10
salaries
| ₹12 L/yr - ₹28 L/yr |
Business System Analyst
10
salaries
| ₹20 L/yr - ₹40 L/yr |
Senior Software Engineer
9
salaries
| ₹13 L/yr - ₹50 L/yr |
Senior Associate
9
salaries
| ₹16.5 L/yr - ₹36 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer