తెలుగులో టైమ్ & స్పేస్ కంప్లెక్సిటీ Explained | Big O notation for Interviews 🚀

Hello guys, cheers to another piece of learning. Today I talked why we use Big O notation and what time complexity and space complexities are! Why do we need them? And why are they asked so much in the intervies? I also discussed how time and space complexities are calculated in coding problems

Brute Force in depth ee video lo cheppa - https://youtu.be/H1JTua2uMd8

Subarray Sum equals k code in all languages -
https://www.geeksforgeeks.org/number-subarrays-sum-exactly-equal-k/

Merge Sorted arrays code in all languages -
https://www.geeksforgeeks.org/merge-two-sorted-arrays/

This video is a part of Neetcode 150 playlist on my channel
Link to Neetcode 150 Playlist - https://www.youtube.com/playlist?list=PLq57tMwpU41ZZyn7d6o1ce-jbaGy3qoCE

Link to Neetcode 150 - https://neetcode.io/practice

Regular updates from me on Discord, Insta and Telegram. I post job notifications of telegram and discord

Insta - https://www.instagram.com/bharathh_chandraa/
Telegram - https://t.me/thebharathchandra
Discord - https://discord.gg/tvFcRtEPZK

00:00 - Why is time complexity asked in interviews?
01:36 - What is time complexity
06:57 - Evaluating time complexity of code
18:46 - Examples
32:20 - What is Space Complexity?
36:51 - Need more problems?