i
Publicis
Sapient
Work with us
Filter interviews by
I appeared for an interview in Sep 2021.
Round duration - 90 Minutes
Round difficulty - Medium
It was at 9 am in the morning
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...
Add two numbers represented as linked lists and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry from previous sum
Create a new linked list to store the sum of the two numbers
Handle cases where one linked list is longer than the other by padding with zeros
Update the current node with the sum of corresponding nodes from both lists and carry
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
Detect if an undirected graph contains a cycle by exploring all possible paths.
Use Depth First Search (DFS) to traverse the graph and detect cycles.
Maintain a visited set to keep track of visited vertices and a parent pointer to avoid revisiting the same vertex.
If a visited vertex is encountered that is not the parent of the current vertex, a cycle is present.
Check for cycles in each connected component of the graph.
Ex...
Round duration - 50 Minutes
Round difficulty - Hard
Given an array ARR
consisting of N
integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Find the maximum sum of a contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays seen so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Consider edge cases like all negative numbers in the array.
Example: For input [-2, 1, -3, 4, -1], the maximum subarray sum is 4.
Round duration - 30 Minutes
Round difficulty - Hard
Happened on teams
Tip 1 : Practice Leetcode
Tip 2 : Solve COdeforces A,B,C
Tip 1 : Make a clear resume with normal style
Tip 2 : Use overleaf for templates
What people are saying about Publicis Sapient
I applied via Naukri.com and was interviewed before Sep 2019. There were 6 interview rounds.
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 13 Jan 2015
posted on 9 Feb 2015
SQL command for creating a table
Use CREATE TABLE statement
Specify table name and column names with data types
Add any constraints or indexes as needed
SQL commands for inserting, updating, and deleting data from a table.
INSERT INTO table_name (column1, column2, column3) VALUES (value1, value2, value3);
UPDATE table_name SET column1 = new_value1 WHERE condition;
DELETE FROM table_name WHERE condition;
Truncate and drop are SQL commands used to remove data from a table.
Truncate removes all data from a table but keeps the structure intact.
Drop removes the entire table and its structure.
Truncate is faster than drop as it only removes data.
Drop cannot be undone while truncate can be rolled back.
Truncate resets the identity of the table while drop does not.
Examples: TRUNCATE TABLE table_name; DROP TABLE table_name;
I am a software developer with experience in Java and Python.
I have a Bachelor's degree in Computer Science.
I have worked on various projects involving web development and data analysis.
I am proficient in Java and Python programming languages.
I have experience with frameworks such as Spring and Django.
I am familiar with databases such as MySQL and MongoDB.
I have always been fascinated by technology and its ability to solve complex problems.
I enjoy problem-solving and logical thinking
I have a natural curiosity for how things work
I see the potential for technology to make a positive impact on society
I have experience in programming and find it rewarding
I am excited about the constant innovation and evolution in the IT industry
My strengths include problem-solving, adaptability, and teamwork. My weakness is public speaking.
Strengths: problem-solving, adaptability, teamwork
Examples: I have successfully solved complex coding problems, adapted to new technologies quickly, and collaborated effectively with team members.
Weakness: public speaking
Examples: I get nervous when speaking in front of large groups, but I am working on improving my present...
I have the technical skills, experience, and passion to excel in this role.
I have a strong background in software development, with expertise in multiple programming languages and frameworks.
I have experience working on complex projects and collaborating with cross-functional teams.
I am passionate about staying up-to-date with the latest technologies and trends in the industry.
I am a quick learner and adaptable to new ...
Reverse a linked list using iterative and recursive methods.
Iterative method involves traversing the list and changing the pointers to reverse the order.
Recursive method involves calling the function recursively on the next node and changing the pointers.
Both methods have O(n) time complexity and O(1) space complexity.
Example: 1->2->3->4->5 becomes 5->4->3->2->1.
Clone a linked list with a random pointer.
Create a new node for each node in the original list.
Use a hash table to map the original nodes to their clones.
Iterate through the original list again and update the random pointers of the clone nodes.
The question asks to input an array and print the repeating characters.
Iterate through the array and store each element in a hash table or dictionary.
If an element already exists in the hash table, it is a repeating character.
Print all the repeating characters found.
Program to find the second minimum in an array.
Sort the array and return the second element.
Initialize two variables to store minimum and second minimum values.
Loop through the array and update the variables accordingly.
To find the longest palindrome in a given string.
Iterate through the string and check for palindromes of odd and even lengths.
Keep track of the longest palindrome found so far.
Use two pointers to check if the substring is a palindrome.
If the substring is a palindrome and its length is greater than the current longest palindrome, update the longest palindrome.
Find the next higher number with equal number of ones in binary representation.
Convert input number to binary
Count number of ones in binary representation
Increment input number until binary representation has equal number of ones
Convert incremented number to decimal
Find the duplicate number in an array of 10 numbers with only 2 steps.
Use a hash set to keep track of visited numbers.
Iterate through the array and check if the number is already in the set.
If it is, then it is the duplicate number.
If not, add it to the set.
At the end, the duplicate number will be found.
Program to print elements of a linked list in reverse order using same single linked list
Traverse the linked list and push each element onto a stack
Pop elements from the stack and print them in reverse order
To check the occurrence and correctness of HTML tags, we can use various tools and techniques.
One way is to use a browser's developer tools to inspect the HTML code and see the tags and their frequency.
Another way is to use an online HTML validator tool that checks for correct syntax and tag usage.
We can also use programming languages like Python to parse HTML and count the occurrence of each tag.
Regular expressions ca...
based on 2 reviews
Rating in categories
Senior Associate
2.2k
salaries
| ₹11.3 L/yr - ₹40 L/yr |
Associate Technology L2
1.6k
salaries
| ₹6.7 L/yr - ₹21.7 L/yr |
Senior Associate Technology L1
1.4k
salaries
| ₹10.5 L/yr - ₹30 L/yr |
Senior Software Engineer
899
salaries
| ₹17.5 L/yr - ₹32 L/yr |
Senior Associate 2
686
salaries
| ₹15 L/yr - ₹42 L/yr |
Genpact
DXC Technology
Sutherland Global Services
Optum Global Solutions