pashka's blog

ITMO Algorithms Course. Lecture 1
By pashka, history, 7 weeks ago, In English

Here is the video of the first lecture of the course. Thanks to everyone who watched the live stream.

I prepared some home tasks, if you want to practice you can solve them and send your solutions into this form. I plan to make special stream on Twitch where I will comment your solutions (probably not all of them, but pick some at random). Stay tuned.

One more thing. It will be nice to have subtitles for the videos, but it takes too much time to do it myself, so I opened the community contribution for the subtitles. Please join if you want to contribute.

See you next week!

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

Comments Comments (10)
»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

thank you so much

→ Reply
»
7 weeks ago, # |
← Rev. 3   Vote: I like it +13 Vote: I do not like it

It would be best if a Russian speaker could add English subtitles to the current available videos(which are in Russian) on your youtube channel, as there is so much content already available(probably all 4 semesters) but sadly only in Russian.

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

https://www.edx.org/course/how-to-win-coding-competitions-secrets-of-champion

Is this the mirror course?

→ Reply
»
7 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

Homework exercisers are great!

btw. Youtube is deleting the community contribution by the end of September.

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

oh I missed the first one. Calendar synced and I will be attending from next lecture. Home works are nice!

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

hey pashka can you please teach two days in a week please? i am very eager to learn the semester 3 topics from you which consists of graphs. it will be very helpful. one day in a week is too slow and will take very long time to reach the semester 3.

Thanks a lot for the initiative.

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

Thanks for your efforts. It's really awesome!

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

Doubt related to time complexity

Problem: https://atcoder.jp/contests/abc177/tasks/abc177_b

The editorial solution of the problem implements: for(int i=0;i<S.zie()-T.size();i++) for(int j=0;j<T.size;j++) //some task

My code implementation: for(int i=0;i<S.size();i+=T.size()-1) for(int j=0;j<T.size;j++) //some task

The time complexity of my solution should be O( (|S|/|T|))*|T| ) => O(|S|) The time complexity of the editorial is O(|S||T|) But I am getting TLE for some cases , so am I calculating the time complexity wrong

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

Just Love. :)

→ Reply