md.ashif313's blog

Google APAC Kickstart 2017 Round C is coming
By md.ashif313, 7 years ago, In English

Attention!!!!

Google's hiring contest, Kickstart 2017 Round C is going to held on Sunday, June 25, 2017 19:00 UTC – 22:00 UTC.

Ready to get started solving fun, challenging problems? Throughout the year, Code Jam hosts online Kickstart rounds to give students the opportunity to develop their coding skills, get acquainted with Code Jam’s competition arena, and potentially get noticed by Google recruiters, too. Participate in one—or join them all!

Please visit here to join and fun!!!!

  • Vote: I like it
  • +17
  • Vote: I do not like it

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

upto what rank will be called for an interiew at google?

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve C large and D?

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    I solved C Large with DP when N == 2, such that:

    dp[i][s1][s2] := max score that I have acquired starting at i-th question such that player 1 has s1 points and player 2 has s2 points left to obtain.

    The transitions are quite straightforward, you just need to check if your i-th answer matches with the other players' answers, and then act accordingly.

    Code.

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

      Didn't recognized that it can be solved by dp. Was trying to somehow apply greedy.

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

        Actually greedy works for large set

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

    Here's a link to the official analysis

    → Reply