ENGLISH : Codechef Jan 2020 Long Challenge video solution

editorial
, ,
1

Hey folks , here you can find the video editorial of

ENGLISH

Thank you guys for watching and keep coding.
CodeNCdode

6 Likes
2

It was really helpful , thank you.

3

Is there a way in which we can know that where was my code lacking?
I tried a different approach but it was failing 2 or 3 test cases. So can I know where does my code fail?

4

I feel there is a need to reveal testcases(atleast after contest) as it happens in codeforces. What say @admin It will help one who came closer to correct solution know where he lagged.

5

i feel the same , after contest revealing test case should not be a problem.

1 Like
6

can you tell me where to study TRIE ?

2 Likes
7
8

unfortunately codechef does not reveal test cases , don’t know the reason but they don’t.
you have to go through the code and check for mistakes.

9

yeah i completely agree , it would help a lot when you are stuck at a problem and couldn’t figure out what test cases are failing.

10

well thank you .

11

you’re always welcome…

12

If we all give this as a suggestion/feedback, then do you think codechef will consider this request?
Chances are very less, but should we give it a try? What say @admin?

13

Wow. Just Wow. God Level Logic.

Someone: "Hey my code works for palindromes! It fails for non-palindromes. What should i do?

@waqar_ahmad224 : “Just convert non-palindromes to palindromes. EUREKA!!”

Really this is a great logic!! Well done @waqar_ahmad224 :wink::wink:

14

well , this is god level appreciation i have received so far.
Thanks man.

1 Like
15

Thanks very much for the useful tutorial :). It took me days of thinking but I couldn’t come up with such a solution.

16

My Intuition is somewhat the same as yours. But I solved a different way. The difference is that I didn’t create a new string and not used Trie, instead, I made tuple of every pair of prefix and suffix of each word and hashed with pair of length and index in a map(dictionary). Then, iterated that map with decreasing order length and for each key, added length it carries to beauty and marked that index processed.
Well, due to lacking preferred data structure my solution is a bit less efficient than yours but worked well in Long Challange.

Bytheway, yours Editorial is really great. Now I have another approach to do the same problem. Keep it up bro.:blush:

17

Thank you very much. Really awesome explanation.

18

you’re welcome.

19

You’re welcome man.