Lecture 12 of DSA Series : Time & Space Complexity in Detail Share your progress on Twitter : https://x.com/ShradhaKhapra_ SDE Sheet Link : https://docs.google.com/spreadsheets/d/1mvlc8EYc3OVVU3X7NKoC0iZJr_45BL_pVxiJec0r94c/edit?usp=sharing DSA Series full playlist : https://www.youtube.com/playlist?list=PLfqMhTWNBTe137I_EPQd34TsgV6IO55pt Time Stamps : 00:00 Introduction 00:23 Disclaimer 01:17 Why study these concepts? 02:23 Time Complexity 10:53 Big O Notation 16:14 Space Complexity 21:32 Common Time Complexities 23:15 Understanding O(1) 26:35 Understanding O(n) 29:06 Understanding O(n^2) & O(n^3) 34:40 Understanding O(logn) 39:39 O(nlogn) 40:46 O(2^n) & O(n!) 44:03 Solving for Prime Number 45:56 Solving for Selection Sort 48:59 Recursion (Time Complexity) 55:50 Recursion (Space Complexity) 59:28 Solving for Recursive Fibonacci 1:05:43 Solving for Merge Sort 1:16:41 Practical Usage Want to study for Tech Placements/Internships from us : Our Latest Placement Batches : https://linktr.ee/apnacollege.in Shradha Ma'am community Instagram : https://www.instagram.com/shradhakhapra LinkedIn : https://www.linkedin.com/in/shradha-khapra/