Dive into essential mathematical concepts crucial for data structures and algorithms in this comprehensive video tutorial. Explore prime numbers, the Sieve of Eratosthenes, Newton's square root method, factors, modulo properties, HCF/LCM, and the Euclidean algorithm. Learn through practical examples, including the Die-Hard problem, and gain insights into complexity analysis. Participate in the learning-in-public initiative by sharing your progress on social media. Access additional resources, including a complete Java DSA playlist, code assignments, and notes, to further enhance your understanding of these fundamental topics for technical interviews and placements.
Overview
Syllabus
Introduction
Prime Numbers
Question
Sieve of Eratosthenes
Complexity Analysis of SoE
Square Root
Newton Raphson Method
Complexity Analysis of NRM
Factors
Optimised Code for Factors
Modulo Properties
Die-Hard Example
HCF/GCD
Euclidean Algorithm
LCM
Outro
Taught by
Kunal Kushwaha
