Java and DSA Foundation Course - Time and Space Complexity and Big O Notation | How to avoid TLE | Lecture 25 | Java and DSA Course

Ever wondered, why one algorithm is better than the other ? What is time and space complexity of an algorithm ? These and many more questions will be answered here by Manvi mam. This lecture is going to be extremely important and crucial if you are preparing for any kind of interview. Let us catch up in the class ! If you are facing any trouble accessing the assignment or lesson plan, please re-login to your account on PW Skills website and try. Are you finding the classes helpful? Stay tuned for more! Access the notes and assignments for this class for free at : If you are joining us late, to know more about PWSkills & plans : Watch the Orientation Video: https://www.youtube.com/watch?v=YpNFgTKVAtU Watch the Launch Video: https://www.youtube.com/watch?v=si8TKULKmLE TIME STAMPS: 00:00 - Introduction 01:12 - Recap 01:55 - Today's Checklist 02:32 - Concept of Time Complexity 28:05 - Types of time complexity and annotations 41:12 - Calculating the time complexity for traversing an array of length N 44:36 - Time complexity when traversing two individual arrays of length M and N respectively 46:22 - Time complexity for nested loops 59:09 - Time complexity for traversing the array while multiplying the increment value by 2 1:14:50 - Calculating the time complexity of a given loop (i=i*k) 1:20:55 - Summary of time complexity 1:25:00 - Concept of space complexity 1:31:54 - Space complexity of reversing an array 1:34:50 - Calculation of space complexity for an array of length N 1:35:12 - Space complexity for a 2-D array/matrix of N rows and M columns 1:37:40 - Summary ▶️ PW Skills Website - https://pwskills.com ▶️ PW Skills Instagram - https://www.instagram.com/pwcollegewallah ▶️ PW Skills LinkedIn Channel - https://www.linkedin.com/in/pw-skills-136050249/ ▶️ PW Skills Telegram Channel- https://t.me/SkillsPW