CodeLogn
الذهاب إلى القناة على Telegram
👇 👉 Data Structure. 👉 Algorithm. 👉 C++ / Python. 👉 Competitive programming. INSTAGRAM👉https://instagram.com/codelogn BLOG👉https://codelogn.blogspot.com/ YouTube 👉https://youtu.be/svNeD6lEIL8
إظهار المزيدلم يتم تحديد البلدالفئة غير محددة
1 426
المشتركون
لا توجد بيانات24 ساعات
-47 أيام
-2030 أيام
أرشيف المشاركات
1 426
We would like to invite you to attend our upcoming meetup on 7th April 2023 . The event will be held Online and will begin at 7pm. We believe that this event will be of great benefit to you and we hope that you will be able to join us.
1 426
Hope Everyone doing great. There is a repository where you get all important concept of c++ basic to advance . Also it's open for contribute so learn it apply it and invent something new .
1 426
I hope the New Year 2023 brings abundant joy, prosperity, love, and blessings! The New year will be extraordinary and filled with happiness for you. I wish you and your family a wonderful new year! I am very fortunate to have you in my life this New Year. #codetilllogn #dsalgo1
1 426
From a long time I think I should have to continue my youtube channel. There's lot's of thing which I can taught you guy's.
1 426
Backend internship
Company Name : INDMoney
Role : SDE Internship ( Frontend, Full Stack and Backend)
Batch : 2023 passouts.
Link : https://docs.google.com/forms/d/e/1FAIpQLSfulAdqBhf_7naKgE9jLZ8NuUUHEed2Xli4w6TbJsn_0cLPeg/viewform
Apply as early as possible, will be closed soon :)
1 426
🔥 Colgate Hiring Data Engineer (2023/2022 Batch)
👉 Direct link: https://bit.ly/3qoK0dE
⏳ Apply Fast, Job Expires Soon
1 426
>Some rules for big-oh:
1. Ignore the lower order terms.
2. Ignore the coefficients of the highest-order term.
3. NO need to specify the base of logarithm
If T1(N)=O f(N) & T2(N)=O g(N)
T1(N)+T2(N) = max( O(f(N)), O(g(N)) )
T1(N)*T2(N) = O(f(N)* g(N))
