Time complexity and common errors [CodeISM 2024 (Class 3-a)]

preview_player
Показать описание
A session on competitive programming, for 1st years IIT(ISM) Dhanbad.
Topic: Time complexity and other pre-requisites for competitive programming
This video covers concepts like finding time complexity of a given code, checking whether our code is efficient enough to pass the time limit, various errors and ways to prevent them including overflows, TLE, MLE, other runtime errors, etc.

Find the complete CP Level 1 (CodeISM 2024) playlist at:
Рекомендации по теме
Комментарии
Автор

Thanks for such an amazing lecture. I haven't got such a clear explanation anywhere before.

RiyaSingh-ylmd
Автор

Sir I'm getting time complexity of homework problem at 27:20 to be O(root n).
Thanks for this tutorial.

kumaarbalbir
Автор

21:44
Can it be O(ln n) ?
If I consider ln 2 as constant

omkumarsingh
Автор

Sir, if i complete your all lectures and problems that you provide + problem practice from (Hacker rank and codeforce), will it be sufficient for mastering CP.

ayushkumar
Автор

Sir what we should do if we get segmentation fault ??

vaibhavagarwal
visit shbcf.ru