i
Publicis Sapient
Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2022. There were 4 interview rounds.
There were 3-4 medium-level DSA questions.
Publicis Sapient has job locations in multiple cities across India.
Publicis Sapient has offices in Bangalore, Gurgaon, Mumbai, and Chennai.
They also have a presence in Noida, Hyderabad, and Jaipur.
The company offers remote work options as well.
Job locations may vary depending on the specific role and project.
One Dp and one backtracking question
Event loop is a mechanism that allows JavaScript to perform non-blocking I/O operations.
Event loop is a part of JavaScript runtime that continuously checks the call stack and the task queue.
It processes the tasks in the task queue one by one and pushes them to the call stack.
Higher order components are functions that take a component and return a new component with additional functionality.
They are commonly used in Rea...
I applied via Referral and was interviewed in Jul 2022. There were 3 interview rounds.
Publicis Sapient interview questions for designations
I was interviewed in Apr 2022.
Round duration - 90 minutes
Round difficulty - Medium
You are provided with an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. The task is to determine the height of the tree.
The height of a binary tree is the maximum number of edges from the root to a leaf node.
Traverse the tree recursively and keep track of the maximum height
If the current node is null, return 0
Otherwise, calculate the height of the left and right subtrees and return the maximum height plus 1
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to calculate the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped on each bar by subtracting its height from the minimum of the maximum heights on both sides.
Sum up the trapped water for all bars and return the total amount.
Round duration - 45 minutes
Round difficulty - Medium
Given two sorted integer arrays ARR1
and ARR2
of size M and N, respectively, merge them into ARR1
as one sorted array. Assume that ARR1
has a size of M + N to hol...
The task is to merge two sorted arrays into one sorted array.
Create a new array with size M + N to store the merged array
Use two pointers to iterate through the elements of ARR1 and ARR2
Compare the elements at the current pointers and add the smaller element to the new array
Move the pointer of the array from which the element was added
Repeat the process until all elements are merged
If there are remaining elements in AR...
Tip 1 : Just focus on Data structures mostly arrays, string and dp and practice at least 350 Questions
Tip 2 : Prepare topics related to web tech like HTML, CSS, Node Js
Tip 3 : Prepare Java, OOPS and if required then spring framework and jsp, servlets and do atleast 2 good projects
Tip 1 : Everything should be clear and right what you have written on your resume.
Tip 2 : Have some projects on your resume and that projects should be done by you only and you should have proper knowledge of the tech and flow you have used in that projects.
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
Creating a card component using react and rendering a list of people using that card
I applied via campus placement at Bangalore Institute Of Technology (BIT) and was interviewed before Sep 2022. There were 4 interview rounds.
30 question mCQ for online assessment
3 codes for online assessment and MCQ
I applied via Naukri.com and was interviewed before Oct 2020. There was 1 interview round.
I applied via Job Portal and was interviewed in Nov 2024. There were 3 interview rounds.
posted on 10 Sep 2023
I applied via campus placement at Bangalore Institute Of Technology (BIT) and was interviewed in Aug 2023. There were 3 interview rounds.
40 questions-aptitude test followed by a technical test comprising 10 questions.
The question asks for adding two linked lists, finding the minimum cost path, and printing all nodes in a tree except the leaf nodes.
To add two linked lists, traverse both lists simultaneously and add corresponding nodes.
To find the minimum cost path, use algorithms like Dijkstra's or A*.
To print all nodes in a tree except the leaf nodes, perform a depth-first traversal and print non-leaf nodes.
Some of the top questions asked at the Publicis Sapient Associate Software Engineer interview -
based on 6 interviews
2 Interview rounds
based on 19 reviews
Rating in categories
Senior Associate
2.2k
salaries
| ₹11 L/yr - ₹40 L/yr |
Associate Technology L2
1.5k
salaries
| ₹6.5 L/yr - ₹20 L/yr |
Senior Associate Technology L1
1.2k
salaries
| ₹10 L/yr - ₹30 L/yr |
Senior Software Engineer
739
salaries
| ₹9.5 L/yr - ₹37 L/yr |
Senior Associate 2
622
salaries
| ₹14.1 L/yr - ₹41 L/yr |
Accenture
IBM
TCS
Infosys