- Популярные видео
- Авто
- Видео-блоги
- ДТП, аварии
- Для маленьких
- Еда, напитки
- Животные
- Закон и право
- Знаменитости
- Игры
- Искусство
- Комедии
- Красота, мода
- Кулинария, рецепты
- Люди
- Мото
- Музыка
- Мультфильмы
- Наука, технологии
- Новости
- Образование
- Политика
- Праздники
- Приколы
- Природа
- Происшествия
- Путешествия
- Развлечения
- Ржач
- Семья
- Сериалы
- Спорт
- Стиль жизни
- ТВ передачи
- Танцы
- Технологии
- Товары
- Ужасы
- Фильмы
- Шоу-бизнес
- Юмор
Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405
Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK - https://www.youtube.com/watch?v=FMBW7m1Wap0
Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK - https://www.youtube.com/watch?v=D320QeHS0XQ
Hi Everyone, this is the 32nd video of our Playlist "Maths Playlist : Popular Interview Problems".
Now we will be solving an good level Maths Combinatorics problem - Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405 | codestorywithMIK
We will break it down into simple steps to make it easier to understand. We will deep dive into the Maths behind it.
Problem Name : Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405 | codestorywithMIK
Company Tags :
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Mathematical/Count%20the%20Number%20of%20Arrays%20with%20K%20Matching%20Adjacent%20Elements.cpp
Leetcode Link : https://leetcode.com/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements
My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My Segment Tree Concepts Playlist : https://www.youtube.com/watch?v=k99r1A7krcY&list=PLpIkg8OmuX-K1qUIQToCllUO0UIKXt8dB
My Recursion Concepts Playlist : https://www.youtube.com/watch?v=pfb1Zduesi8&list=PLpIkg8OmuX-IBcXsfITH5ql0Lqci1MYPM
Trie Playlist - https://www.youtube.com/watch?v=DMP2bqW6URA&list=PLpIkg8OmuX-I99uuP2BZOz4mI_lms4gVG
Difference Array Technique: Concepts & Qns : https://www.youtube.com/watch?v=ZHNVmtm08WY&list=PLpIkg8OmuX-Kqkb8DqDe_4-Tiav6ilS_L
Monotonic Data Structure Concepts & Qns : https://www.youtube.com/playlist?list=PLpIkg8OmuX-IpUPXh3z8oeKSfRkKhjaTV
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
Video Summary :
We precompute factorials and their modular inverses using Fermat's Little Theorem to efficiently calculate combinations. The total number of good arrays is determined by choosing k adjacent equal positions using n-1Ck, multiplying by m options for the first element, and then (m - 1)^(n - k - 1) for the remaining positions. Binary exponentiation is used for efficient power calculation.
✨ Timelines✨
00:00 - Introduction
0:21 - Motivation
0:37 - Problem Explanation
2:53 - How to identify the topic ? Why not Backtracking/Recursion ?
5:13 - Using Combinatorics to find result
16:16 - Why it is marked Hard ?
18:46 - Prerequisites
21:00 - coding it up
#MIK #mik #Mik
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik
Видео Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405 канала codestorywithMIK
Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK - https://www.youtube.com/watch?v=FMBW7m1Wap0
Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK - https://www.youtube.com/watch?v=D320QeHS0XQ
Hi Everyone, this is the 32nd video of our Playlist "Maths Playlist : Popular Interview Problems".
Now we will be solving an good level Maths Combinatorics problem - Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405 | codestorywithMIK
We will break it down into simple steps to make it easier to understand. We will deep dive into the Maths behind it.
Problem Name : Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405 | codestorywithMIK
Company Tags :
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Mathematical/Count%20the%20Number%20of%20Arrays%20with%20K%20Matching%20Adjacent%20Elements.cpp
Leetcode Link : https://leetcode.com/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements
My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My Segment Tree Concepts Playlist : https://www.youtube.com/watch?v=k99r1A7krcY&list=PLpIkg8OmuX-K1qUIQToCllUO0UIKXt8dB
My Recursion Concepts Playlist : https://www.youtube.com/watch?v=pfb1Zduesi8&list=PLpIkg8OmuX-IBcXsfITH5ql0Lqci1MYPM
Trie Playlist - https://www.youtube.com/watch?v=DMP2bqW6URA&list=PLpIkg8OmuX-I99uuP2BZOz4mI_lms4gVG
Difference Array Technique: Concepts & Qns : https://www.youtube.com/watch?v=ZHNVmtm08WY&list=PLpIkg8OmuX-Kqkb8DqDe_4-Tiav6ilS_L
Monotonic Data Structure Concepts & Qns : https://www.youtube.com/playlist?list=PLpIkg8OmuX-IpUPXh3z8oeKSfRkKhjaTV
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
Video Summary :
We precompute factorials and their modular inverses using Fermat's Little Theorem to efficiently calculate combinations. The total number of good arrays is determined by choosing k adjacent equal positions using n-1Ck, multiplying by m options for the first element, and then (m - 1)^(n - k - 1) for the remaining positions. Binary exponentiation is used for efficient power calculation.
✨ Timelines✨
00:00 - Introduction
0:21 - Motivation
0:37 - Problem Explanation
2:53 - How to identify the topic ? Why not Backtracking/Recursion ?
5:13 - Using Combinatorics to find result
16:16 - Why it is marked Hard ?
18:46 - Prerequisites
21:00 - coding it up
#MIK #mik #Mik
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik
Видео Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405 канала codestorywithMIK
modular arithmetic modular nCr fermat's little theorem binary exponentiation fast exponentiation leetcode 3405 combinatorics coding interview dsa in hindi dsa playlist maths for interviews codestorywithMIK code story with MIK modular inverse leetcode hard question combinatorics leetcode leetcode maths question modular combinatorics maths leetcode coding with explanation hindi coding video hindi dsa explanation dsa for beginners mik MIK detailed
Комментарии отсутствуют
Информация о видео
17 июня 2025 г. 19:15:49
00:33:16
Другие видео канала





















