Need Help! and Suggestions :(

I just checked your Codechef profile and you have solved only 38 problems. Solving 38 problems is way too low. You have participated in around 14 contest, accounting for an average of 2 problems/contest, you have just solved 10 extra problems. This would no doubt wouldn’t give you any result. You aren’t upsolving, you aren’t training either.

You can learn Math algorithms, but I doubt it is going to help. Unless you start solving problems, you may learn any number of algos you want but you won’t improve.

6 Likes

Yep. As a data-point:

[simon@simon-laptop][15:33:30]
[~/devel/hackerrank]>find . -iname "*.cpp" | grep -v otherpeople | grep -v experiments | grep -v "my-own-problems" | grep -v blah.cpp | grep -v "code-template.cpp" | grep -v  "snippets.cpp" | grep -v "\-generator.cpp" | wc -l
272
4 Likes

thank you bro…

yup frowning_face: … i will practice more and more… but Some time get frusted, for not able to solve a problem for 2 to3 days…

1 Like

ok thanks :slight_smile:

You are an inspiration @ssjgz. Nice performance in the ongoing contest. As usual, I am unable to figure out medium and harder problems from Div-1, even I need to work harder. :slight_smile: By the way, waiting for your awesome editoral style solutions. Make them as great as always. :stuck_out_tongue:

2 Likes

You flatter me :smiley: Hope my Editorials measure-up this time around :slight_smile:

4 Likes

In my opinion, there is no point of getting stuck on a problem for too long. If you are unable to solve after some time(that some can vary from person to person , but I believe an hour or two should be enough, if you have run out of ideas after this time. There is no point of continuing any further), then it’s better to look for the solutions. The important thing is you should avoid making same mistakes again.

Find a friend who is similar to you and just compete among each other.
I became 5 star in first 11 contest.
It’s because of competition I got from
@black_truce .
He was the one who brought me into competitive programming.
We used to compete with each other really nicely. We don’t even share hints :stuck_out_tongue:.
I am L from “death note” and he was Kira :stuck_out_tongue:
We were rivals.
This will make environment competitive and you’ll definitely give your best. It will make things interesting. You will also uplsove when you got a nice company (/competitor)
It’s not like we were enemies. We used to teach other things after contest.
Edit : @m_never_dies is also a nice friend of mine and he also helped me in getting better.

13 Likes

You need to get out of your comfort zone. Just make it a habit to upsolve atleast 2 problems you could not solve during a contest, by trying later or reading editorials. And give contests on a very frequent basis.

3 Likes

i m also looking for a friend of mine… thanks for your suggestion.

1 Like

what this code will do?

1 Like

Finds all filenames ending in “.cpp”; filters out some irrelevant ones; and counts the ones that are left :slight_smile:

1 Like

sorry, but i didn’t understand. where it gonna find?
codechef database?

Oh, no - my local hard drive :slight_smile:

I think @ssjgz is showing his own pc, That he has solved 272 problems and has codes for each one of them in his pc, and he has just taken part in 4 contests.
So practice == everything

3 Likes

Precisely :slight_smile:

ohh…thanks,but he had probably solved thousand of problems on other judges.

Gosh - this “stopstalk” site works really well - I knew I used to solve questions using the Hackerrank IDE and not storing a copy locally (shudder), but I didn’t know it was this many.

Here’s my profile:

Much better than find and grep :slight_smile:

4 Likes

I will answer your question in steps This answer is solely based on my journey till now .
Step 1: Analysis the constraints properly . Remember 1sec=10^8 operation principal u should analysis whether your code pass all test cases within limit or not.
Step 2: Convertion of thoughts into codes
Learn all fundamentals library function/containers of your favourite language. For example in c++
U should have good knowledge of stl u should know and able to use vectors,sets,maps ,pairs, priority queue,and combination of these like vector of pairs ,map of vectors etc.
By doing these two steps u should be able to solve 2-4 problems in div2 long challenges
Step 3:Learn important data structures and algorithms .
U should know proof and use of these algorithms . The better your knowledge the more comfortable u will become while solving problems.
few algorithm that commonly used are

  1. Range queries (segment trees,Fenwick trees)
  2. Dfs,bfs, Dijkstra
  3. Dynamic programming
  4. Preprocessing,sieve method
  5. Modulo properties
  6. Two pointers, binary search
    Step 4: Practice practice practice
    Participate in contest do upsolving problems as much as u can.
    Cover all remaining topics such as min-cut max flow dp on trees,dp on graph ,meet in middle by upsolving or just solving in practice section.
    Learn on the go while solving problems. It’s a long journey and u will enjoy it a lot.
2 Likes