5

Help Needed. Modified Binary Search.

 2 years ago
source link: http://codeforces.com/blog/entry/107353
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
neoserver,ios ssh client

Help Needed. Modified Binary Search.

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.


report

Recommend

About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK