New update is available. Click here to update.

Publicis Sapient Interview Experience for Fresher Technical Associate, Feb 2022

Posted: 22 Nov 2022

Selected

Interview Rounds

Application Process

Round 1

Round 2

Round 3

Interview Process

Online Coding Test

Moderate

Duration:

90 minutes

Interview-Date:

6 Feb 2022

Problems:

This was an Online coding round with two coding questions and the time given was 90 minutes.

Distance Of Nearest Cell Having 1 In A Binary Matrix

You have been given a binary matrix 'MAT' containing only 0’s and 1’s of size N x M. You need to find the distance of the nearest cell having 1 in the matrix for each cell.

Try Problem

See my Approach

Binary Tree Pruning

You have been given a Binary Tree where the value of each node is either 0 or 1. Your task is to return the same Binary Tree but all of its subtrees that don't contain a 1 have been removed.

Try Problem

See my Approach

Preparation

Duration:

3 months

Topics:

Data Structures, OOPS Concept, DBMS, OS, SDLC

Preparation Tip

Tip 1 : Practice DP, Trees, and Graph
Tip 2 : Try to make only 1-page resume
Tip 3 : Make sure you have clarity over your projects.

Application Process

Where:

Resume Tip

Tip 1 : Make sure you have 2 good projects on your resume
Tip 2 : The resume should not be more than 1 page

0 upvotes

Have an interview experience that you want to contribute?

PreviousNext

Start a Discussion

Publicis Sapient Mock Interviews

For college students & professionals looking to get into Publicis Sapient

Similar Experiences

Publicis Sapient | Fresher

Tushar Varshney

1 month ago

Junior Associate Technology

Publicis Sapient | Fresher

Publicis Sapient | Fresher

Publicis Sapient | Fresher

Anonymous

1 month ago

Associate Software Engineer

0 upvotes

0 views

0 comments

Categories:

Coding courses for beginners |

Web Development Courses |

Data Science & Machine Learning Courses |

Competitive Programming Course |

Android App Development Courses |

Courses for interview preparation

Popular Courses:

C++ Foundation with Data Structures |

Java Foundation with Data Structures |

Python Foundation with Data Structures |

Competitive Programming |

Full Stack Web Development

Career Tracks:

Ninja Competitive Programmer Track |

Ninja Android Developer Career Track |

Ninja Web Developer Career Track - NodeJS & ReactJs |

Ninja Web Developer Career Track - NodeJS |

Ninja Data Scientist Career Track |

Ninja Machine Learning Engineer Career Track

Publicis Sapient Interview Experience for Fresher Technical Associate, Feb 2022

Interview Process

Online Coding Test

You have been given a binary matrix 'MAT' containing only 0’s and 1’s of size N x M. You need to find the distance of the nearest cell having 1 in the matrix for each cell.

You have been given a Binary Tree where the value of each node is either 0 or 1. Your task is to return the same Binary Tree but all of its subtrees that don't contain a 1 have been removed.

Preparation

Application Process

Similar Experiences

Interested in Coding Ninjas Flagship Courses?