MohamedAboOkail's blog

100 Problems "Graphs" (Practice)
By MohamedAboOkail, 3 years ago, In English

Hello everyone!

I created this simple training that contains 100 Problems "graphs, dfs and similar, dsu".

Difficulty of problems from 1200 to 1700

Group link: Graphs Problems

Group ratings
Some other trainings

Welcome all suggestions for improving training

Good luck everyone!

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

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

Oh,that's really good!

"Graphs, dfs and similar, dsu" ----> this is really important for beginners!

Thanks. :)

→ Reply
  • »
    »
    14 months ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Can you suggest something for the graph modeling problem? I know the theory but most of the code forces problems are not directly based on graphs. I have to identify that the problem can be converted into a graph and then apply some graph algo which seems to me too difficult.

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

      Bro now im also facing the problem watched video from luv for graph and came to the codeforces graph tag with maximum submission, but I couldn’t understand their statement it seem very difficult to me, like which one is the best way to practice, as i see you has a nice progress and you went with this phase in recent times, so I believe you can guide me better way.i am really hoping of your helping hand, thank you vai, god bless you.

      → Reply
      • »
        »
        »
        »
        10 months ago, # ^ |
        ← Rev. 5   Vote: I like it +1 Vote: I do not like it

        Till you reach 1500 I don't think the graph(+Tree) needs but if you want to learn then in my case only practice works, With time you will realize whether the graph can be applied on not. Poblems below 1500 rating questions on the graph need a basic understanding of the graph and standard algo.

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

          for my interview and i need to learn this and even if you look at the last frequent div-3 there most of the question from d is tree or graph ,so thats why i want to learn, doing a2oj a and b ladder, but i didnt understand your guidance, like practice works with time, is it like contest question upsolving thats it or have any certain manner to do this like search by 'Graph' tag then solve the new question from the 1000 rating?

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

Sounds cool (:

Could u make a list of string problems?

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

    Problem 1: A + B (String version)

    Take in two strings and concatenate them in sub-O(n) time.

    Constraints: |A|, |B| <= 1e9

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

How do pick the problems ? I think a 1200 problem that involves core graph knowledge is not very likely to exist.

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

could you make one on DP??

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

haha this is helpful since i can solve problems of any rating without knowing.. i wont be scared when i see a high rating. thanks!

→ Reply
»
22 months ago, # |
  Vote: I like it +1 Vote: I do not like it

wow , thank you ! , is same good stuff available for other topics also like binary search , dp ? please provide if u have.

→ Reply
»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks for this! It will help us a lot!

→ Reply