Publicis Sapient Software Developer Intern Interview Questions and Answers

Had DSA and aptitude questions

Q1. DSA a questions, Database Questions
Add your answer

Q1. 5 min question and answers about company
Add your answer

Round duration - 75 min
Round difficulty - Medium

This round was MCQ and coding round. 25 MCQs and one coding question were asked. MCQs were based on OS, DBMS, Aptitude and Data Structures.

Q1. 
Minimum Days to Complete Work
You have 'N' tasks to complete. Each task can only be done on one of two specific days provided in two arrays: day1 and day2.
For each task i, day1[i] represents the earliest...read more
Ans. 
Find the minimum number of days required to complete all tasks given specific completion days for each task.
• Sort the tasks based on day1 in ascending order.

• For each task, choose the minimum of day1 and day2 as the completion day.

• Keep track of the maximum completion day for each task.

• The final answer is the maximum completion day of all tasks.
Answered by AI
Add your answer

Round duration - 30 min
Round difficulty - Easy

This was a Data Structural round. Only one coding question was asked by the interviewer. The interviewer was very friendly. This round was very easy.

Q1. 
Bubble Sort Problem Statement
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
Input:
The first line contains an integer 'T' r...read more
Ans. 
Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.
• Implement the Bubble Sort algorithm to sort the array in place.

• Compare adjacent elements and swap them if they are in the wrong order.

• Repeat this process until the array is sorted.

• Time complexity of Bubble Sort is O(n^2) in the worst case.

• Example: For input [6, 2, 8, 4, 10], the output should be [2, 4, 6, 8, 10].
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

It was in the evening.
It consisted of 26 questions of easy to hard level.
It consisted of 25 MCQs and only 1 coding problem.

Q1. 
Author and Books Formatting
Given a structured list of books and their authors, format the information as specified.
Input:
The first line of input contains an integer ‘T' representing the number of tes...read more
Ans. 
The task is to format a list of authors and their books in a specific way as per the given input format.
• Parse the input to extract the number of test cases, number of authors, author names, and their respective books.

• Format the output by printing the author names and their books in the specified format.

• Ensure correct sequence and labeling of authors and books as per the example provided.

• Handle multiple test cases and a...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Medium

It was more of CV based round. A brief discussion on projects was there followed by some questions like why optum.

Q1. 
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co...read more
Ans. 
Implement a function to delete a node from a linked list at a specified position.
• Traverse the linked list to find the node at the specified position.

• Update the pointers of the previous and next nodes to skip the node to be deleted.

• Handle edge cases such as deleting the head or tail of the linked list.

• Ensure to free the memory of the deleted node to avoid memory leaks.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

A short round where some basic dbms questions like procedure, cursor were asked. Then some questions on whether I would prefer working alone or in a team. Where I see myself in 5 years.

Q1. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Ans. 
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
• Use graph coloring algorithm like BFS or DFS to check if the graph can be colored with two colors without conflicts.

• Check if any adjacent vertices have the same color. If so, it is not possible to color the graph as described.

• If the graph has connected components, color each co...read more
Answered by AI
Add your answer