Premium Employer

i

This company page is being actively managed by Workday Team. If you also belong to the team, you can get access from here

Workday Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Workday Software Developer Intern Interview Questions and Answers

Updated 25 Mar 2024

Workday Software Developer Intern Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Design a ridesharing service
  • Ans. 

    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

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview in Jul 2019.

Interview Questionnaire 

4 Questions

  • Q1. 1. Java questions basee on interfaces, Exception Handling, inheritance, Steam API;
  • Q2. 2. SQL questions related to joins, sub-queries, nth highest salary;
  • Q3.  3. Basic algorithms questions based on Arrays/Linked List.
  • Q4. 4. Puzzles based on basic aptitudes test.

Interview Preparation Tips

Interview preparation tips for other job seekers - I was interviewed for Java Developer. I had 4 rounds (all technical rounds). Each rounds comprises questions related to Java/Puzzles/Algorithms and my experience of project.

Go through your resume. Things should be relevant and one should have clear understanding of basics.

I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. What is rotational shifts. What is web service flow. How will you check ports on Unix or Solaris machine.
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Total pathetic experience. Have heard of negative reviews from a number of people, but didn't believed. Unfortunately had to share same pain with them. What job description is given to you, doesn't matters because you won't be asked for that. Your resume will get shortlisted and then it doesn't matter what u have covered up in your career path, because interview rounds will consist of questions out of your scope. Your resume doesn't needs to be shortlisted at first end if it doesn't suit thier needs. HR people, they are on another level. You share your resume to them, and they will never ever reply back to you. Not a single HR, but it seems everyone has same culture. You keep trying to connect them for support. But they will just keep finding smarter ways to avoid.

Skills evaluated in this interview

Interview Questionnaire 

9 Questions

  • Q1. System design of traffic signal
  • Ans. 

    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

  • Answered by AI
  • Q2. Data structures
  • Q3. Oops spring jdbc
  • Q4. Hashmap implementation
  • Ans. 

    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 map = new HashMap<>();

  • Answered by AI
  • Q5. Pattern printing code
  • Ans. 

    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.

  • Answered by AI
  • Q6. Common point in linked list
  • Ans. 

    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.

  • Answered by AI
  • Q7. Optimization
  • Q8. Synchronisation
  • Q9. Threads

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(1 Question)

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.

  • Q1. 

    BST to Greater Tree Conversion

    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...

  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BengaluruEligibility criteriaCGPA : 7 & above and no active backlogs , Online testOracle interview preparation:Topics to prepare for the interview - Pointers, Binary tree, Binary Search tree, OOPS, Time Complexity, Algorithms, DBMSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewRejected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Jun 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. For java based profile, questions related to collections, usage of comparator, Class loading are asked.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong in basics of computer science like data structure and algorithms. Have a detailed understanding of java basics

Interview Questionnaire 

1 Question

  • Q1. Oops, core Java related questions, spring boot

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 120minutes
Round difficulty - Easy

It was an online MCQ's + coding round consisting of 20 MCQ’s and 1 coding problem.

  • Q1. Check whether there exists a loop in the linked list.
  • Ans. 

    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.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

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.

  • Q1. How can you check for integer overflow when multiplying two integers and ensure the result is stored correctly within an integer type?
  • Ans. 

    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...

  • Answered by AI
Round 3 - HR 

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.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Delhi Technological University. I applied for the job as SDE - 1 in PuneEligibility criteria6Amdocs interview preparation:Topics to prepare for the interview - I did a lot of practice of data structures and algorithms. I covered main topics such as arrays, strings, trees, linked lists, hashmaps, and recursion. Algorithms such as sorting, searching, BFS, DFS, and greedy were also covered by me.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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 seekers

To 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 interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Nov 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. All the questions were technical and most of them were based on my previous experience and manager round was very different i.e asked some logical questions
  • Q2. You have been given 9 balsa of same shape and size by using weighing scale you need to determine the heavy weight ball by weighing 3 times.
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be yourself confidently answer the questions

Interview Questionnaire 

1 Question

  • Q1. Some basic coding questions which can be solved using any programming language. I solved them using Java. Some basic UNIX questions and some basic SQL questions

Workday Interview FAQs

How many rounds are there in Workday Software Developer Intern interview?
Workday interview process usually has 1 rounds. The most common rounds in the Workday interview process are Technical.

Tell us how to improve this page.

Workday Software Developer Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Join Workday Your work days are brighter here.
Salesforce Developer
12 salaries
unlock blur

₹18 L/yr - ₹45 L/yr

Software Engineer
10 salaries
unlock blur

₹12 L/yr - ₹28 L/yr

Business System Analyst
10 salaries
unlock blur

₹20 L/yr - ₹40 L/yr

Senior Software Engineer
9 salaries
unlock blur

₹13 L/yr - ₹50 L/yr

Senior Associate
9 salaries
unlock blur

₹16.5 L/yr - ₹36 L/yr

Explore more salaries
Compare Workday with

Oracle

3.7
Compare

Amdocs

3.7
Compare

Automatic Data Processing (ADP)

4.0
Compare

24/7 Customer

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview