i
Publicis Sapient
Filter interviews by
I appeared for an interview in Sep 2024.
There were MCQ questions consists of different sections like Design Pattern,Java 8
I appeared for an interview in Aug 2024.
Complete Coding Test to write a complete application code.
Microservice design patterns are architectural patterns used to design and implement microservices.
Service discovery and registration
Circuit breaker pattern
API gateway pattern
Event sourcing pattern
Saga pattern
I appeared for an interview in Jan 2025.
Mixed questions of design patterns, spring, java, transaction management
What people are saying about Publicis Sapient
posted on 15 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
It happens in very friendly manner.
Given an 'M x N' matrix, print all the possible paths from the top-left corner to the bottom-right corner. You can only move either right (from (i,j) to (i,j+1)) or dow...
Print all possible paths from top-left to bottom-right in a matrix by moving only right or down.
Use backtracking to explore all possible paths from top-left to bottom-right in the matrix.
At each cell, recursively explore moving right and down until reaching the bottom-right corner.
Keep track of the current path and add it to the result when reaching the destination.
Yes, I can create 2 tables in SQL and perform operations like INSERT, SELECT, UPDATE, and DELETE.
Create Table 1: CREATE TABLE employees (id INT, name VARCHAR(50), salary DECIMAL(10,2));
Create Table 2: CREATE TABLE departments (dept_id INT, dept_name VARCHAR(50));
Insert Data: INSERT INTO employees VALUES (1, 'John Doe', 50000);
Select Data: SELECT * FROM employees WHERE salary > 40000;
Update Data: UPDATE employees SET...
Round duration - 90 minutes
Round difficulty - Medium
No problem occur very friendly environment.
Round duration - 90 minutes
Round difficulty - Hard
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
If the destination is reached, add the path to the list of valid paths.
Tip 1 : Competitive programming plays a major role when you are appearing for coding rounds as a fresher. In the coding rounds, you won't get direct problems copied from Geeksforgeeks or Leetcode. You would be required to use your logical thinking to go ahead in the process. This is where competitive programming helps.
Tip 2 : Coding rounds are all about Coding + Timing. Most people fail to excel due to the pressure of a timer ticking on your head. So, instead of just solving problems, try to participate in timed contests. This will help you be used to the pressure of the timer.
Tip 3 : Many big companies like Microsoft, Amazon, and even Google expect you to be good at standard problems. So, once you are done with coding round by your logical skills and competitive programming, you must be well versed with some standard problems in order to excel.
Application resume tips for other job seekersTip 1 : Make it short, crisp, and simple. It is always good to have a 1 pager resume.
Tip 2 : Resume must comprise of the following: Educational Qualifications, Technical skills, Projects, Work experience (if any), Achievements. Other than this, you may include some extra co-curricular achievements.
posted on 2 Jun 2022
I appeared for an interview before Jun 2021.
Had DSA and aptitude questions
I applied via Naukri.com and was interviewed in Jul 2020. There were 3 interview rounds.
posted on 13 Jan 2015
Collection hierarchy in Java includes interfaces like Collection, List, Set, Queue, and Map with their respective implementations.
Collection interface is the root interface in the collection hierarchy
List interface extends Collection and allows duplicate elements, with implementations like ArrayList and LinkedList
Set interface extends Collection and does not allow duplicate elements, with implementations like HashSet a...
based on 3 interviews
Interview experience
based on 1 review
Rating in categories
5-8 Yrs
₹ 9.5-30 LPA
6-10 Yrs
Not Disclosed
Gurgaon / Gurugram,
Bangalore / Bengaluru
+17-12 Yrs
Not Disclosed
Senior Associate
2.2k
salaries
| ₹11.1 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.3 L/yr - ₹32 L/yr |
Senior Software Engineer
788
salaries
| ₹10 L/yr - ₹38 L/yr |
Senior Associate 2
635
salaries
| ₹14.1 L/yr - ₹42 L/yr |
Genpact
DXC Technology
Virtusa Consulting Services
CGI Group