I recently gave an OA for a startup a few days back, I could not solve it then, looking for solution now. I am a noobie/learner. I really appreciate help.

Problem in a nutshell: Return the count of all permutations whose signature is equal to the signature provided in the problem. Signature of permutation p is a binary string(consisting of 0's and 1's), if signature[i] = 1 then the element i can be successful found using the given binary search algorithm on the permutation p else if signature[i] = 0 then the element i cannot be searched using the binary search algorithm (provided in the pseudo code). Constraints: The size of the signature string can be atmost 50.

Auto comment: topic has been updated by NoobCoder000 (previous revision, new revision, compare).I can't understand the statement properly. Because you don't know how to take pictures.

You have wasted my time phool

Updated

For "000" why the answer is 0.

i think "000" signature is 1.

2, 0, 1 and 1, 0, 2 are the permutations of length 3 with signature equal 1.

There are some other permutations also i think

My brother in christ, "000" is the signature.

Auto comment: topic has been updated by NoobCoder000 (previous revision, new revision, compare).Here are very detailed answers:

http://www.catb.org/~esr/faqs/smart-questions.html

?

frist screenshot in 1960s people before 1960s:......