Nafis424's blog

HELPPPPP
By Nafis424, history, 3 weeks ago, In English

Hlw everyone, Please give me guide to become pupil Which Which dsa should i learn . Plz help me. Thank you all.

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

»
3 weeks ago, # |
← Rev. 4   Vote: I like it 0 Vote: I do not like it

You don't need some specific dsa.

you should know about basic data structures like min heap, max heap, stacks and queues, and linked lists. Along with you must know binary-search related things and a little bit of dp. Plus a lot of bit manipulations and number theory

These are some topics that sometimes come in div2 contests in the first 3 problems,

For a major number of problems, you just need to improve your implementation skills and learn more about the language you use.

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

    It's amusing that you're advising him on becoming a pupil when you're still a NEWBIE!

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

      because sometimes people who have failed a lot of times can give good advice compared to people who have succeeded

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

    what is min heap and max heap and you dont need to know linked list i never used it in a cf problem

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

      yeah never saw a linked list problem on cf, I solve leetcode also that's why I wrote it, and max heap and min heap are just data structures implemented using priority_queue in stl for c++ and PriorityQueue in collections for Java

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

        leetcode is different to cf you might find those data structures there but there are different ones that are more in use here tbh the most important is number theory dp and bs

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

    Thanks you very much for your suggestions

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

if u use cpp then u must know stl, solve adhoc problems, learn number theory and binary search and u will reach pupil

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

    What adhoc means ??

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

      adhoc are types of problems, where no particular template of solutions or a fixed algorithm can work

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

      tag search constructive algorithm problems they are adhoc no extra knowledge helps just pure thinking and your problem solving skills are tested

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

    This was a really genuine advice. Everyone tells just to solve problems. But I think these topics hold us back from becoming pupil fast.

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

ezy.. do more problems which are slightly above your comfort zone.

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

Personally, I wouldn't worry about DSA at thos point and instead focus on figuring out the trick to ad-hoc problems more, which will almost definitely help you solve A and B in Div2 rounds. Personally, I was able to get to pupil with no DSA (aside from one use of DFS, but I hadn't learned it yet and kinda guessed how to do it mid comp).

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

Something something useless algorithms solve problems learn binary search?

→ Reply