Lecture 24: Basic Maths for DSA || Sieve || Modular Arithmetics || Euclid’s Algorithm

Описание: In this Video, we are going to learn some Mathematical concepts required for solving problems :
Find Prime number using Sieve method
GCD/LCM or Euclid’s Algo
Modular Arithmetics/ Fast Exponentiation


There is a lot to learn, Keep in mind “ Mnn boot karega k chor yrr apne se nahi yoga ya maza nahi para, Just ask 1 question “ Why I started ? “

Visit Crio: https://www.crio.do/redeem/94185a5/

GCD reference: https://www.codingninjas.com/blog/202...

Modular Arithmetics Reference: https://codeforces.com/blog/entry/72527

Discord Server Link:   / discord  

Course Flow: https://whimsical.com/dsa-4-placement...

Homework: at the end of the video.

Notes Link: https://drive.google.com/file/d/1loIO...

Code Links: https://github.com/loveBabbar/CodeHel...

Question Links:
Count primes:https://leetcode.com/problems/count-p...
Modular Exponentiation: https://bit.ly/3peOT9i


Do provide you feedback in the comments, we are going to make it best collectively.

Telegram Group Link: Love Babbar CODE HELP
https://telegram.me/lovebabbercodehelp

Connect with me here:

Instagram:   / lovebabbar1  
Twitter:   / lovebabbar3  

My Editor:   / rishu.rsingh  

Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.

Timestamps:

00:00 - Introduction
00:40 - Prime Numbers
01:41 - Brute Force Approach
04:08 - Promotion
05:04 - Count Primes [Question 1]
08:29 - Sieve of Eratosthenes
13:09 - Code
16:33 - Complexity Analysis
18:35 - Homework
18:58 - GCD/HCF
20:58 - Euclid’s Algo
24:07 - Code
25:20 - GCD article
25:35 - LCM and GCD
27:08 - Modulo Arithmetics
30:12 - Fast Exponentiation
33:38 - Code
39:26 - Homework

#DSABusted #LoveBabbar