Big O || Time Complexities || Quiz || Lecture 2 || Full DSA with JAVA

In this we have covered Big O, Time Complexities ( O(n), O(log n), O(nLog n), O(n^2), with examples. For better understanding try to solve the QUIZ at last, and understand the logic.
For now O(2^n) and O(n!) are not necessary, these are based on Recursion, so once we will understand the recursion lecture, then i will upload the videos for both.
Full DSA with JAVA course is started, if you want to crack your dream company, watch and learn the concepts. It will surely change you from beginner to advanced coder.
DSA Roadmap Link (It may differ):- drive.google.com/file/d/1q3ER...
Connect with us on Instagram : / itsruntym
#coding #software #softwaredeveloper #job #faang #google #amazon #development #developer #career #itjob #programming #leetcode #codingquestions #googleinterview #microsoftinterview #softwareengineer #amazonjobs #softwaredevelopment #problemsolving #leetcodequestion #interview #array #codingchallenge #startcoding #java #javaquestions #basiccoding #beginners #dsa #datastructures #algorithms #timecomplexity #dsawithjava #itsruntym

[@diksharana3054]

👍👍

[@ash1sh_1hakur10]

🔥🔥

[@tusharsainig]

Thanks for the clear explanation bro❤

[@itsruntym]

Thanks

[@aloksaw512]

notes

[@itsruntym]

Bro i will compile these notes for each video of this FULL DSA playlist, and upload on a platform.. will provide you the link very soon