DAY 147 – Number of Subarrays of 0's | JAVA | C++ GFG POTD 17 Mar

I have tried explaining all approaches possible for the 17 Mar GFG POTD question
1. O(N^2), O(1) – Foriming all possible Subarrays
2. O(N), O(1) – for n=3 number of subarray form is n*(n+1)/2

Watch at 1.5 or 2x for a better experience
DSA REPOSITORY: https://github.com/AkshayAnil1080/DSA

Linkedin/Instagram: https://linktr.ee/aksh_yay
My Insta Acc (specifically made for all of you for any doubts and guidance) – https://www.instagram.com/dsa_with_akshay/

AKSHAY SDE SHEET – I’ll keep adding as soon as I finish teaching here. https://docs.google.com/spreadsheets/d/1fPF4O3AW_06bC-_FOkLEU-hYKmESwjB-wmXkf4CZrtY/edit?usp=sharing

Syllabus – https://1drv.ms/w/s!AgUtpJVzIfAVlCere0_dQXqoUQ_B?e=nWwW33

Code “AKSHAYS10” for 10% off at GFG courses:
https://practice.geeksforgeeks.org/courses?utm_source=youtube&utm_medium=collab_akshayanil_description&utm_campaign=affiliateash

GFG POTD Playlist – https://www.youtube.com/watch?v=xID8oz1BKZM&list=PL7EDHkJGOkPSPJBd6lInxbLucaSxHLZxu&index=2

Arrays – https://www.youtube.com/watch?v=_mlDsYT2zcc&list=PL7EDHkJGOkPQF8cUu_PL9zpS53uN9ULV1

DP playlist – https://www.youtube.com/watch?v=_mlDsYT2zcc&list=PL7EDHkJGOkPQF8cUu_PL9zpS53uN9ULV1

My GFG Profile: https://auth.geeksforgeeks.org/user/akshayanil/practice

Hello, I am Akshay.
I am a Software Engineer at @Brillio. I have made this channel to help all ready to learn, grow, and do something big in Tech. I create content on Data Structures and Algorithms, to fine-tune the problem-solving skills that will help students and software engineers.

Happy Coding 🤝
.
.
.
LIKE | SHARE | SUBSCRIBE
#AkshayAnil #dsa #programming #gfg #gfgpotd #problemsolving #coding #softwareengineer #faang #dsa_with_akshay