We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. HourRank 8
  3. What's Next?
  4. Discussions

What's Next?

Sort by

recency

|

19 Discussions

|

  • Neo84
     + 0 comments

    FYI.

    This question has been asked in amazon for second technical round.

  • aza_dev
     + 1 comment

    can anyone suggest what domain does this problem belong to? In other words, if I want to solve it, is there good known algorithms/concepts that address this problem?

  • tanvir_cse072
     + 0 comments

    I am not sure how the input: 6 9304 9002 1 6129 6225 1825 has the output: 7 9304 9002 1 6128 1 1826 6224

  • sumitcodename47
     + 1 comment

    smallest binary with 11 1s is 10001111111111(9215) In example it's given for 11110111001111 (15831) => 11110111010111 (15283) is the smallest. Can someone explain

  • lalitha1729
     + 0 comments

    Problem description itself is having problem, even values refers 1's and odd referes to 0's but it is contadicting below:

    where the values in even indices (0,2,4,…0,2,4,…) represent some number of consecutive 11 bits and the values in odd indices (1,3,5,…1,3,5,…) represent some number of consecutive 00 bits in alternating substrings of BB.

    For example, suppose we have array A={4,1,3,2,4}A={4,1,3,2,4}. A0A0 represents "1111""1111", A1A1 represents "0""0", A2A2 represents "111""111", A3A3 represents "00""00", and A4A4 represents "1111""1111". The number of consecutive binary characters in the ith