Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK

Subscribers:
105,000
Published on ● Video Link: https://www.youtube.com/watch?v=FMBW7m1Wap0



Duration: 0:00
4,228 views
243


iPad PDF Notes - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/iPad PDF Notes/Modular nCr using Fermat’s Little Theorem.pdf
WhatsApp Community Link - https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A

Binary Exponentiation | Fast Exponentiation -    • Binary Exponentiation | Fast Exponent...  

This is the 4th video of our playlist "Maths Concepts & Questions". Find the Details below:

Video Name: Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
Video #: 4

🔍 Mastering Maths for Coding: Simplified & Powerful.

🎥 Welcome to the 4th Video of my Maths Concepts Playlist!
🚀 In this important session, we’ll dive into Fermat's Little Theorem — an essential concept used to solve modular inverse problems, especially for modular nCr in coding challenges.

🔍 What's Inside?

In Modular Arithmetic, we can’t divide directly — so how do we calculate things like r!(n−r)!10!​modp?
That’s where Fermat’s Little Theorem becomes a powerful tool!

We’ll cover:
Why we can’t divide normally in modular arithmetic
The concept of modular inverse and how to find it
Using Fermat’s Theorem to simplify division in modulo
Full code walkthrough of nCr(n, r) modulo a prime number
How it’s applied in DSA & Competitive Programming
👨 ‍🏫 Explained with beginner-friendly language, clean code, and helpful math intuition!


👩 ‍💻 Who Should Watch?
Anyone preparing for coding interviews, DSA practice, or competitive programming problems where modular arithmetic plays a role — this is your go-to concept!
🚀 Let’s simplify Maths and use it like a pro in your next coding challenge.

📌 My Other Playlists
My DP Concepts Playlist:    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist:    • Graph Concepts & Qns - 1 : Graph will...  
My Recursion Concepts Playlist:    • Introduction | Recursion Concepts And...  
Trie Playlist :    • Word Search II (Google, Amazon, Meta,...  
Difference Array Technique:    • Introduction | What | How | Differenc...  
Maths Concepts & Qns :    • Find Median of X Sized Subarrays | We...  
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:    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

Summary :
In this video, I have explained how Fermat’s Little Theorem helps us find the modular inverse, which allows us to calculate nCr under modulo when direct division isn’t allowed.
Using the formula (a^M−2) % M (for prime M), we compute modular inverses efficiently. I’ve also walked through the nCr function implementation, commonly used in DSA questions involving combinations.
By the end of this video, you’ll understand how to avoid division errors and compute combinations with modulus like a pro - a key trick for interview & CP success!



✨ Timelines✨
00:00 - Introduction
0:16 - Motivation
0:35 - Topic Name
1:05 - Basic Arithmetic Vs Modular Arithmetic
2:32 - nCr
4:29 - Why do we need this ?
6:56 - What is Modular Inverse of a Mod M
9:33 - Fermat's Little Theorem
15:00 - Coding it up
21:27 - Application Leetcode Problem

#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 #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #github #designthinking #learningtogether #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik




Other Videos By codestorywithMIK


2025-05-02Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK
2025-05-02Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK
2025-05-01Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
2025-04-29Find Numbers With Even Number Of Digits | Multiple Ways | Leetcode 1295 | codestorywithMIK
2025-04-27Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK
2025-04-26Count Subarrays of Length Three With a Condition | Easy | Leetcode 3392 | codestorywithMIK
2025-04-25Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
2025-04-23Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK
2025-04-22Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK
2025-04-22Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK
2025-04-22Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | codestorywithMIK
2025-04-20Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK
2025-04-20Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK
2025-04-17Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176
2025-04-15Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK
2025-04-15Count Good Triplets in an Array | Segment Tree Concepts & Qns | Video 12 | Leetcode 2179 | MIK
2025-04-13Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK
2025-04-12Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK
2025-04-10Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK
2025-04-10Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK
2025-04-09Youtube Audio Track Feature | Change Audio Language | codestorywithMIK