NoobCoder000's blog

Help Needed. Modified Binary Search.
By NoobCoder000, history, 19 months ago, In English

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.

  • Vote: I like it
  • -6
  • Vote: I do not like it

Comments Comments (5)
| Write comment?
»
19 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I can't understand the statement properly. Because you don't know how to take pictures.

You have wasted my time phool

→ Reply
  • »
    »
    19 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Updated

    → Reply
    • »
      »
      »
      19 months ago, # ^ |
      ← Rev. 3   Vote: I like it 0 Vote: I do not like it

      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

      → Reply
      • »
        »
        »
        »
        19 months ago, # ^ |
          Vote: I like it +5 Vote: I do not like it
        i think "000" signature is 1

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

        → Reply
»
19 months ago, # |
  Vote: I like it +5 Vote: I do not like it

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

→ Reply