HRBP interview questions shared by candidates
Considering a 2-dimension matrix that can only be traversed by 1 adjacent position at a time and never diagonally. Create an algorithm to traverse that matrix from its upper-left corner to its lower-right corner using the shorter possible path in the most efficient way.
This is a very interesting problem. Although I knew immediately that I had to use recursion to effectively traverse the matrix and eventually got a working algorithm, the catch to make the algorithm much more efficient is to traverse the matrix backwards.
How back traverse make the algo efficient?
Why not just go all the way down then all the way right? Without diagonal moves the path length is fixed. Unless they provide a different definition for 'shortest length'
None, I work in talent acquisition so unless someone is being difficult I'm lucky to be able to handle just about anything Oh wait, this one went down a wonky path: "If you were hired how would you onboard yourself and integrate with the team" "What would your focus be after you started"
The Director asked me if I thought HR was black and white or gray? This is a very bad question and especially form someone on her level. The Director also only interviewed me for 10min and then said she had to leave for an appointment. The feedback of why I didn't get the role was I was too nice. I am okay with not getting it there is NO DIVERSITY in the CLT office..
See Interview Questions for Similar Jobs
- Software Engineer
- Software Developer
- Software Development Engineer
- Staff Software Engineer
- Principal Software Engineer
- Senior Software Developer
- Product Manager
- Software Engineer III
- Senior Software Development Engineer
- Data Scientist
- Project Manager
- Vice President
- Software Development Engineer II
- Engineering Manager
- Java Developer