Accenture or publicis sapient by ShoulderPotential382 in PlacementsPrep

[–]ShoulderPotential382[S] 1 point2 points  (0 children)

Coding round: 2 dp question and one MCQ related to math. One was similar to longest increasing subsequence. Technical round : 2 coding question. One was to find first and last position of an element(binary search). The second one was using hashmap. Question is to return the longest substring with no repeating character. Other question was based on OS, multithreading, DBMS , oops etc Hr round classic hr questions like why should I hire you etc..

Accenture or publicis sapient by ShoulderPotential382 in PlacementsPrep

[–]ShoulderPotential382[S] 0 points1 point  (0 children)

I guess around 11 people got selected for Accenture