Summary
Full Transcript
SPACE COMPLEXITY : https://youtu.be/bvskLsirgrk FREE COMPETITIVE PROGRAMMING COURSE PLAYLIST : https://youtube.com/playlist?list=PLauivoElc3ggagradg8MfOZreCMmXMmJ- FOR DOUBTS AND DISCUSSIONS, JOIN DISCORD : https://discord.gg/GMH23tq7Y7 CONNECT ON INSTAGRAM : https://www.instagram.com/i._m_.luv/ In this video I explain to you in detail concept of time complexity analysis and constraints in Competitive Programming. Time Complexity is a topic of which if you don't have proper clarity then you are going to face hard time doing competitive Programming. This video covers a lot of examples related to time complexity which you should know and would help you a lot in future in competitive programming Timestamps: What is Time Complexity : (0:00) O(1) and O(N) Complexity : (1:40) Online Coding websites Limits : (6:03) O(N) Complexity Example : (8:17) O(N^2) Complexity Example: (10:02) O(LogN) Complexity Example: (11:36) Time Complexity which doesn't looks N^2 : (17:15) Sum of N over all Test Cases : (21:07) Be a part of our awesome Community. Join ○ Discord : https://discord.gg/GMH23tq7Y7 ○ Telegram : https://t.me/LuvIsMeYT You can follow me on below platforms for all the latest updates ○ Instagram : https://www.instagram.com/i._m_.luv/ ○ Twitter : https://twitter.com/Luvk1412 ○ Linkedin : https://www.linkedin.com/in/luvk1412/ Blog(Not frequently updated) ○ Blog : https://www.codewithluv.in Hashtags #timecomplexity #analysis #constraints #competitiveprogramming
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
