javacoder1's blog

WALMART CODESPRINT HACKERRANK QUESTION
By javacoder1, history, 8 years ago, In English

Hi , can someone help me to solve this question , this is a question from the recently held Walmart CodeSprint https://www.hackerrank.com/contests/walmart-codesprint-algo/challenges/digit-minmax-scores

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

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

Try dp states can be position of digit, prev digit, greater than next, state to maintain if number has gone greater than a, state to maintain number has gone less than b

For greater than a and less than b we start setting msb first so if most significant digit is greater than a set greater than a to be one else the digit has to be same as a No such restriction applies once greater than a is set Similarly we can proceed for less than b

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

    Can you share your code?

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

      You can go to 'https://www.hackerrank.com/contests/walmart-codesprint-algo/challenges/digit-minmax-scores/leaderboard' and click on reveal solutions link. after that you should be able to see all the solutions there.

      → Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

Why negative upvotes, i was just unable to solve question during contest so asking for help??

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +11 Vote: I do not like it

Or if you need an editorial ;P https://discuss.codechef.com/questions/4270/sumslope-editorial which was published 4 years before time :

→ Reply