Hello guys, Today I attended American express hiring challenge and solved 3/3, but there was mentioned as - Candidates from this
list of colleges are eligible to participate in the challenge and will be considered for hiring
Is there any chance I can still receive mail regarding selection.
The Shortlising criteria for interns is allotted to only those eligible colleges.
Can you tell me the approach or share the code for the second question of the contest?
Thanks in advance!!
I think questions were different for everyone, can you tell me which question?
Can anyone explain me how to do Candy love question?
Questions in my set -
- Find the value
- Xor-Sum
- its was something like find cost to reach nth floor
Can anyone provide problem statement of Candy Love problem β¦??
can you share code of Xor-sum?
Itβs a DP problem similar to assembly line scheduling.
Here we can observe that to maximize the answer, we either have to select 1 or max available candy.
Hope it helps.!
Similar problem
can you please share the code how you solved find the value problem !!
It is basically the standard problem of inversion count in an array.using merge sort algorithm
The approach is to use inversion count using merge sort algorithm if you looked carefully at the question.
Basically on careful observation you would have find that the required value is nothing but the first bit having 0 or free bit in the binary representation of the given number it will be easy to calculate then that number in decimal.
Thanks a lot
did any one solved graph problem then please share your idea .
Thanks is advance!