Question: Publicis Sapient | ASDE1
3
Entering edit mode

CTC-20 LPA(Base-15)


Online Assessment:-(2 Hours)

2 Coding Questions on Hacker-Earth Platform

  • 1 Medium(DP similar to Unbounded Knapsack)
  • 1 Easy(Set Based)

18 Were Selected For Interviews.


Interview(2 Rounds)

Domain Interview [1 hour]

  • More question were related to Core Subjects(OOPS,OS,DBMS)
  • Low Level Design Question:- Design a Banking System(Only Class Diagrams and Their Cardinality Mappings)
  • Project Related and Deployment Related Questions
  • In DSA, Theoretical Questions Were Asked, Like:-
     --In Browser If we want to go to previous page, which Data Structure is used.
     --How set and Map are implemented Internally.
    

Core Values(HR) [30 Minutes]

3 HR Questions Were Asked. (By Senior Business Manager 10years experience at Publicis Sapient)

  • Why Publicis Sapient?
  • Other 2 Questions Were Situation Based Like You are a new Joinee and was added into a team ... etc (Team Conflict and Being Curious Were the main Idea Behind for these two questions.)

Result - Selected 8 (out of 18) and I was one of them.

Tip:- I attended their PPT Session and used them answering HR questions(Like Their one of Best Project and Average 9+ years Work Period) and I used them in asking questions at the end of interview.

Interviewer was impressed regarding these points in my HR Round.

ADD COMMENTlink 2.3 years ago Raghavendra • 130
1
Entering edit mode

Hey, can anyone confirm if my answers are correct?

  • Stack Datastructure can be used to implement browser history??
  • set/map in C++ i know for sure is implemented using Redblack Tree internally.

Also thanks Raghavendra for including extra information like how many got shortlisted, etc. That painted picture like its happening in real around me!

ADD COMMENTlink 2.3 years ago sampriti 50
Entering edit mode
0

Yes you are right!

  • If we want to implement just 'back' button, only one stack needs to be used. Had question asked to implement forward button, two stacks would have been used.
  • Correct, set/map in C++ are implemented using Red Black Trees which are one form of self-balancing binary search trees.
ADD REPLYlink 2.3 years ago
admin
1.6k

Login before adding your answer.

Similar Posts
Loading Similar Posts