thejokiran91's blog

By thejokiran91, history, 7 years ago, In English

https://www.hackerearth.com/challenge/hiring/monocept-hiring-challenge/problems/

help needed to solve this kind of problems,detailed approach to problems of this kind is appreciated.

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

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

i solved the first problem using binary search, it's similar to the problem 676C - Вася и строка, only here we check for all 52 characters.

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

First question can be answered by maximum sliding window pseudo code.

Second one is different ... idea is that first you will select only one number to be in your set then if you can add other numbers then add it ....from here try to think yourself....