Day 5 | Array Easy Questions | 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 digs deep and solves a few simple problems within the world of arrays. He solves frequently asked as well as simple problems around the structures of arrays!

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 5 | Array Easy Questions
2:17 Brief on summary of the topic
7:09 WAP to find max element in an array
34:13 Q- Kids with the greater number of candies
59:29 Running sum of 1D array
1:13:00 Given an array count the frequency of each number
1:30:32 Number of good pairs
1:52:01 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!