Day 3 | Maths for DSA (Part -II) | DSA by FRAZ

Welcome to NextLeap Coding, a space where one of our instructors Mohammad Fraz breaks down the various essentials of the topic Data Structures and Algorithms (DSA)! In this series we’re covering the maths aspect of DSA! We hope you enjoy these live streamed sessions and are able to get value from them! Stay tuned towards the end as Fraz also takes audience Questions as well!
For doubts join https://t.me/leadcoding2

🚀 Head to http://bit.ly/3H7e7ho to join the NextLeap DSA fellowship

In this episode, Fraz explores the methods of Greatest Common Denominator (GCD) and prime methods, and shows how it affects the working and functionality of various Data Structures!

If you want to break into software development and don’t know where to begin. Check out our Software Developer Fellowship! (a program that PMs swear by)

https://bit.ly/NextLeapSDFYT

Please share your feedback on this episode in the comments sections. It will help us make it better for you.

0:00 Day 3 | Maths for DSA (Part -II)
2:48 Brief on the series
7:08 GCD
1:07:02 Prime check
1:38:0 Feedback with Q&A

Check out NextLeap website for the latest and upcoming programs:

👉http://bit.ly/3W1RgKg

Follow NextLeap on Social Media for all the latest and upcoming:

👉Twitter: https://twitter.com/yourNextLeap

👉 Linkedin: https://www.linkedin.com/company/your...

🔴Subscribe to our channel to get the latest video updates!

Master software development and break into a career at top technology companies in 6 months with NextLeap's Software Developer Fellowship. For more details, click on https://bit.ly/NextLeapSDFYT