lalit.n.chandora's blog

By lalit.n.chandora, history, 5 years ago, In English

I am newbie in the competitive programming community. I have solved a few problems with difficulty less than 1200 mostly with tags greedy, math, implementation. Here are my submissions Then I started to move on with different tags starting from data structures But now, I cannot solve those problems (tagged data structures) , though I seem to understand those questions but I cannot code most of the solution... still there were some problems on which I got AC, but they seem to have execution time > 1000 ms which I think are not efficient, right ? Can anyone please help me on how to move ahead in this journey ? It would be very good. More specifically I want to know how to solve problems ahead with possibly more difficulty and varying tags, or is there something wrong with my approach ?

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

Data structures problems mainly meant you should use one of the following

Segment tree, Fenwick tree, hld, mo's, centroids or any other advance data structure

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

    But even if I try to solve questions with difficulty less than 1200 still I am unable to solve it. Though I understand it once I see the tutorials.

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

      Then data structures is one of the way to solving it if it had multiple tags.